Sciweavers

14161 search results - page 139 / 2833
» On generalized middle-level problem
Sort
View
CDC
2010
IEEE
14 years 7 months ago
Stochastic approximation for consensus with general time-varying weight matrices
This paper considers consensus problems with delayed noisy measurements, and stochastic approximation is used to achieve mean square consensus. For stochastic approximation based c...
Minyi Huang
134
Voted
CVPR
2012
IEEE
13 years 3 months ago
General trajectory prior for Non-Rigid reconstruction
Trajectory basis Non-Rigid Structure From Motion (NRSFM) currently faces two problems: the limit of reconstructability and the need to tune the basis size for different sequences....
Jack Valmadre, Simon Lucey
89
Voted
PAMI
2008
134views more  PAMI 2008»
15 years 18 days ago
Bittracker - A Bitmap Tracker for Visual Tracking under Very General Conditions
This paper addresses the problem of visual tracking under very general conditions: a possibly nonrigid target whose appearance may drastically change over time, general camera moti...
Ido Leichter, Michael Lindenbaum, Ehud Rivlin
107
Voted
ICDCN
2010
Springer
15 years 7 months ago
Authenticated Byzantine Generals in Dual Failure Model
Pease et al. introduced the problem of Byzantine Generals (BGP) to study the effects of Byzantine faults in distributed protocols for reliable broadcast. It is well known that BG...
Anuj Gupta, Prasant Gopal, Piyush Bansal, Kannan S...
GECCO
2010
Springer
207views Optimization» more  GECCO 2010»
15 years 5 months ago
Generalized crowding for genetic algorithms
Crowding is a technique used in genetic algorithms to preserve diversity in the population and to prevent premature convergence to local optima. It consists of pairing each offsp...
Severino F. Galán, Ole J. Mengshoel