Sciweavers

653 search results - page 14 / 131
» A Sensitive Sequence Comparison Method
Sort
View
JUCS
2007
88views more  JUCS 2007»
14 years 11 months ago
A Comparison of Various Methods for Computing Bounds for Positive Roots of Polynomials
Abstract: The recent interest in isolating real roots of polynomials has revived interest in computing sharp upper bounds on the values of the positive roots of polynomials. Until ...
Alkiviadis G. Akritas, Panagiotis S. Vigklas
ICASSP
2011
IEEE
14 years 3 months ago
Towards robust word discovery by self-similarity matrix comparison
Word discovery is the task of discovering and collecting occurrences of repeating words in the absence of prior acoustic and linguistic knowledge, or training material. The capabi...
Armando Muscariello, Guillaume Gravier, Fré...
ECML
2005
Springer
15 years 5 months ago
Error-Sensitive Grading for Model Combination
Abstract. Ensemble learning is a powerful learning approach that combines multiple classifiers to improve prediction accuracy. An important decision while using an ensemble of cla...
Surendra K. Singhi, Huan Liu
EURODAC
1994
IEEE
141views VHDL» more  EURODAC 1994»
15 years 3 months ago
Exact path sensitization in timing analysis
of a direct implementation of this criterion. This paper presents the first critical path finding tool based on the exact criterion. It offers therefore better results in compariso...
R. Peset Llopis
NECO
2002
106views more  NECO 2002»
14 years 11 months ago
Learning Nonregular Languages: A Comparison of Simple Recurrent Networks and LSTM
In response to Rodriguez' recent article (2001) we compare the performance of simple recurrent nets and "Long Short-Term Memory" (LSTM) recurrent nets on context-fr...
Jürgen Schmidhuber, Felix A. Gers, Douglas Ec...