Sciweavers

4332 search results - page 178 / 867
» A Probabilistic Identification Result
Sort
View
ANLP
1997
137views more  ANLP 1997»
15 years 7 months ago
Probabilistic and Rule-Based Tagger of an Inflective Language- a Comparison
We present results of probabilistic tagging of Czech texts in order to show how these techniques work for one of the highly morphologically ambiguous inflective languages. After d...
Jan Hajic, Barbora Hladká
COCO
1998
Springer
109views Algorithms» more  COCO 1998»
15 years 10 months ago
Complexity Limitations on Quantum Computation
We use the powerful tools of counting complexity and generic oracles to help understand the limitations of the complexity of quantum computation. We show several results for the p...
Lance Fortnow, John D. Rogers
NIPS
2008
15 years 7 months ago
Improving on Expectation Propagation
A series of corrections is developed for the fixed points of Expectation Propagation (EP), which is one of the most popular methods for approximate probabilistic inference. These ...
Manfred Opper, Ulrich Paquet, Ole Winther
ACL
2000
15 years 7 months ago
Statistical Parsing with an Automatically-Extracted Tree Adjoining Grammar
We discuss the advantages of lexicalized tree-adjoining grammar as an alternative to lexicalized PCFG for statistical parsing, describingthe induction of a probabilistic LTAG mode...
David Chiang
CORR
2010
Springer
99views Education» more  CORR 2010»
15 years 6 months ago
Efficient Matrix Completion with Gaussian Models
A general framework based on Gaussian models and a MAPEM algorithm is introduced in this paper for solving matrix/table completion problems. The numerical experiments with the sta...
Flavien Léger, Guoshen Yu, Guillermo Sapiro