14548 search results - page 2427 / 2910 » The Optimal Path-Matching Problem |
234
click to vote
PRIS
2004
15 years 9 months ago
2004
We address the problem of the combination of multiple data partitions, that we call a clustering ensemble. We use a recent clustering approach, known as Spectral Clustering, and th...
219
Voted
SODA
2001
ACM
15 years 9 months ago
2001
ACM
We consider the problem of scheduling unit-length jobs on identical parallel machines such that the makespan of the resulting schedule is minimized. Precedence constraints impose ...
171
click to vote
VCIP
2001
15 years 9 months ago
2001
We present a technique that provides progressive transmission and near-lossless compression in one single framework. The proposed technique produces a bitstream that results in pr...
175
click to vote
SODA
2004
ACM
15 years 9 months ago
2004
ACM
The inference of evolutionary trees using approaches which attempt to solve the maximum parsimony (MP) and maximum likelihood (ML) optimization problems is a standard part of much...
212
click to vote
AAAI
2000
15 years 9 months ago
2000
Reinforcement learning (RL) can be impractical for many high dimensional problems because of the computational cost of doing stochastic search in large state spaces. We propose a ...