220 search results - page 33 / 44 » Expected Sequence Similarity Maximization |
KR
1992
Springer
15 years 1 months ago
1992
Springer
While the task of answering queries from an arbitrary propositional theory is intractable in general, it can typicallybe performed e ciently if the theory is Horn. This suggests t...
ECML
2006
Springer
15 years 1 months ago
2006
Springer
Trees provide a suited structural representation to deal with complex tasks such as web information extraction, RNA secondary structure prediction, or conversion of tree structured...
AAAI
2010
14 years 11 months ago
2010
Gaussian Mixture Model (GMM) is one of the most popular data clustering methods which can be viewed as a linear combination of different Gaussian components. In GMM, each cluster ...
116
click to vote
EMNLP
2008
14 years 11 months ago
2008
Complex questions that require inferencing and synthesizing information from multiple documents can be seen as a kind of topicoriented, informative multi-document summarization. I...
NIPS
2007
14 years 11 months ago
2007
We present an algorithm called Optimistic Linear Programming (OLP) for learning to optimize average reward in an irreducible but otherwise unknown Markov decision process (MDP). O...