53 search results - page 9 / 11 » On external memory graph traversal |
132
Voted
TCS
2008
15 years 3 months ago
2008
We consider the problem of periodic graph exploration by a finite automaton in which an automaton with a constant number of states has to explore all unknown anonymous graphs of a...
144
Voted
SAC
2006
ACM
15 years 9 months ago
2006
ACM
This paper introduces the MTree index algorithm, a special purpose XML XPath index designed to meet the needs of the hierarchical XPath query language. With the increasing importa...
127
Voted
ICNP
2007
IEEE
15 years 10 months ago
2007
IEEE
—Data structures representing directed graphs with edges labeled by symbols from a finite alphabet are used to implement packet processing algorithms used in a variety of network...
99
Voted
ICRA
2009
IEEE
15 years 10 months ago
2009
IEEE
— One of the common applications for outdoor robots is to follow a path in large scale unknown environments. This task is challenging due to the intensive memory requirements to ...
139
Voted
SPAA
2004
ACM
15 years 9 months ago
2004
ACM
We present the Buffer Heap (BH), a cache-oblivious priority queue that supports Delete-Min, Delete, and Decrease-Key operations in O( 1 B log2 N B ) amortized block transfers fro...