10909 search results - page 635 / 2182 » Evaluating Backup Algorithms |
184
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract—We investigate the construction of greedy embeddings in polylogarithmic dimensional Euclidian spaces in order to achieve scalable routing through geographic routing. We ...
205
click to vote
AAIM
2009
Springer
16 years 1 months ago
2009
Springer
During the last years, a wide range of huge networks has been made available to researchers. The discovery of natural groups, a task called graph clustering, in such datasets is a ...
149
click to vote
CIKM
2009
Springer
16 years 1 months ago
2009
Springer
Traditionally, collaborative filtering (CF) algorithms used for recommendation operate on complete knowledge. This makes these algorithms hard to employ in a decentralized contex...
186
click to vote
AINA
2008
IEEE
16 years 1 months ago
2008
IEEE
This paper shows that the performance of peer-to-peer resource discovery algorithms is upper bounded by a k-Steiner minimum tree and proposes an algorithm locating near-optimal qu...
190
click to vote
GLOBECOM
2007
IEEE
16 years 1 months ago
2007
IEEE
—This paper focuses on routing tree construction problem and its influence on the performance of utilizing centralized scheduling in IEEE 802.16 mesh networks. We apply three rou...