Sciweavers

1763 search results - page 162 / 353
» Dependent random choice
Sort
View
ADHOCNOW
2004
Springer
14 years 1 months ago
Analysis of the Information Propagation Time Among Mobile Hosts
Consider k particles, 1 red and k −1 white, chasing each other on the nodes of a graph G. If the red one catches one of the white, it “infects” it with its color. The newly ...
Tassos Dimitriou, Sotiris E. Nikoletseas, Paul G. ...
APPROX
2010
Springer
213views Algorithms» more  APPROX 2010»
13 years 9 months ago
Constructive Proofs of Concentration Bounds
We give a simple combinatorial proof of the Chernoff-Hoeffding concentration bound [Che52, Hoe63], which says that the sum of independent {0, 1}-valued random variables is highly ...
Russell Impagliazzo, Valentine Kabanets
CVPR
2008
IEEE
14 years 10 months ago
Who killed the directed model?
Prior distributions are useful for robust low-level vision, and undirected models (e.g. Markov Random Fields) have become a central tool for this purpose. Though sometimes these p...
Justin Domke, Alap Karapurkar, Yiannis Aloimonos
ECCV
2002
Springer
14 years 10 months ago
Finding the Largest Unambiguous Component of Stereo Matching
Abstract. Stereo matching is an ill-posed problem for at least two principal reasons: (1) because of the random nature of match similarity measure and (2) because of structural amb...
Radim Sára
ECCV
2002
Springer
14 years 9 months ago
Using Robust Estimation Algorithms for Tracking Explicit Curves
The context of this work is lateral vehicle control using a camera as a sensor. A natural tool for controlling a vehicle is recursive filtering. The well-known Kalman fil...
Jean-Philippe Tarel, Sio-Song Ieng, Pierre Charbon...