Sciweavers

387 search results - page 7 / 78
» Many Random Walks Are Faster Than One
Sort
View
SDM
2012
SIAM
278views Data Mining» more  SDM 2012»
13 years 8 months ago
Legislative Prediction via Random Walks over a Heterogeneous Graph
In this article, we propose a random walk-based model to predict legislators’ votes on a set of bills. In particular, we first convert roll call data, i.e. the recorded votes a...
Jun Wang, Kush R. Varshney, Aleksandra Mojsilovic
147
Voted
FOCI
2007
IEEE
15 years 12 months ago
Faster Evolutionary Algorithms by Superior Graph Representation
— We present a new representation for individuals in problems that have cyclic permutations as solutions. To demonstrate its usefulness, we analyze a simple randomized local sear...
Benjamin Doerr, Christian Klein, Tobias Storch
INFOCOM
2011
IEEE
14 years 9 months ago
Smart sleep: Sleep more to reduce delay in duty-cycled wireless sensor networks
A simple random walk (SRW) has been considered as an effective forwarding method for many applications in wireless sensor networks (WSNs) due to its desirable properties. However...
Chul-Ho Lee, Do Young Eun
175
Voted
IPL
2000
115views more  IPL 2000»
15 years 5 months ago
Randomized uniform self-stabilizing mutual exclusion
Abstract. The mutual exclusion protocol presented ensures that whatever perturbation the network undergo, it regains consistency in nite time: one and only one privilege token is p...
Jérôme Olivier Durand-Lose
NIPS
2008
15 years 7 months ago
One sketch for all: Theory and Application of Conditional Random Sampling
Conditional Random Sampling (CRS) was originally proposed for efficiently computing pairwise (l2, l1) distances, in static, large-scale, and sparse data. This study modifies the o...
Ping Li, Kenneth Ward Church, Trevor Hastie