Sciweavers

6719 search results - page 425 / 1344
» A Generalization of Automatic Sequences
Sort
View
ISMB
1993
15 years 8 months ago
Representation for Discovery of Protein Motifs
There are several dimensions and levels of complexity in which information on protein motifs may be available. For example, onedimensional sequence motifs may be associated with s...
Darrell Conklin, Suzanne Fortier, Janice I. Glasgo...
ICASSP
2010
IEEE
15 years 7 months ago
Discriminative training methods for language models using conditional entropy criteria
This paper addresses the problem of discriminative training of language models that does not require any transcribed acoustic data. We propose to minimize the conditional entropy ...
Jui-Ting Huang, Xiao Li, Alex Acero
CORR
2010
Springer
135views Education» more  CORR 2010»
15 years 7 months ago
Constant-Weight Gray Codes for Local Rank Modulation
We consider the local rank-modulation scheme in which a sliding window going over a sequence of real-valued variables induces a sequence of permutations. The local rankmodulation, ...
Moshe Schwartz
CORR
2007
Springer
169views Education» more  CORR 2007»
15 years 6 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...
DM
2007
86views more  DM 2007»
15 years 6 months ago
Short cycle connectivity
Short cycle connectivity is a generalization of ordinary connectivity—two vertices have to be connected by a sequence of short cycles, in which two consecutive cycles have at le...
Vladimir Batagelj, Matjaz Zaversnik