1503 search results - page 200 / 301 » Self-optimizing distributed trees |
125
click to vote
CSR
2008
Springer
15 years 5 months ago
2008
Springer
The universal cover TG of a connected graph G is the unique (possible infinite) tree covering G, i.e., that allows a locally bijective homomorphism from TG to G. Universal covers h...
136
click to vote
NETWORKING
2007
15 years 5 months ago
2007
Multicasting is one of the most important applications in Wireless Ad hoc Networks and the currently emerging Wireless Mesh Networks. In such networks, interference due to the shar...
119
click to vote
CIIT
2004
15 years 5 months ago
2004
In the current information age, the dominant method for information search is by providing few keywords to a search engine. Keyword search is currently one of the most important o...
145
click to vote
DAGSTUHL
2004
15 years 5 months ago
2004
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
109
click to vote
VMV
2003
15 years 5 months ago
2003
We present a novel framework for hierarchical collision detection that can be applied to virtually all bounding volume (BV) hierarchies. It allows an application to trade quality ...