Sciweavers

5153 search results - page 207 / 1031
» Introduction to Randomized Algorithms
Sort
View
AIRWEB
2007
Springer
15 years 9 months ago
Extracting Link Spam using Biased Random Walks from Spam Seed Sets
Link spam deliberately manipulates hyperlinks between web pages in order to unduly boost the search engine ranking of one or more target pages. Link based ranking algorithms such ...
Baoning Wu, Kumar Chellapilla
SODA
2008
ACM
105views Algorithms» more  SODA 2008»
15 years 4 months ago
Deterministic random walks on regular trees
Jim Propp's rotor router model is a deterministic analogue of a random walk on a graph. Instead of distributing chips randomly, each vertex serves its neighbors in a fixed or...
Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich...
RSA
2000
170views more  RSA 2000»
15 years 3 months ago
Delayed path coupling and generating random permutations
We analyze various stochastic processes for generating permutations almost uniformly at random in distributed and parallel systems. All our protocols are simple, elegant and are b...
Artur Czumaj, Miroslaw Kutylowski
SIAMIS
2010
378views more  SIAMIS 2010»
14 years 10 months ago
Global Interactions in Random Field Models: A Potential Function Ensuring Connectedness
Markov random field (MRF) models, including conditional random field models, are popular in computer vision. However, in order to be computationally tractable, they are limited to ...
Sebastian Nowozin, Christoph H. Lampert
119
Voted
ECCC
2010
103views more  ECCC 2010»
15 years 3 months ago
Time-Space Efficient Simulations of Quantum Computations
We give two time- and space-efficient simulations of quantum computations with intermediate measurements, one by classical randomized computations with unbounded error and the oth...
Dieter van Melkebeek, Thomas Watson