158 search results - page 6 / 32 » Approximate Range Mode and Range Median Queries |
COMPGEOM
1995
ACM
13 years 12 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...
SIBGRAPI
2008
IEEE
14 years 2 months ago
2008
IEEE
Range searching is a fundamental problem in computational geometry. The problem involves preprocessing a set of n points in Rd into a data structure, so that it is possible to det...
WAIM
2009
Springer
14 years 3 months ago
2009
Springer
Large amount of uncertain data is inherent in many novel and important applications such as sensor data analysis and mobile data management. A probabilistic threshold range aggrega...
SPIRE
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. Colored range queries are a well-studied topic in computational geometry and database research that, in the past decade, have found exciting applications in information r...
COMPGEOM
2010
ACM
14 years 1 months ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...