Sciweavers

860 search results - page 7 / 172
» Biased Random Walks
Sort
View
STOC
2004
ACM
89views Algorithms» more  STOC 2004»
14 years 10 months ago
Hit-and-run from a corner
We show that the hit-and-run random walk mixes rapidly starting from any interior point of a convex body. This is the first random walk known to have this property. In contrast, t...
László Lovász, Santosh Vempal...
JSS
2010
198views more  JSS 2010»
13 years 4 months ago
Accelerated collection of sensor data by mobility-enabled topology ranks
We study the problem of fast and energy-efficient data collection of sensory data using a mobile sink, in wireless sensor networks in which both the sensors and the sink move. Mot...
Constantinos Marios Angelopoulos, Sotiris E. Nikol...
AAAI
1994
13 years 11 months ago
Noise Strategies for Improving Local Search
It has recently been shown that local search is surprisingly good at nding satisfying assignments for certain computationally hard classes of CNF formulas. The performance of basi...
Bart Selman, Henry A. Kautz, Bram Cohen
ACL
2006
13 years 11 months ago
LexNet: A Graphical Environment for Graph-Based NLP
This interactive presentation describes LexNet, a graphical environment for graph-based NLP developed at the University of Michigan. LexNet includes LexRank (for text summarizatio...
Dragomir R. Radev, Günes Erkan, Anthony Fader...
APPROX
2007
Springer
88views Algorithms» more  APPROX 2007»
14 years 4 months ago
Derandomization of Euclidean Random Walks
We consider the problem of derandomizing random walks in the Euclidean space Rk . We show that for k = 2, and in some cases in higher dimensions, such walks can be simulated in Lo...
Ilia Binder, Mark Braverman