860 search results - page 75 / 172 » Biased Random Walks |
145
click to vote
COLT
2005
Springer
15 years 9 months ago
2005
Springer
In recent work Long and Servedio [LS05] presented a “martingale boosting” algorithm that works by constructing a branching program over weak classifiers and has a simple anal...
161
click to vote
CCR
2004
15 years 3 months ago
2004
There has been much interest in both unstructured and structured overlays recently. Unstructured overlays, like Gnutella, build a random graph and use flooding or random walks on ...
123
click to vote
MOBIHOC
2009
ACM
16 years 4 months ago
2009
ACM
Finding data items is one of the most basic services of any distributed system. It is particular challenging in ad-hoc networks, due to their inherent decentralized nature and lac...
145
click to vote
BMCBI
2010
15 years 4 months ago
2010
Background: Random forests (RF) have been increasingly used in applications such as genome-wide association and microarray studies where predictor correlation is frequently observ...
121
click to vote
STOC
1997
ACM
15 years 8 months ago
1997
ACM
We examine a class of collective coin- ipping games that arises from randomized distributed algorithms with halting failures. In these games, a sequence of local coin ips is gener...