Sciweavers

5580 search results - page 183 / 1116
» Randomized priority algorithms
Sort
View
CORR
2008
Springer
102views Education» more  CORR 2008»
14 years 10 months ago
Finding cores of random 2-SAT formulae via Poisson cloning
For the random 2-SAT formula F(n, p), let FC(n, p) be the formula left after the pure literal algorithm applied to F(n, p) stops. Using the recently developed Poisson cloning model...
Jeong Han Kim
CORR
2006
Springer
123views Education» more  CORR 2006»
14 years 10 months ago
Counting good truth assignments of random k-SAT formulae
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...
Andrea Montanari, Devavrat Shah
73
Voted
TMC
2010
138views more  TMC 2010»
14 years 8 months ago
Secure Data Collection in Wireless Sensor Networks Using Randomized Dispersive Routes
—Compromised-node and denial-of-service are two key attacks in wireless sensor networks (WSNs). In this paper, we study routing mechanisms that circumvent (bypass) black holes fo...
Tao Shu, Marwan Krunz, Sisi Liu
53
Voted
ICPR
2008
IEEE
15 years 4 months ago
Stereo matching using random walks
This paper presents a novel two-phase stereo matching algorithm using the random walks framework. At first, a set of reliable matching pixels is extracted with prior matrices de...
Rui Shen, Irene Cheng, Xiaobo Li, Anup Basu
APPROX
2008
Springer
119views Algorithms» more  APPROX 2008»
15 years 5 days ago
The Complexity of Distinguishing Markov Random Fields
Abstract. Markov random fields are often used to model high dimensional distributions in a number of applied areas. A number of recent papers have studied the problem of reconstruc...
Andrej Bogdanov, Elchanan Mossel, Salil P. Vadhan