1541 search results - page 249 / 309 » Analysis of Random Noise and Random Walk Algorithms |
159
click to vote
COMCOM
2011
14 years 11 months ago
2011
This paper presents a rigorous analytic study of gossip-based message dissemination schemes that can be employed for content/service dissemination or discovery in unstructured and...
149
click to vote
STOC
2009
ACM
16 years 4 months ago
2009
ACM
We present an improved oracle for the distance sensitivity problem. The goal is to preprocess a directed graph G = (V, E) with non-negative edge weights to answer queries of the f...
149
click to vote
WAW
2007
Springer
15 years 10 months ago
2007
Springer
Betweenness is a centrality measure based on shortest paths, widely used in complex network analysis. It is computationally-expensive to exactly determine betweenness; currently th...
134
click to vote
SPAA
2005
ACM
15 years 9 months ago
2005
ACM
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
137
click to vote
FOCS
1995
IEEE
15 years 7 months ago
1995
IEEE
Abstract. Littlestone developed a simple deterministic on-line learning algorithm for learning k-literal disjunctions. This algorithm (called Winnow) keeps one weight for each of t...