Sciweavers

2621 search results - page 14 / 525
» Generalized Algorithms for Constructing Statistical Language...
Sort
View
ICPR
2006
IEEE
14 years 9 months ago
A Ground Truth Correspondence Measure for Benchmarking
Automatic localisation of correspondences for the construction of Statistical Shape Models from examples has been the focus of intense research during the last decade. Several alg...
Anders Ericsson, Johan Karlsson
CORR
2008
Springer
107views Education» more  CORR 2008»
13 years 8 months ago
A Spectral Algorithm for Learning Hidden Markov Models
Hidden Markov Models (HMMs) are one of the most fundamental and widely used statistical tools for modeling discrete time series. In general, learning HMMs from data is computation...
Daniel Hsu, Sham M. Kakade, Tong Zhang
GFKL
2006
Springer
78views Data Mining» more  GFKL 2006»
14 years 12 days ago
Putting Successor Variety Stemming to Work
Stemming algorithms find canonical forms for inflected words, e. g. for declined nouns or conjugated verbs. Since such a unification of words with respect to gender, number, time, ...
Benno Stein, Martin Potthast
LREC
2010
152views Education» more  LREC 2010»
13 years 10 months ago
English-Spanish Large Statistical Dictionary of Inflectional Forms
The paper presents an approach for constructing a weighted bilingual dictionary of inflectional forms using as input data a traditional bilingual dictionary, and not parallel corp...
Grigori Sidorov, Alberto Barrón-Cedeñ...
JMIV
2007
143views more  JMIV 2007»
13 years 8 months ago
Measures for Benchmarking of Automatic Correspondence Algorithms
Automatic localisation of correspondences for the construction of Statistical Shape Models from examples has been the focus of intense research during the last decade. Several alg...
Anders Ericsson, Johan Karlsson