1541 search results - page 7 / 309 » Analysis of Random Noise and Random Walk Algorithms |
149
Voted
TOCS
2008
15 years 5 months ago
2008
RaWMS is a novel lightweight random membership service for ad hoc networks. The service provides each node with a partial uniformly chosen view of network nodes. Such a membership...
152
Voted
TC
2008
15 years 5 months ago
2008
Network structure construction and global state maintenance are expensive in large-scale, dynamic peer-to-peer (p2p) networks. With inherent topology independence and low state mai...
148
click to vote
ICML
2004
IEEE
16 years 6 months ago
2004
IEEE
Many NLP tasks rely on accurately estimating word dependency probabilities P(w1|w2), where the words w1 and w2 have a particular relationship (such as verb-object). Because of the...
164
click to vote
ICDCS
2007
IEEE
16 years 4 days ago
2007
IEEE
Uniform random sample is often useful in analyzing data. Usually taking a uniform sample is not a problem if the entire data resides in one location. However, if the data is distr...
156
Voted
ICC
2009
IEEE
16 years 17 days ago
2009
IEEE
—Random walk (RW) has been widely used as a strategy for searching in peer-to-peer networks. The boom of social network applications introduces new impact to the classical algori...