4541 search results - page 33 / 909 » Cache-Oblivious Algorithms and Data Structures |
SIGCSE
1998
ACM
14 years 22 days ago
1998
ACM
tterns help narrow the gap between the abstract views of the data structures and their concrete implementations. The smaller the gap, the higher the level action. The more abstract...
INFOCOM
2003
IEEE
14 years 1 months ago
2003
IEEE
— The problem of efficient data structures for IP lookups has been well studied in literature. Techniques such as LC tries and Extensible Hashing are commonly used. In this pape...
COCOON
1999
Springer
14 years 24 days ago
1999
Springer
We present results related to satisfying shortest path queries on a planar graph stored in external memory. Let N denote the number of vertices in the graph and let sort(N) denote...
GECCO
2009
Springer
14 years 1 months ago
2009
Springer
We present a novel stereo vision modeling framework that generates approximate, yet physically-plausible representations of objects rather than creating accurate models that are c...
SODA
2001
ACM
13 years 10 months ago
2001
ACM
We address a longstanding open problem of [11, 10], and present a general transformation that transforms any pointer based data structure to be confluently persistent. Such transf...