32545 search results - page 601 / 6509 » Data Structures and Algorithms |
165
click to vote
SPAA
2005
ACM
16 years 27 days ago
2005
ACM
This paper presents concurrent cache-oblivious (CO) B-trees. We extend the cache-oblivious model to a parallel or distributed setting and present three concurrent CO B-trees. Our ...
248
click to vote
SIGMOD
2011
ACM
14 years 10 months ago
2011
ACM
We consider extending decision support facilities toward large sophisticated networks, upon which multidimensional attributes are associated with network entities, thereby forming...
185
click to vote
STOC
2002
ACM
16 years 7 months ago
2002
ACM
Given a set S of n points in IRd , a (t, )-approximate Voronoi diagram (AVD) is a partition of space into constant complexity cells, where each cell c is associated with t represe...
248
click to vote
FOCS
2009
IEEE
16 years 2 months ago
2009
IEEE
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
223
click to vote
CAISE
1992
Springer
15 years 11 months ago
1992
Springer
In many non trivial application domains, object types with a complex structure occur. Data modelling techniques which only allow flat structures are not suitable for representing ...