Sciweavers

42230 search results - page 383 / 8446
» Algorithms and Complexity Results for
Sort
View
CORR
2006
Springer
102views Education» more  CORR 2006»
15 years 6 months ago
Approximate Linear Time ML Decoding on Tail-Biting Trellises in Two Rounds
A linear time approximate maximum likelihood decoding algorithm on tail-biting trellises is presented, that requires exactly two rounds on the trellis. This is an adaptation of an ...
K. Murali Krishnan, Priti Shankar
137
Voted
PRL
2000
58views more  PRL 2000»
15 years 6 months ago
Learning mixture models using a genetic version of the EM algorithm
The need to
Aleix M. Martínez, Jordi Vitrià
COCO
2006
Springer
97views Algorithms» more  COCO 2006»
15 years 10 months ago
Grid Graph Reachability Problems
We study the complexity of restricted versions of s-t-connectivity, which is the standard complete problem for NL. In particular, we focus on different classes of planar graphs, o...
Eric Allender, David A. Mix Barrington, Tanmoy Cha...
BMCBI
2005
108views more  BMCBI 2005»
15 years 6 months ago
A linear memory algorithm for Baum-Welch training
Background: Baum-Welch training is an expectation-maximisation algorithm for training the emission and transition probabilities of hidden Markov models in a fully automated way. I...
István Miklós, Irmtraud M. Meyer
WACV
2008
IEEE
16 years 1 months ago
Online/Realtime Structure and Motion for General Camera Models
This paper presents a novel algorithm for online structure and motion estimation. The algorithm works for general camera models and minimizes object space error, it does not rely ...
Gerald Schweighofer, Sinisa Segvic, Axel Pinz