359 search results - page 16 / 72 » Online Algorithms for Disk Graphs |
ESA
1998
Springer
15 years 1 months ago
1998
Springer
Abstract. Data sets in large applications are often too massive to t completely inside the computer's internal memory. The resulting input output communication or I O between ...
CIKM
2004
Springer
15 years 2 months ago
2004
Springer
The Google search engine uses a method called PageRank, together with term-based and other ranking techniques, to order search results returned to the user. PageRank uses link ana...
ICML
2005
IEEE
15 years 10 months ago
2005
IEEE
We apply classic online learning techniques similar to the perceptron algorithm to the problem of learning a function defined on a graph. The benefit of our approach includes simp...
MST
2002
14 years 9 months ago
2002
Abstract. Blockwise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is f...
CCCG
2009
14 years 10 months ago
2009
When a graph is drawn in a classical manner, its vertices are shown as small disks and its edges with a positive width; zero-width edges exist only in theory. Let r denote the rad...