Sciweavers

115 search results - page 18 / 23
» Model Selection Through Sparse Maximum Likelihood Estimation
Sort
View
CLEF
2009
Springer
13 years 8 months ago
Unsupervised Word Decomposition with the Promodes Algorithm
We present Promodes, an algorithm for unsupervised word decomposition, which is based on a probabilistic generative model. The model considers segment boundaries as hidden variable...
Sebastian Spiegler, Bruno Golénia, Peter A....
CSDA
2006
98views more  CSDA 2006»
13 years 7 months ago
GS-distributions: A new family of distributions for continuous unimodal variables
The choice of the best-suited statistical distribution for modeling data is not a trivial issue. Unless a sound theoretical background exists for selecting a particular distributi...
J. M. Muiño, Eberhard O. Voit, Albert Sorri...
TCOM
2008
108views more  TCOM 2008»
13 years 7 months ago
Performance analysis on an MAP fine timing algorithm in UWB multiband OFDM
In this paper we develop a fine synchronization algorithm for multiband OFDM transmission in the presence of frequency selective channels. This algorithm is based on maximum a post...
Christian R. Berger, Shengli Zhou, Zhi Tian, Peter...
PAMI
2011
13 years 2 months ago
Rigid and Articulated Point Registration with Expectation Conditional Maximization
—This paper addresses the issue of matching rigid and articulated shapes through probabilistic point registration. The problem is recast into a missing data framework where unkno...
Radu Horaud, Florence Forbes, Manuel Yguel, Guilla...
BMCBI
2008
130views more  BMCBI 2008»
13 years 7 months ago
IDEA: Interactive Display for Evolutionary Analyses
Background: The availability of complete genomic sequences for hundreds of organisms promises to make obtaining genome-wide estimates of substitution rates, selective constraints ...
Amy Egan, Anup Mahurkar, Jonathan Crabtree, Jonath...