2880 search results - page 63 / 576 » Approximate Range Searching |
HEURISTICS
2008
14 years 12 months ago
2008
A Local Linear Embedding (LLE) module enhances the performance of two Evolutionary Computation (EC) algorithms employed as search tools in global optimization problems. The LLE em...
SISAP
2008
IEEE
15 years 6 months ago
2008
IEEE
Many contemporary database applications require similarity-based retrieval of complex objects where the only usable knowledge of its domain is determined by a metric distance func...
FOCS
1994
IEEE
15 years 4 months ago
1994
IEEE
We establish a nonlinear lower bound for halfplane range searching over a group. Specifically, we show that summing up the weights of n (weighted) points within n halfplanes requir...
120
click to vote
AAAI
2000
15 years 1 months ago
2000
Depth-first branch-and-bound (DFBnB) is a complete algorithm that is typically used to find optimal solutions of difficult combinatorial optimization problems. It can also be adap...
STOC
2006
ACM
16 years 5 days ago
2006
ACM
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...