Sciweavers

5154 search results - page 146 / 1031
» Computing and using residuals in time series models
Sort
View
ICASSP
2010
IEEE
15 years 6 months ago
Partial sequence matching using an Unbounded Dynamic Time Warping algorithm
Before the advent of Hidden Markov Models(HMM)-based speech recognition, many speech applications were built using pattern matching algorithms like the Dynamic Time Warping (DTW) ...
Xavier Anguera, Robert Macrae, Nuria Oliver
CONCUR
2006
Springer
15 years 8 months ago
Inference of Event-Recording Automata Using Timed Decision Trees
In regular inference, the problem is to infer a regular language, typically represented by a deterministic finite automaton (DFA) from answers to a finite set of membership querie...
Olga Grinchtein, Bengt Jonsson, Paul Pettersson
ICPP
1999
IEEE
15 years 10 months ago
New Delay Analysis in High Speed Networks
The implementation of bounded-delay services over integrated services networks relies admission control mechanisms that in turn use end-to-end delay computation algorithms. For gu...
Chengzhi Li, Riccardo Bettati, Wei Zhao
IEEECIT
2005
IEEE
15 years 12 months ago
iCDMdt: Focused the Model Mapping and Performance Optimization in Embedded System Design
This paper proposes a method of model-driven HW/SW co-design in embedded system design and discusses the key technology of model mapping, automatic generating codes and performanc...
Jing Luan, Xuan Cheng, Junzhong Gu
JCST
2010
189views more  JCST 2010»
15 years 1 months ago
Formally Analyzing Expected Time Complexity of Algorithms Using Theorem Proving
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
Osman Hasan, Sofiène Tahar