Sciweavers

14078 search results - page 269 / 2816
» Design and Analysis of Computer Algorithms
Sort
View
ICSE
2008
IEEE-ACM
16 years 7 months ago
Design patterns: between programming and software design
In computer science curricula the two areas programming and software engineering are usually separated. In programming students learn an object oriented language and then deepen t...
Christoph Denzler, Dominik Gruntz
BIRTHDAY
2009
Springer
16 years 1 months ago
Polynomial Precise Interval Analysis Revisited
We consider a class of arithmetic equations over the complete lattice of integers (extended with −∞ and ∞) and provide a polynomial time algorithm for computing least solutio...
Thomas Gawlitza, Jérôme Leroux, Jan R...
ICPR
2006
IEEE
16 years 7 months ago
Non-Iterative Two-Dimensional Linear Discriminant Analysis
Linear discriminant analysis (LDA) is a well-known scheme for feature extraction and dimensionality reduction of labeled data in a vector space. Recently, LDA has been extended to...
Kohei Inoue, Kiichi Urahama
DISCO
1993
114views Hardware» more  DISCO 1993»
15 years 10 months ago
Gauss: A Parameterized Domain of Computation System with Support for Signature Functions
The fastest known algorithms in classical algebra make use of signature functions. That is, reducing computation with formulae to computing with the integers modulo p, by substitut...
Michael B. Monagan
GECCO
2007
Springer
149views Optimization» more  GECCO 2007»
16 years 24 days ago
Informative performance metrics for dynamic optimisation problems
Existing metrics for dynamic optimisation are designed primarily to rate an algorithm’s overall performance. These metrics show whether one algorithm is better than another, but...
Stefan Bird, Xiaodong Li