153 search results - page 12 / 31 » Near-linear approximation algorithms for geometric hitting s... |
229
click to vote
ISAAC
2009
Springer
16 years 2 months ago
2009
Springer
We give a simple framework which is an alternative to the celebrated and widely used shifting strategy of Hochbaum and Maass [J. ACM, 1985] which has yielded efficient algorithms ...
182
click to vote
ISAAC
2005
Springer
16 years 1 months ago
2005
Springer
We develop exact and approximate algorithms for computing optimal separators and measuring the extent to which two point sets in d-dimensional space are separated, with respect to...
215
click to vote
APPROX
2010
Springer
15 years 9 months ago
2010
Springer
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
198
click to vote
ISMIR
2004
Springer
16 years 1 months ago
2004
Springer
We consider the music pattern matching problem—to find occurrences of a small fragment of music called the “pattern” in a larger body of music called the “score”—as a...
337
click to vote
ICDE
2002
IEEE
16 years 9 months ago
2002
IEEE
We propose a novel approach to shape-based image retrieval that builds upon a similarity criterion which is based on the average point set distance. Compared to traditional techni...