3875 search results - page 107 / 775 » Approximation algorithms for the 0-extension problem |
139
click to vote
NIPS
2004
15 years 5 months ago
2004
Existing algorithms for discrete partially observable Markov decision processes can at best solve problems of a few thousand states due to two important sources of intractability:...
153
click to vote
SODA
1997
ACM
15 years 5 months ago
1997
ACM
The problem of fitting a straight line to a finite collection of points in the plane is an important problem in statistical estimation. Robust estimators are widely used because...
128
click to vote
CCCG
2008
15 years 6 months ago
2008
We consider the problem of embroidering a design pattern, given by a graph G, using a single minimum length thread. We give an exact polynomial-time algorithm for the case that G ...
122
click to vote
ICPR
2010
IEEE
15 years 2 months ago
2010
IEEE
A novel stochastic searching scheme based on the Monte Carlo optimization is presented for polygonal approximation (PA) problem. We propose to combine the split-and-merge based lo...
189
click to vote
COCOON
2010
Springer
15 years 3 months ago
2010
Springer
The problem of sorting permutations by double-cut-and-joins (SBD) arises when we perform the double-cut-and-join (DCJ) operations on pairs of unichromosomal genomes without the gen...