Sciweavers

478 search results - page 58 / 96
» Local Search for Computing Normal Circumstances Models
Sort
View
EMMCVPR
2003
Springer
15 years 11 months ago
Asymptotic Characterization of Log-Likelihood Maximization Based Algorithms and Applications
The asymptotic distribution of estimates that are based on a sub-optimal search for the maximum of the log-likelihood function is considered. In particular, estimation schemes that...
Doron Blatt, Alfred O. Hero
ICPP
2008
IEEE
16 years 11 days ago
Scioto: A Framework for Global-View Task Parallelism
We introduce Scioto, Shared Collections of Task Objects, a lightweight framework for providing task management on distributed memory machines under one-sided and globalview parall...
James Dinan, Sriram Krishnamoorthy, D. Brian Larki...
ICCV
1999
IEEE
16 years 7 months ago
Dynamic Feature Ordering for Efficient Registration
Existing sequential feature-based registration algorithms involving search typically either select features randomly (eg. the RANSAC[8] approach) or assume a predefined, intuitive...
Tat-Jen Cham, James M. Rehg
SCALESPACE
2001
Springer
15 years 10 months ago
A Multi-scale Feature Likelihood Map for Direct Evaluation of Object Hypotheses
This paper develops and investigates a new approach for evaluating feature based object hypotheses in a direct way. The idea is to compute a feature likelihood map (FLM), which is ...
Ivan Laptev, Tony Lindeberg
EMMCVPR
2005
Springer
15 years 11 months ago
Learning Hierarchical Shape Models from Examples
Abstract. We present an algorithm for automatically constructing a decompositional shape model from examples. Unlike current approaches to structural model acquisition, in which on...
Alex Levinshtein, Cristian Sminchisescu, Sven J. D...