Sciweavers

675 search results - page 38 / 135
» Biased Range Trees
Sort
View
ICITA
2005
IEEE
15 years 4 months ago
Dynamic Markov Compression Using a Crossbar-Like Tree Initial Structure for Chinese Texts
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...
Ghim Hwee Ong, Jun-Ping Ng
FOCS
1992
IEEE
15 years 3 months ago
Dynamic Half-Space Reporting, Geometric Optimization, and Minimum Spanning Trees
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...
Pankaj K. Agarwal, David Eppstein, Jirí Mat...
LISA
2001
15 years 11 days ago
TemplateTree II: The Post-Installation Setup Tool
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...
Tobias Oetiker
COMPGEOM
2010
ACM
15 years 4 months ago
Optimal partition trees
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...
Timothy M. Chan
ICALP
1999
Springer
15 years 3 months ago
Online Data Structures in External Memory
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...
Jeffrey Scott Vitter