Sciweavers

495 search results - page 56 / 99
» Probability Trees
Sort
View
ACL
2006
13 years 10 months ago
Trace Prediction and Recovery with Unlexicalized PCFGs and Slash Features
This paper describes a parser which generates parse trees with empty elements in which traces and fillers are co-indexed. The parser is an unlexicalized PCFG parser which is guara...
Helmut Schmid
MIR
2010
ACM
179views Multimedia» more  MIR 2010»
13 years 7 months ago
Speculation on the generality of the backward stepwise view of PCA
A novel backwards viewpoint of Principal Component Analysis is proposed. In a wide variety of cases, that fall into the area of Object Oriented Data Analysis, this viewpoint is se...
J. S. Marron, Sungkyu Jung, Ian L. Dryden
RANLP
2003
13 years 10 months ago
Structured parameter estimation for LFG-DOP
Despite its state-of-the-art performance, the Data Oriented Parsing (DOP) model has been shown to suffer from biased parameter estimation, and the good performance seems more the ...
Mary Hearne, Khalil Sima'an
ECAI
2004
Springer
14 years 2 months ago
On-Line Search for Solving Markov Decision Processes via Heuristic Sampling
In the past, Markov Decision Processes (MDPs) have become a standard for solving problems of sequential decision under uncertainty. The usual request in this framework is the compu...
Laurent Péret, Frédérick Garc...
LOGCOM
2007
89views more  LOGCOM 2007»
13 years 8 months ago
Algorithmic Randomness of Closed Sets
We investigate notions of randomness in the space C[2N ] of nonempty closed subsets of {0, 1}N . A probability measure is given and a version of the Martin-L¨of test for randomne...
George Barmpalias, Paul Brodhead, Douglas Cenzer, ...