Sciweavers

886 search results - page 98 / 178
» On the Autoreducibility of Random Sequences
Sort
View
ISLPED
1997
ACM
130views Hardware» more  ISLPED 1997»
13 years 11 months ago
K2: an estimator for peak sustainable power of VLSI circuits
New measures of peak power in the context of sequential circuits are proposed. This paper presents an automatic procedure to obtain very good lower bounds on these measures as wel...
Michael S. Hsiao, Elizabeth M. Rudnick, Janak H. P...
CORR
2007
Springer
169views Education» more  CORR 2007»
13 years 7 months ago
Algorithmic 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 d...
Alexey V. Chernov, Marcus Hutter, Jürgen Schm...
CORR
2004
Springer
115views Education» more  CORR 2004»
13 years 7 months ago
Bounds on the decoding complexity of punctured codes on graphs
We present two sequences of ensembles of non-systematic irregular repeat-accumulate codes which asymptotically (as their block length tends to infinity) achieve capacity on the bi...
Henry D. Pfister, Igal Sason, Rüdiger L. Urba...
IJDAR
2010
110views more  IJDAR 2010»
13 years 6 months ago
Locating and parsing bibliographic references in HTML medical articles
The set of references that typically appear toward the end of journal articles is sometimes, though not always, a field in bibliographic (citation) databases. But even if referenc...
Jie Zou, Daniel X. Le, George R. Thoma
BMCBI
2011
13 years 2 months ago
Analysis on the reconstruction accuracy of the Fitch method for inferring ancestral states
Background: As one of the most widely used parsimony methods for ancestral reconstruction, the Fitch method minimizes the total number of hypothetical substitutions along all bran...
Jialiang Yang, Jun Li, Liuhuan Dong, Stefan Gr&uum...