88 search results - page 8 / 18 » Approximate Range Searching Using Binary Space Partitions |
ICDE
2003
IEEE
14 years 8 months ago
2003
IEEE
Iceberg-cube mining is to compute the GROUP BY partitions, for all GROUP BY dimension lists, that satisfy a given aggregate constraint. Previous works have pushed anti-monotone co...
FOGA
2011
12 years 11 months ago
2011
The distribution of fitness values across a set of states sharply influences the dynamics of evolutionary processes and heuristic search in combinatorial optimization. In this p...
ALENEX
2001
13 years 8 months ago
2001
Range searches in metric spaces can be very di cult if the space is \high dimensional", i.e. when the histogram of distances has a large mean and a small variance. The so-cal...
TSP
2010
13 years 2 months ago
2010
Abstract-- Information theory provides a novel perspective on passive sonar performance analysis. This approach begins by partitioning the search space and then considers the probl...
SISAP
2009
IEEE
14 years 2 months ago
2009
IEEE
—Metric space searching is an emerging technique to address the problem of efficient similarity searching in many applications, including multimedia databases and other reposito...