2168 search results - page 196 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
151
click to vote
ICALP
2004
Springer
15 years 9 months ago
2004
Springer
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
144
click to vote
CF
2009
ACM
15 years 11 months ago
2009
ACM
As multithreaded server applications and runtime systems prevail, garbage collection is becoming an essential feature to support high performance systems. The fundamental issue of...
176
click to vote
COMPGEOM
2004
ACM
15 years 8 months ago
2004
ACM
We introduce a new approach to the problem of collision detection between a rotating milling-cutter of an NC-machine and a model of a solid workpiece, as the rotating cutter conti...
156
click to vote
CSCLP
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Graph pattern matching is a central application in many fields. In various areas, the structure of the pattern can only be approximated and exact matching is then too ac...
144
click to vote
SPIRE
2010
Springer
15 years 2 months ago
2010
Springer
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...