Sciweavers

1206 search results - page 151 / 242
» Convergence analysis of online algorithms
Sort
View
STACS
2005
Springer
15 years 3 months ago
Worst-Case and Average-Case Approximations by Simple Randomized Search Heuristics
Abstract. In recent years, probabilistic analyses of algorithms have received increasing attention. Despite results on the average-case complexity and smoothed complexity of exact ...
Carsten Witt
CORR
2010
Springer
90views Education» more  CORR 2010»
14 years 10 months ago
New Criteria for Iterative Decoding
Iterative decoding was not originally introduced as the solution to an optimization problem rendering the analysis of its convergence very difficult. In this paper, we investigate...
Florence Alberge, Ziad Naja, Pierre Duhamel
ICIP
2010
IEEE
14 years 7 months ago
Snakules: Snakes that seek spicules on mammography
We present a new method called "snakules" for the annotation of spicules on mammography. Snakules employs parametric open-ended snakes that are deployed in a region arou...
Gautam S. Muralidhar, Alan C. Bovik, Mia K. Markey
BMCBI
2010
123views more  BMCBI 2010»
14 years 10 months ago
Decoding HMMs using the k best paths: algorithms and applications
Background: Traditional algorithms for hidden Markov model decoding seek to maximize either the probability of a state path or the number of positions of a sequence assigned to th...
Daniel G. Brown 0001, Daniil Golod
ICCV
2005
IEEE
15 years 12 months ago
Passive Photometric Stereo from Motion
We introduce an iterative algorithm for shape reconstruction from multiple images of a moving (Lambertian) object illuminated by distant (and possibly time varying) lighting. Star...
Jongwoo Lim, Jeffrey Ho, Ming-Hsuan Yang, David J....