16430 search results - page 934 / 3286 » On Computable Tree Functions |
185
click to vote
BIRD
2008
Springer
15 years 9 months ago
2008
Springer
We study the problem of structured motif search in DNA sequences. This is a fundamental task in bioinformatics which contributes to better understanding of genome characteristics a...
188
click to vote
AAAI
2010
15 years 9 months ago
2010
This paper introduces a principled approach for the design of a scalable general reinforcement learning agent. This approach is based on a direct approximation of AIXI, a Bayesian...
199
click to vote
AAAI
2004
15 years 9 months ago
2004
Temperature Discovery Search (TDS) is a new minimaxbased game tree search method designed to compute or approximate the temperature of a combinatorial game. TDS is based on the co...
198
click to vote
DATESO
2004
15 years 9 months ago
2004
Large sparse matrices play important role in many modern information retrieval methods. These methods, such as clustering, latent semantic indexing, performs huge number of computa...
211
click to vote
APPINF
2003
15 years 9 months ago
2003
Discovering association rules by identifying relationships among sets of items in a transaction database is an important problem in Data Mining. Finding frequent itemsets is compu...