Sciweavers

8695 search results - page 1361 / 1739
» Making the Complex Simple
Sort
View
179
Voted
INTERSPEECH
2010
15 years 2 months ago
Modeling liaison in French by using decision trees
French is known to be a language with major pronunciation irregularities at word endings with consonants. Particularly, the well-known phonetic phenomenon called Liaison is one of...
Josafá de Jesus Aguiar Pontes, Sadaoki Furu...
JMLR
2010
143views more  JMLR 2010»
15 years 2 months ago
Incremental Sigmoid Belief Networks for Grammar Learning
We propose a class of Bayesian networks appropriate for structured prediction problems where the Bayesian network's model structure is a function of the predicted output stru...
James Henderson, Ivan Titov
243
Voted
PAMI
2010
162views more  PAMI 2010»
15 years 2 months ago
Differential Earth Mover's Distance with Its Applications to Visual Tracking
The Earth Mover's Distance (EMD) is a similarity measure that captures perceptual difference between two distributions. Its computational complexity, however, prevents a direc...
Qi Zhao, Zhi Yang, Hai Tao
237
Voted
PAMI
2010
241views more  PAMI 2010»
15 years 2 months ago
Point Set Registration: Coherent Point Drift
We introduce Coherent Point Drift (CPD), a novel probabilistic method for nonrigid registration of point sets. The registration is treated as a Maximum Likelihood (ML) estimation ...
Andriy Myronenko, Xubo B. Song
SIAMCOMP
2010
88views more  SIAMCOMP 2010»
15 years 2 months ago
Hardness Amplification Proofs Require Majority
Hardness amplification is the fundamental task of converting a -hard function f : {0, 1}n {0, 1} into a (1/2 - )-hard function Amp(f), where f is -hard if small circuits fail to c...
Ronen Shaltiel, Emanuele Viola
« Prev « First page 1361 / 1739 Last » Next »