Sciweavers

862 search results - page 149 / 173
» Random Information Spread in Networks
Sort
View
DEXAW
2005
IEEE
125views Database» more  DEXAW 2005»
15 years 1 months ago
Exploiting Local Popularity to Prune Routing Indices in Peer-to-Peer Systems
Routing in unstructured peer-to-peer systems relies either on broadcasting (also called flooding) or on routing indices. An approach using routing indices is only scalable if the...
Stéphane Bressan, Achmad Nizar Hidayanto, Z...
PODS
2006
ACM
96views Database» more  PODS 2006»
15 years 12 months ago
Efficient gossip-based aggregate computation
Recently, there has been a growing interest in gossip-based protocols that employ randomized communication to ensure robust information dissemination. In this paper, we present a ...
Srinivas R. Kashyap, Supratim Deb, K. V. M. Naidu,...
WEA
2007
Springer
74views Algorithms» more  WEA 2007»
15 years 5 months ago
Landmark-Based Routing in Dynamic Graphs
Many speed-up techniques for route planning in static graphs exist, only few of them are proven to work in a dynamic scenario. Most of them use preprocessed information, which has ...
Daniel Delling, Dorothea Wagner
CCGRID
2005
IEEE
15 years 5 months ago
n-Cycle: a set of algorithms for task distribution on a commodity grid
— The global internet is rich in commodity resources but scarce in specialized resources. We argue that a grid framework can achieve better performance if it separates management...
Ladislau Bölöni, Damla Turgut, Dan C. Ma...
CIKM
2008
Springer
15 years 1 months ago
Learning a two-stage SVM/CRF sequence classifier
Learning a sequence classifier means learning to predict a sequence of output tags based on a set of input data items. For example, recognizing that a handwritten word is "ca...
Guilherme Hoefel, Charles Elkan