12 search results - page 2 / 3 » Lower bounds for 2-dimensional range counting |
WADS
2005
Springer
13 years 11 months ago
2005
Springer
Spatial databases support a variety of geometric queries on point data such as range searches, nearest neighbor searches, etc. Balanced Aspect Ratio (BAR) trees are hierarchical sp...
ICALP
2009
Springer
14 years 6 months ago
2009
Springer
We consider the following problem: given an unsorted array of n elements, and a sequence of intervals in the array, compute the median in each of the subarrays defined by the inter...
TSP
2010
13 years 13 days 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...
COMPGEOM
1995
ACM
13 years 9 months ago
1995
ACM
The range searching problem is a fundamental problem in computational geometry, with numerous important applications. Most research has focused on solving this problem exactly, bu...
SODA
2010
ACM
14 years 3 months ago
2010
ACM
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...