5138 search results - page 156 / 1028 » Randomized Algorithms for 3-SAT |
112
click to vote
TMC
2010
15 years 1 months ago
2010
—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...
ICPR
2008
IEEE
15 years 9 months ago
2008
IEEE
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...
128
click to vote
APPROX
2008
Springer
15 years 5 months ago
2008
Springer
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...
120
click to vote
ICML
2010
IEEE
15 years 4 months ago
2010
IEEE
We show that the mistake bound for predicting the nodes of an arbitrary weighted graph is characterized (up to logarithmic factors) by the cutsize of a random spanning tree of the...
122
click to vote
JDA
2008
15 years 3 months ago
2008
We show how to uniformly distribute data at random (not to be confounded with permutation routing) in two settings that are able to deal with massive data: coarse grained parallel...