1046 search results - page 68 / 210 » Approximation Algorithms for Domination Search |
SIGIR
1998
ACM
15 years 4 months ago
1998
ACM
Abstract We present a fast compression and decompression scheme for natural language texts that allows e cient and exible string matching by searching the compressed text directly....
139
click to vote
ICAPR
2009
Springer
15 years 7 months ago
2009
Springer
In this paper, we propose a novel method for fast nearest neighbors retrieval in non-Euclidean and non-metric spaces. We organize the data into a hierarchical fashion that preserv...
104
Voted
STOC
2001
ACM
16 years 24 days ago
2001
ACM
Histograms are typically used to approximate data distributions. Histograms and related synopsis structures have been successful in a wide variety of popular database applications...
102
click to vote
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
Credit institutions are seldom faced with problems dealing with single objectives. Often, decisions involving optimizing two or more competing goals simultaneously need to be made...
121
Voted
SODA
2012
ACM
13 years 2 months ago
2012
ACM
The problem of approximating convex bodies by polytopes is an important and well studied problem. Given a convex body K in Rd , the objective is to minimize the number of vertices...