Sciweavers

1182 search results - page 179 / 237
» Iterative Methods in Combinatorial Optimization
Sort
View
ACCV
2010
Springer
14 years 7 months ago
MRF-Based Background Initialisation for Improved Foreground Detection in Cluttered Surveillance Videos
Abstract. Robust foreground object segmentation via background modelling is a difficult problem in cluttered environments, where obtaining a clear view of the background to model i...
Vikas Reddy, Conrad Sanderson, Andres Sanin, Brian...
CG
2011
Springer
14 years 3 months ago
A projected back-tracking line-search for constrained interactive inverse kinematics
Inverse kinematics is the problem of manipulating the pose of an articulated figure in order to achieve a desired goal disregarding inertia and forces. One can approach the probl...
Morten Engell-Nørregård, Kenny Erlebe...
BMCBI
2005
100views more  BMCBI 2005»
14 years 11 months ago
Scoredist: A simple and robust protein sequence distance estimator
Background: Distance-based methods are popular for reconstructing evolutionary trees thanks to their speed and generality. A number of methods exist for estimating distances from ...
Erik L. L. Sonnhammer, Volker Hollich
STOC
2009
ACM
159views Algorithms» more  STOC 2009»
16 years 14 days ago
Message passing algorithms and improved LP decoding
Linear programming decoding for low-density parity check codes (and related domains such as compressed sensing) has received increased attention over recent years because of its p...
Sanjeev Arora, Constantinos Daskalakis, David Steu...
APPROX
2010
Springer
213views Algorithms» more  APPROX 2010»
15 years 1 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