921 search results - page 4 / 185 » New Data Structures for Orthogonal Range Searching |
DCC
2008
IEEE
14 years 7 months ago
2008
IEEE
We introduce a new variant of the popular Burrows-Wheeler transform (BWT) called Geometric Burrows-Wheeler Transform (GBWT). Unlike BWT, which merely permutes the text, GBWT conve...
COMPGEOM
2010
ACM
14 years 15 days 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 ...
CCCG
2008
13 years 8 months ago
2008
We present data structures for triangular emptiness and reporting queries for a planar point set, where the query triangle contains the origin. The data structures use near-linear...
SIGMOD
1999
ACM
13 years 11 months ago
1999
ACM
In recent years, many data mining methods have been proposed for finding useful and structured information from market basket data. The association rule model was recently propos...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
A data structure, called a biased range tree, is presented that preprocesses a set S of n points in R2 and a query distribution D for 2-sided orthogonal range counting queries. The...