11231 search results - page 1970 / 2247 » Digging for Data Structures |
189
click to vote
SIGGRAPH
1994
ACM
15 years 7 months ago
1994
ACM
The fast identification of shadow regions due to area light sources is necessary for realistic rendering and for discontinuity meshing for global illumination. A new shadow-determ...
124
click to vote
SSD
1993
Springer
15 years 7 months ago
1993
Springer
: Due to the high complexity of objects and queries and also due to extremely large data volumes, geographic database systems impose stringent requirements on their storage and acc...
152
Voted
SIGSOFT
1994
ACM
15 years 7 months ago
1994
ACM
Program slicing is a fundamental operation for many software engineering tools. Currently, the most efficient algorithm for interprocedural slicing is one that uses a program repr...
129
Voted
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...