108 search results - page 8 / 22 » Exact Exploration and Hanging Algorithms |
ICML
2006
IEEE
14 years 8 months ago
2006
IEEE
When the transition probabilities and rewards of a Markov Decision Process are specified exactly, the problem can be solved without any interaction with the environment. When no s...
SIGIR
2009
ACM
14 years 2 months ago
2009
ACM
This paper explores the problem of computing pairwise similarity on document collections, focusing on the application of “more like this” queries in the life sciences domain. ...
VLDB
2004
ACM
14 years 1 months ago
2004
ACM
Query processing in database systems has developed beyond mere exact matching of attribute values. Scoring database objects and retrieving only the top k matches or Pareto-optimal...
ICASSP
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract –In this paper, a variational message passing framework is proposed for Markov random fields, which is computationally more efficient and admits wider applicability comp...
LATA
2010
Springer
14 years 2 months ago
2010
Springer
The smallest grammar problem - namely, finding a smallest context-free grammar that generates exactly one sequence - is of practical and theoretical importance in fields such as ...