1647 search results - page 162 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
138
click to vote
JCT
2007
15 years 5 months ago
2007
Let G be a d-regular graph with girth g, and let α be the independence number of G. We show that α(G) ≥ 1 2 1 − (d − 1)−2/(d−2) − (g) n where (g) → 0 as g → ∞,...
132
click to vote
PODC
2006
ACM
15 years 11 months ago
2006
ACM
This paper presents a distributed algorithm for wireless adhoc networks that runs in polylogarithmic number of rounds in the size of the network and constructs a lightweight, line...
150
click to vote
JMLR
2010
14 years 12 months ago
2010
Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...
122
click to vote
APPROX
2007
Springer
15 years 11 months ago
2007
Springer
We study the two party problem of randomly selecting a string among all the strings of length n. We want the protocol to have the property that the output distribution has high en...
165
click to vote
CVPR
2005
IEEE
16 years 7 months ago
2005
IEEE
We propose an algorithm for estimating disparity and occlusion in stereo video sequences. The algorithm defines a prior on sequences of disparity maps using a 3D Markov random fie...