886 search results - page 34 / 178 » On the Autoreducibility of Random Sequences |
119
click to vote
SIGECOM
2009
ACM
16 years 1 days ago
2009
ACM
We consider the problem of a search engine trying to assign a sequence of search keywords to a set of competing bidders, each with a daily spending limit. The goal is to maximize ...
161
click to vote
DCC
2010
IEEE
16 years 12 days ago
2010
IEEE
We introduce an alternative Lempel-Ziv text parsing, LZ-End, that converges to the entropy and in practice gets very close to LZ77. LZ-End forces sources to finish at the end of ...
199
click to vote
ALGORITHMICA
1998
15 years 5 months ago
1998
We examine a general Bayesian framework for constructing on-line prediction algorithms in the experts setting. These algorithms predict the bits of an unknown Boolean sequence usin...
132
click to vote
CCA
2009
Springer
16 years 3 days ago
2009
Springer
Abstract. A random iteration algorithm for graph-directed sets is defined and discussed. Similarly to the Barnsley-Elton’s theorem, it is shown that almost all sequences obtaine...
219
click to vote
RECOMB
2001
Springer
16 years 5 months ago
2001
Springer
motif discovery problem abstracts the task of discovering short, conserved sites in genomic DNA. Pevzner and Sze recently described a precise combinatorial formulation of motif di...