Sciweavers

157 search results - page 27 / 32
» Incremental Compilation-to-SAT Procedures
Sort
View
INTERSPEECH
2010
13 years 5 months ago
Boosted mixture learning of Gaussian mixture HMMs for speech recognition
In this paper, we propose a novel boosted mixture learning (BML) framework for Gaussian mixture HMMs in speech recognition. BML is an incremental method to learn mixture models fo...
Jun Du, Yu Hu, Hui Jiang
TCS
1998
13 years 10 months ago
A Uniform Approach to Semi-Dynamic Problems on Digraphs
In this paper we propose a uniform approach to deal with incremental problems on digraphs and with decremental problems on dags generalizing a technique used by La Poutr´e and va...
Serafino Cicerone, Daniele Frigioni, Umberto Nanni...
SIGMOD
1997
ACM
107views Database» more  SIGMOD 1997»
14 years 3 months ago
Range Queries in OLAP Data Cubes
A range query applies an aggregation operation over all selected cells of an OLAP data cube where the selection is speci ed by providing ranges of values for numeric dimensions. W...
Ching-Tien Ho, Rakesh Agrawal, Nimrod Megiddo, Ram...
CORR
2007
Springer
99views Education» more  CORR 2007»
13 years 10 months ago
Fast Selection of Spectral Variables with B-Spline Compression
The large number of spectral variables in most data sets encountered in spectral chemometrics often renders the prediction of a dependent variable uneasy. The number of variables ...
Fabrice Rossi, Damien François, Vincent Wer...
TACAS
2010
Springer
255views Algorithms» more  TACAS 2010»
13 years 8 months ago
Satisfiability Modulo the Theory of Costs: Foundations and Applications
Abstract. We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and ...
Alessandro Cimatti, Anders Franzén, Alberto...