7796 search results - page 284 / 1560 » On Generalized Schur Numbers |
167
click to vote
KDD
2009
ACM
16 years 7 months ago
2009
ACM
We present an algorithm, called the offset tree, for learning in situations where a loss associated with different decisions is not known, but was randomly probed. The algorithm i...
182
click to vote
RECOMB
2002
Springer
16 years 7 months ago
2002
Springer
We introduce the notion of a multiprofile and use it for finding subtle motifs in DNA sequences. Multiprofiles generalize the notion of a profile and allow one to detect subtle co...
183
click to vote
DCC
2006
IEEE
16 years 6 months ago
2006
IEEE
We continue the study of the linear complexity of binary sequences, independently introduced by Sidel'nikov and Lempel, Cohn, and Eastman. These investigations were originated...
157
click to vote
SDM
2009
SIAM
16 years 4 months ago
2009
SIAM
We introduce the problem of grammar mining, where patterns are context-free grammars, as a generalization of a large number of common pattern mining tasks, such as tree, sequence ...
157
click to vote
ALT
2008
Springer
16 years 3 months ago
2008
Springer
Abstract. We consider an upper confidence bound algorithm for Markov decision processes (MDPs) with deterministic transitions. For this algorithm we derive upper bounds on the onl...