Sciweavers

SODA
2008
ACM
105views Algorithms» more  SODA 2008»
13 years 6 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...
EURONGI
2008
Springer
13 years 6 months ago
Location Management Based on the Mobility Patterns of Mobile Users
In this paper, we propose a new mobility model as an extension of the random walk model. Our proposal gathers mobility patterns with several degrees of randomness, so that both ran...
Ignacio Martinez-Arrue, Pablo García-Escall...
DIALM
2008
ACM
140views Algorithms» more  DIALM 2008»
13 years 6 months ago
Latency of opportunistic forwarding in finite regular wireless networks
In opportunistic forwarding, a node randomly relays packets to one of its neighbors based on local information, without the knowledge of global topology. Each intermediate node co...
Prithwish Basu, Chi-Kin Chau
WSC
2007
13 years 7 months ago
Rare-event simulation for a multidimensional random walk with t distributed increments
We consider the problem of efficient estimation of first passage time probabilities for a multidimensional random walk with t distributed increments, via simulation. In addition...
Jose H. Blanchet, Jingchen Liu
CIVR
2010
Springer
299views Image Analysis» more  CIVR 2010»
13 years 7 months ago
Co-reranking by mutual reinforcement for image search
Most existing reranking approaches to image search focus solely on mining "visual" cues within the initial search results. However, the visual information cannot always ...
Ting Yao, Tao Mei, Chong-Wah Ngo
ECAI
2006
Springer
13 years 8 months ago
Random Subset Optimization
Some of the most successful algorithms for satisfiability, such as Walksat, are based on random walks. Similarly, local search algorithms for solving constraint optimization proble...
Boi Faltings, Quang Huy Nguyen
KDD
2010
ACM
252views Data Mining» more  KDD 2010»
13 years 8 months ago
Fast query execution for retrieval models based on path-constrained random walks
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...
Ni Lao, William W. Cohen
STOC
1992
ACM
100views Algorithms» more  STOC 1992»
13 years 8 months ago
Biased Random Walks
How much can an imperfect source of randomness affect an algorithm? We examine several simple questions of this type concerning the long-term behavior of a random walk on a finite...
Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Nath...
ISTCS
1993
Springer
13 years 8 months ago
Random Walks on Colored Graphs
This thesis introduces a model of a random walk on a colored undirected graph. Such a graph has a single vertex set and   distinct sets of edges, each of which has a color. A par...
Anne Condon, Diane Hernek
RT
1998
Springer
13 years 8 months ago
Global Ray-Bundle Tracing with Hardware Acceleration
The paper presents a single-pass, view-dependent method to solve the general rendering equation, using a combined finite element and random walk approach. Applying finite element t...
László Szirmay-Kalos, Werner Purgath...