7773 search results - page 188 / 1555 » On generalized Frame-Stewart numbers |
152
click to vote
DCC
2006
IEEE
16 years 5 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...
146
click to vote
SDM
2009
SIAM
16 years 3 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 ...
148
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...
167
click to vote
ICASSP
2009
IEEE
16 years 28 days ago
2009
IEEE
We consider the estimation of the locations of multiple transmitters based on received signal strength measurements at a network of randomly-placed receivers. We generalize the ex...
172
click to vote
LICS
2009
IEEE
16 years 25 days ago
2009
IEEE
—We use the recently developed theory of forest algebras to find algebraic characterizations of the languages of unranked trees and forests definable in various logics. These i...