180 search results - page 3 / 36 » Universal Sequencing on a Single Machine |
116
click to vote
ALT
2005
Springer
16 years 3 days ago
2005
Springer
We bound the future loss when predicting any (computably) stochastic sequence online. Solomonoff finitely bounded the total deviation of his universal predictor M from the true ...
125
click to vote
INFORMATICALT
2006
15 years 3 months ago
2006
We study single machine scheduling problems, where processing times of the jobs are exponential functions of their start times. For increasing functions, we prove strong NP-hardnes...
124
click to vote
RECOMB
2007
Springer
16 years 3 months ago
2007
Springer
Our group has recently developed a compact, universal protein binding microarray (PBM) that can be used to determine the binding preferences of transcription factors (TFs) [1]. Thi...
103
click to vote
MST
2002
15 years 2 months ago
2002
Programmed mutagenesis is a DNA computing system that uses cycles of DNA annealing, ligation, and polymerization to implement programatic rewriting of DNA sequences. We report that...
133
click to vote
COLT
2010
Springer
15 years 1 months ago
2010
Springer
We analyze the regret, measured in terms of log loss, of the maximum likelihood (ML) sequential prediction strategy. This "follow the leader" strategy also defines one o...