Sciweavers

6413 search results - page 580 / 1283
» Classes of cycle bases
Sort
View
184
Voted
PR
1998
86views more  PR 1998»
15 years 7 months ago
Optimizing the cost matrix for approximate string matching using genetic algorithms
This paper describes a method for optimizing the cost matrix of any approximate string matching algorithm based on the Levenshtein distance. The method, which uses genetic algorit...
Marc Parizeau, Nadia Ghazzali, Jean-Françoi...
SIAMCOMP
1998
162views more  SIAMCOMP 1998»
15 years 7 months ago
Hypercubic Sorting Networks
Hypercubic sorting networks are a class of comparator networks whose structure maps e ciently to the hypercube and any of its bounded degree variants. Recently, n-input hypercubic...
Frank Thomson Leighton, C. Greg Plaxton
TIP
1998
135views more  TIP 1998»
15 years 7 months ago
Adaptive weighted highpass filters using multiscale analysis
In this paper, we propose a general framework for studying a class of weighted highpass filters. Our framework, based on a multiscale signal decomposition, allows us to study a w...
Robert D. Nowak, Richard G. Baraniuk
191
Voted
IS
2010
15 years 5 months ago
Identifying user strategies in exploratory learning with evolving task modelling
Abstract—In this paper we present work on adaptive identification of learners’ strategies, gradually developing a higher level of adaptation based on evolving models of mathem...
Mihaela Cocea, George D. Magoulas
LICS
2010
IEEE
15 years 5 months ago
On Strong Maximality of Paraconsistent Finite-Valued Logics
Abstract—Maximality is a desirable property of paraconsistent logics, motivated by the aspiration to tolerate inconsistencies, but at the same time retain as much as possible fro...
Arnon Avron, Ofer Arieli, Anna Zamansky