Sciweavers

89 search results - page 18 / 18
» CP Models for Maximum Common Subgraph Problems
Sort
View
BMCBI
2007
158views more  BMCBI 2007»
13 years 5 months ago
Penalized likelihood for sparse contingency tables with an application to full-length cDNA libraries
Background: The joint analysis of several categorical variables is a common task in many areas of biology, and is becoming central to systems biology investigations whose goal is ...
Corinne Dahinden, Giovanni Parmigiani, Mark C. Eme...

Publication
253views
13 years 3 months ago
Multisensory Oddity Detection as Bayesian Inference
A key goal for the perceptual system is to optimally combine information from all the senses that may be available in order to develop the most accurate and unified picture possi...
Timothy Hospedales and Sethu Vijayakumar
ECML
2001
Springer
13 years 10 months ago
Learning of Variability for Invariant Statistical Pattern Recognition
In many applications, modelling techniques are necessary which take into account the inherent variability of given data. In this paper, we present an approach to model class speciï...
Daniel Keysers, Wolfgang Macherey, Jörg Dahme...
ICML
2008
IEEE
14 years 6 months ago
Modified MMI/MPE: a direct evaluation of the margin in speech recognition
In this paper we show how common speech recognition training criteria such as the Minimum Phone Error criterion or the Maximum Mutual Information criterion can be extended to inco...
Georg Heigold, Hermann Ney, Ralf Schlüter, Th...