675 search results - page 38 / 135 » Biased Range Trees |
149
click to vote
ICITA
2005
IEEE
15 years 11 months ago
2005
IEEE
This paper proposes the use of a crossbar-like tree structure to use with Dynamic Markov Compression (DMC) for the compression of Chinese text files. DMC had previously been found...
160
click to vote
FOCS
1992
IEEE
15 years 9 months ago
1992
IEEE
We describe dynamic data structures for half-space range reporting and for maintaining the minima of a decomposable function. Using these data structures, we obtain efficient dyna...
145
Voted
LISA
2001
15 years 7 months ago
2001
After installing an OS distribution, a computer is generally not yet properly adapted to go into production at the local site. Security policies must be implemented, local service...
148
click to vote
COMPGEOM
2010
ACM
15 years 10 months ago
2010
ACM
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
127
click to vote
ICALP
1999
Springer
15 years 9 months ago
1999
Springer
The data sets for many of today's computer applications are too large to t within the computer's internal memory and must instead be stored on external storage devices su...