5153 search results - page 164 / 1031 » Introduction to Randomized Algorithms |
121
click to vote
SODA
2010
ACM
15 years 1 months ago
2010
ACM
We consider the following marking process (rw-rand) made by a random walk on an undirected graph G. Upon arrival at a vertex v, it marks v if unmarked and otherwise it marks a ran...
104
click to vote
ICML
2008
IEEE
16 years 3 months ago
2008
IEEE
A broad class of boosting algorithms can be interpreted as performing coordinate-wise gradient descent to minimize some potential function of the margins of a data set. This class...
108
click to vote
STOC
2009
ACM
16 years 3 months ago
2009
ACM
We prove that for any positive integer k, there is a constant ck such that a randomly selected set of cknk log n Boolean vectors with high probability supports a balanced k-wise i...
132
click to vote
FOCS
2000
IEEE
15 years 7 months ago
2000
IEEE
For many probability distributions of interest, it is quite difficult to obtain samples efficiently. Often, Markov chains are employed to obtain approximately random samples fro...
113
click to vote
BERTINORO
2005
Springer
15 years 8 months ago
2005
Springer
Decentralized peer to peer (p2p) networks like Gnutella are attractive for certain applications because they require no centralized directories and no precise control over network ...