Sciweavers

4698 search results - page 926 / 940
» Making Functionality More General
Sort
View
CONSTRAINTS
2010
126views more  CONSTRAINTS 2010»
15 years 2 months ago
Lexicographically-ordered constraint satisfaction problems
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...
Eugene C. Freuder, Robert Heffernan, Richard J. Wa...
CSL
2010
Springer
15 years 2 months ago
Discriminative training of HMMs for automatic speech recognition: A survey
Recently, discriminative training (DT) methods have achieved tremendous progress in automatic speech recognition (ASR). In this survey article, all mainstream DT methods in speech...
Hui Jiang
CORR
2008
Springer
128views Education» more  CORR 2008»
15 years 2 months ago
A Fast Generic Sequence Matching Algorithm
A string matching--and more generally, sequence matching--algorithm is presented that has a linear worst-case computing time bound, a low worst-case bound on the number of compari...
David R. Musser, Gor V. Nishanov
CORR
2008
Springer
114views Education» more  CORR 2008»
15 years 2 months ago
Temporal Support of Regular Expressions in Sequential Pattern Mining
Classic algorithms for sequential pattern discovery, return all frequent sequences present in a database. Since, in general, only a few ones are interesting from a user's poin...
Leticia I. Gómez, Bart Kuijpers, Alejandro ...
BMCBI
2006
123views more  BMCBI 2006»
15 years 2 months ago
Characterizing disease states from topological properties of transcriptional regulatory networks
Background: High throughput gene expression experiments yield large amounts of data that can augment our understanding of disease processes, in addition to classifying samples. He...
David Tuck, Harriet Kluger, Yuval Kluger