9871 search results - page 1651 / 1975 » On the Structure of Low Sets |
184
click to vote
WG
1993
Springer
15 years 11 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...
164
click to vote
VLDB
1994
ACM
15 years 11 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...
153
Voted
STACS
1992
Springer
15 years 10 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...
199
click to vote
DAC
2007
ACM
15 years 10 months ago
2007
ACM
This paper presents MOJITO, a system which optimizes across thousands of analog circuit topologies simultaneously, and returns a set of sized topologies that collectively provide ...
179
click to vote
DLS
2007
15 years 10 months ago
2007
Mirror-based systems are object-oriented reflective architectures built around a set of design principles that lead to reflective APIs which foster a high degree of reusability, l...