2434 search results - page 66 / 487 » Algorithmic Randomness of Closed Sets |
112
click to vote
APPROX
2010
Springer
15 years 4 months ago
2010
Springer
: Let (C1, C1), (C2, C2), . . . , (Cm, Cm) be a sequence of ordered pairs of 2CNF clauses chosen uniformly at random (with repetition) from the set of all 4 n 2 clauses on n variab...
124
click to vote
SIAMDM
2002
15 years 3 months ago
2002
We present a new class of randomized approximation algorithms for unrelated parallel machine scheduling problems with the average weighted completion time objective. The key idea i...
183
Voted
TMC
2012
13 years 5 months ago
2012
—We develop a distributed throughput-optimal power allocation algorithm in wireless networks. The study of this problem has been limited due to the nonconvexity of the underlying...
159
Voted
DIALM
2008
ACM
15 years 5 months ago
2008
ACM
A random geometric graph G(n, r) is a graph resulting from placing n points uniformly at random on the unit area disk, and connecting two points iff their Euclidean distance is at ...
86
Voted
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...