Sciweavers

12265 search results - page 191 / 2453
» Knuth-Morris-Pratt Algorithm: An Analysis
Sort
View
ICDAR
1999
IEEE
15 years 9 months ago
On the Evaluation of Document Analysis Components by Recall, Precision, and Accuracy
In document analysis, it is common to prove the usefulness of a component by an experimental evaluation. By applying the respective algorithms to a test sample, some effectiveness...
Markus Junker, Andreas Dengel, Rainer Hoch
UIST
2006
ACM
15 years 10 months ago
Viz: a visual analysis suite for explaining local search behavior
NP-hard combinatorial optimization problems are common in real life. Due to their intractability, local search algorithms are often used to solve such problems. Since these algori...
Steven Halim, Roland H. C. Yap, Hoong Chuin Lau
JMLR
2006
99views more  JMLR 2006»
15 years 4 months ago
Worst-Case Analysis of Selective Sampling for Linear Classification
A selective sampling algorithm is a learning algorithm for classification that, based on the past observed data, decides whether to ask the label of each new instance to be classi...
Nicolò Cesa-Bianchi, Claudio Gentile, Luca ...
ICPR
2006
IEEE
16 years 5 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
153
Voted
LOPSTR
2004
Springer
15 years 10 months ago
Fully Automatic Binding-Time Analysis for Prolog
Offline partial evaluation techniques rely on an annotated version of the source program to control the specialisation process. These annotations guide the specialisation and have ...
Stephen-John Craig, John P. Gallagher, Michael Leu...