5595 search results - page 136 / 1119 » Approximation Algorithms for Clustering Problems |
125
click to vote
JDA
2006
15 years 4 months ago
2006
We consider the asymmetric traveling salesperson problem with -parameterized triangle inequality for [1/2, 1). That means, the edge weights fulfill w(u, v)
141
click to vote
NIPS
2004
15 years 6 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:...
160
click to vote
SODA
1997
ACM
15 years 6 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...
135
Voted
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 ...
142
click to vote
ICIP
2008
IEEE
15 years 11 months ago
2008
IEEE
In several imaging inverse problems, it may be of interest to encourage the solution to have characteristics which are most naturally expressed by the combination of more than one...