Sciweavers

516 search results - page 58 / 104
» Sets of k-Independent Strings
Sort
View
CJ
1999
95views more  CJ 1999»
13 years 8 months ago
Two Kinds of Probabilistic Induction
Problems in probabilistic induction are of two general kinds. In the first, we have a linearly ordered sequence of symbols that must be extrapolated. In the second we want to extr...
Ray J. Solomonoff
CSL
1999
Springer
13 years 8 months ago
A hidden Markov-model-based trainable speech synthesizer
This paper presents a new approach to speech synthesis in which a set of cross-word decision-tree state-clustered context-dependent hidden Markov models are used to define a set o...
R. E. Donovan, Philip C. Woodland
SPIRE
2010
Springer
13 years 7 months ago
Text Comparison Using Soft Cardinality
Abstract. The classical set theory provides a method for comparing objects using cardinality and intersection, in combination with well-known resemblance coefficients such as Dice,...
Sergio Jimenez, Fabio Gonzalez, Alexander F. Gelbu...
CORR
2011
Springer
155views Education» more  CORR 2011»
13 years 3 months ago
On the Zero-Error Capacity Threshold for Deletion Channels
—We consider the zero-error capacity of deletion channels. Specifically, we consider the setting where we choose a codebook C consisting of strings of n bits, and our model of t...
Ian A. Kash, Michael Mitzenmacher, Justin Thaler, ...
TCBB
2011
13 years 3 months ago
Visual Exploration across Biomedical Databases
Abstract—Though biomedical research often draws on knowledge from a wide variety of fields, few visualization methods for biomedical data incorporate meaningful cross-database e...
Michael D. Lieberman, Sima Taheri, Huimin Guo, Fat...