Sciweavers

180 search results - page 3 / 36
» Universal Sequencing on a Single Machine
Sort
View
ALT
2005
Springer
15 years 7 months ago
Monotone Conditional Complexity Bounds on Future Prediction Errors
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 ...
Alexey V. Chernov, Marcus Hutter
INFORMATICALT
2006
117views more  INFORMATICALT 2006»
14 years 10 months ago
Job Sequencing with Exponential Functions of Processing Times
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...
Adam Janiak, Mikhail Y. Kovalyov
RECOMB
2007
Springer
15 years 10 months ago
Design of Compact, Universal DNA Microarrays for Protein Binding Microarray Experiments
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...
Anthony A. Philippakis, Aaron M. Qureshi, Michael ...
MST
2002
97views more  MST 2002»
14 years 9 months ago
Programmed Mutagenesis Is Universal
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...
Julia Khodor, David K. Gifford
90
Voted
COLT
2010
Springer
14 years 8 months ago
Following the Flattened Leader
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...
Wojciech Kotlowski, Peter Grünwald, Steven de...