359 search results - page 14 / 72 » Online Algorithms for Disk Graphs |
TALG
2008
14 years 9 months ago
2008
The Tower of Hanoi problem is generalized by placing pegs on the vertices of a given directed graph G with two distinguished vertices, S and D, and allowing moves only along arcs o...
CIKM
2009
Springer
15 years 2 months ago
2009
Springer
In dynamic environments with frequent content updates, we require online full-text search that scales to large data collections and achieves low search latency. Several recent met...
NIPS
2008
14 years 11 months ago
2008
We continue our study of online prediction of the labelling of a graph. We show a fundamental limitation of Laplacian-based algorithms: if the graph has a large diameter then the ...
OTM
2009
Springer
15 years 4 months ago
2009
Springer
IFIP
2004
Springer
15 years 2 months ago
2004
Springer
We develop an external memory algorithm for computing minimum spanning trees. The algorithm is considerably simpler than previously known external memory algorithms for this proble...