Sciweavers

569 search results - page 103 / 114
» An Efficient Algorithm for Solving Dynamic Complex DCOP Prob...
Sort
View
ECCV
2004
Springer
14 years 9 months ago
Interactive Image Segmentation Using an Adaptive GMMRF Model
The problem of interactive foreground/background segmentation in still images is of great practical importance in image editing. The state of the art in interactive segmentation is...
Andrew Blake, Carsten Rother, M. Brown, Patrick P&...
CVPR
2009
IEEE
1372views Computer Vision» more  CVPR 2009»
15 years 2 months ago
Blind motion deblurring from a single image using sparse approximation
Restoring a clear image from a single motion-blurred image due to camera shake has long been a challenging problem in digital imaging. Existing blind deblurring techniques eithe...
Jian-Feng Cai (National University of Singapore), ...
BMCBI
2005
158views more  BMCBI 2005»
13 years 7 months ago
Automated generation of heuristics for biological sequence comparison
Background: Exhaustive methods of sequence alignment are accurate but slow, whereas heuristic approaches run quickly, but their complexity makes them more difficult to implement. ...
Guy St. C. Slater, Ewan Birney
AROBOTS
2002
115views more  AROBOTS 2002»
13 years 7 months ago
Statistical Learning for Humanoid Robots
The complexity of the kinematic and dynamic structure of humanoid robots make conventional analytical approaches to control increasingly unsuitable for such systems. Learning techn...
Sethu Vijayakumar, Aaron D'Souza, Tomohiro Shibata...
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