Sciweavers

1004 search results - page 53 / 201
» A comparison of generalized linear discriminant analysis alg...
Sort
View
AI
1998
Springer
13 years 8 months ago
Worst-Case Analysis of the Perceptron and Exponentiated Update Algorithms
The absolute loss is the absolute difference between the desired and predicted outcome. This paper demonstrates worst-case upper bounds on the absolute loss for the Perceptron le...
Tom Bylander
EVOW
2003
Springer
14 years 1 months ago
Search Space Analysis of the Linear Ordering Problem
Abstract. The Linear Ordering Problem (LOP) is an NP-hard combinatorial optimization problem that arises in a variety of applications and several algorithmic approaches to its solu...
Tommaso Schiavinotto, Thomas Stützle
ICDAR
2003
IEEE
14 years 2 months ago
Study of the Consistency of Some Discriminatory Features Used by Document Examiners in the Analysis of Handwritten Letter 'a'
In this paper a study of some structural features of handwritten letter ‘a’ is presented. The features under consideration are structural, style and formation features documen...
Philip Jonathan Sutanto, Graham Leedham, Vladimir ...
ACTA
2010
91views more  ACTA 2010»
13 years 3 months ago
A theoretical comparison of LRU and LRU-K
The paging algorithm Least Recently Used Second Last Request (LRU-2) was proposed for use in database disk buffering and shown experimentally to perform better than Least Recently ...
Joan Boyar, Martin R. Ehmsen, Jens S. Kohrt, Kim S...
PLDI
2003
ACM
14 years 1 months ago
Linear analysis and optimization of stream programs
As more complex DSP algorithms are realized in practice, an increasing need for high-level stream abstractions that can be compiled without sacrificing efficiency. Toward this en...
Andrew A. Lamb, William Thies, Saman P. Amarasingh...