5595 search results - page 287 / 1119 » Approximation Algorithms for Clustering Problems |
169
click to vote
IJCV
2007
15 years 6 months ago
2007
This paper describes work aimed at the unsupervised learning of shape-classes from shock trees. We commence by considering how to compute the edit distance between weighted trees. ...
163
click to vote
ICDAR
2009
IEEE
15 years 4 months ago
2009
IEEE
Approximate text search is a basic technique to handle recognized text that contains recognition errors. This paper proposes an approximate string search for recognized text using...
229
click to vote
SWAT
2010
Springer
15 years 5 months ago
2010
Springer
We study the problem of minimizing the diameter of a graph by adding k shortcut edges, for speeding up communication in an existing network design. We develop constant-factor appro...
179
click to vote
FOCS
2000
IEEE
15 years 11 months ago
2000
IEEE
For many probability distributions of interest, it is quite difficult to obtain samples efficiently. Often, Markov chains are employed to obtain approximately random samples fro...
170
click to vote
FOCS
2003
IEEE
15 years 12 months ago
2003
IEEE
We give improved approximation algorithms for a variety of latency minimization problems. In particular, we give a 3.591 -approximation to the minimum latency problem, improving o...