11211 search results - page 2019 / 2243 » Rank-Sensitive Data Structures |
127
click to vote
WG
1993
Springer
15 years 7 months ago
1993
Springer
Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algori...
118
Voted
VLDB
1994
ACM
15 years 7 months ago
1994
ACM
We propose a new R-tree structure that outperforms all the older ones. The heart of the idea is to facilitate the deferred splitting approach in R-trees. This is done by proposing...
128
click to vote
ISAAC
1992
Springer
15 years 7 months ago
1992
Springer
A (0,1)-matrix satisfies the consecutive ones property if there exists a column permutation such that the ones in each row of the resulting matrix are consecutive. Booth and Lueke...
155
click to vote
PEPM
1992
ACM
15 years 7 months ago
1992
ACM
A partial evaluator is an automatic program transformation tool. Given as input a general program and part of its input, it can produce a specialized version. If the partial evalu...
111
click to vote
STACS
1992
Springer
15 years 7 months ago
1992
Springer
In this paper we give a practical and e cient output-sensitive algorithm for constructing the display of a polyhedral terrain. It runs in Od + nlog2 n time and uses On n space, wh...