101 search results - page 5 / 21 » Using Parsimony to Guide Maximum Likelihood Searches |
113
click to vote
TIT
2008
15 years 3 months ago
2008
Abstract--This letter considers the average complexity of maximum-likelihood (ML) decoding of convolutional codes. ML decoding can be modeled as finding the most probable path take...
127
click to vote
WSC
2004
15 years 4 months ago
2004
Global likelihood maximization is an important aspect of many statistical analyses. Often the likelihood function is highly multi-extremal. This presents a significant challenge t...
133
Voted
NIPS
1996
15 years 4 months ago
1996
In the square linear blind source separation problem, one must nd a linear unmixing operator which can detangle the result xi(t) of mixing n unknown independent sources si(t) thro...
161
Voted
EMMCVPR
2003
Springer
15 years 8 months ago
2003
Springer
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...
129
Voted
ICRA
2010
IEEE
15 years 2 months ago
2010
IEEE
— In this paper, we consider the problem of how background knowledge about usual object arrangements can be utilized by a mobile robot to more efficiently find an object in an ...