Sciweavers

491 search results - page 76 / 99
» A new kernel-based approach for linear system identification
Sort
View
CP
2008
Springer
13 years 10 months ago
Revisiting the Upper Bounding Process in a Safe Branch and Bound Algorithm
Abstract. Finding feasible points for which the proof succeeds is a critical issue in safe Branch and Bound algorithms which handle continuous problems. In this paper, we introduce...
Alexandre Goldsztejn, Yahia Lebbah, Claude Michel,...
NAACL
1994
13 years 10 months ago
High-Accuracy Large-Vocabulary Speech Recognition Using Mixture Tying and Consistency Modeling
Improved acoustic modeling can significantly decrease the error rate in large-vocabulary speech recognition. Our approach to the problem is twofold. We first propose a scheme that...
Vassilios Digalakis, Hy Murveit
JMIV
2000
90views more  JMIV 2000»
13 years 8 months ago
Invariants to Convolution in Arbitrary Dimensions
Processing of multidimensional image data which were acquired by a linear imaging system of unknown point-spread function (PSF) is an important problem whose solution usually requi...
Jan Flusser, Jirí Boldys, Barbara Zitov&aac...
LICS
2008
IEEE
14 years 3 months ago
Hiding Local State in Direct Style: A Higher-Order Anti-Frame Rule
Separation logic involves two dual forms of modularity: local reasoning makes part of the store invisible within a static scope, whereas hiding local state makes part of the store...
François Pottier
DAGSTUHL
2007
13 years 10 months ago
Matrix Analytic Methods in Branching processes
We examine the question of solving the extinction probability of a particular class of continuous-time multi-type branching processes, named Markovian binary trees (MBT). The exti...
Sophie Hautphenne, Guy Latouche, Marie-Ange Remich...