Sciweavers

1731 search results - page 16 / 347
» Maximum likelihood analysis of algorithms and data structure...
Sort
View
33
Voted
CIVR
2006
Springer
219views Image Analysis» more  CIVR 2006»
13 years 11 months ago
Bayesian Learning of Hierarchical Multinomial Mixture Models of Concepts for Automatic Image Annotation
We propose a novel Bayesian learning framework of hierarchical mixture model by incorporating prior hierarchical knowledge into concept representations of multi-level concept struc...
Rui Shi, Tat-Seng Chua, Chin-Hui Lee, Sheng Gao
SAC
2011
ACM
13 years 2 months ago
A quasi-Newton acceleration for high-dimensional optimization algorithms
Abstract In many statistical problems, maximum likelihood estimation by an EM or MM algorithm suffers from excruciatingly slow convergence. This tendency limits the application of ...
Hua Zhou, David Alexander, Kenneth Lange
BMVC
2001
13 years 10 months ago
An EM-like Algorithm for Motion Segmentation via Eigendecomposition
This paper presents an iterative maximum likelihood framework for motion segmentation via the pairwise checking of pixel blocks. We commence from a characterisation of the motion ...
Antonio Robles-Kelly, Edwin R. Hancock
ICASSP
2008
IEEE
14 years 2 months ago
Bounds and algorithms for time delay estimation on parallel, flat fading channels
We study time delay estimation (TDE) on parallel channels with flat fading. Several models for the channel gains are considered, and for each case we present the the maximum like...
Richard J. Kozick, Brian M. Sadler
SODA
2010
ACM
205views Algorithms» more  SODA 2010»
14 years 5 months ago
Maximum Flows and Parametric Shortest Paths in Planar Graphs
We observe that the classical maximum flow problem in any directed planar graph G can be reformulated as a parametric shortest path problem in the oriented dual graph G . This ref...
Jeff Erickson