Sciweavers

2517 search results - page 177 / 504
» Specifying Weak Sets
Sort
View
CSL
1999
Springer
15 years 6 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
IANDC
2010
105views more  IANDC 2010»
15 years 5 months ago
Symmetries, local names and dynamic (de)-allocation of names
The semantics of name-passing calculi is often defined employing coalgebraic models over presheaf categories. This elegant theory lacks finiteness properties, hence it is not ap...
Vincenzo Ciancia, Ugo Montanari
RECOMB
2010
Springer
15 years 5 months ago
Consistency of Sequence-Based Gene Clusters
In comparative genomics, various combinatorial models can be used to specify gene clusters — groups of genes that are co-located in a set of genomes. Several approaches have been...
Roland Wittler, Jens Stoye
INFORMATICALT
2010
102views more  INFORMATICALT 2010»
15 years 3 months ago
An Computation-Efficient Generalized Group-Oriented Cryptosystem
A Group-Oriented Cryptosystem (GOC) allows a sender to encrypt a message sent to a group of users so only the specified sets of users in that group can cooperatively decrypt the me...
Ting-Yi Chang
AI
2011
Springer
15 years 1 months ago
Relational preference rules for control
Much like relational probabilistic models, the need for relational preference models arises naturally in real-world applications where the set of object classes is fixed, but obj...
Ronen I. Brafman