Sciweavers

1055 search results - page 172 / 211
» Enumerations in computable structure theory
Sort
View
82
Voted
CLEF
2009
Springer
14 years 7 months ago
Unsupervised Morphological Analysis by Formal Analogy
Abstract. While classical approaches to unsupervised morphology acquisition often rely on metrics based on information theory for identifying morphemes, we describe a novel approac...
Jean-François Lavallée, Philippe Lan...
TASLP
2011
14 years 4 months ago
Advances in Missing Feature Techniques for Robust Large-Vocabulary Continuous Speech Recognition
— Missing feature theory (MFT) has demonstrated great potential for improving the noise robustness in speech recognition. MFT was mostly applied in the log-spectral domain since ...
Maarten Van Segbroeck, Hugo Van Hamme
SIAMADS
2010
97views more  SIAMADS 2010»
14 years 4 months ago
Localized Instability and Attraction along Invariant Manifolds
Abstract. We derive a simple criterion for transverse instabilities along a general invariant manifold of a multidimensional dynamical system. The criterion requires an appropriate...
George Haller, Themistoklis Sapsis
CORR
2011
Springer
143views Education» more  CORR 2011»
14 years 1 months ago
Probabilistic Logic: Many-valuedness and Intensionality
The probability theory is a well-studied branch of mathematics, in order to carry out formal reasoning about probability. Thus, it is important to have a logic, both for computati...
Zoran Majkic
DAC
2007
ACM
15 years 10 months ago
On Resolution Proofs for Combinational Equivalence
Modern combinational equivalence checking (CEC) engines are complicated programs which are difficult to verify. In this paper we show how a modern CEC engine can be modified to pr...
Satrajit Chatterjee, Alan Mishchenko, Robert K. Br...