Sciweavers

5463 search results - page 717 / 1093
» Evaluating algorithms that learn from data streams
Sort
View
ICDAR
2009
IEEE
16 years 2 months ago
Isolated Handwritten Farsi Numerals Recognition Using Sparse and Over-Complete Representations
A new isolated handwritten Farsi numeral recognition algorithm is proposed in this paper, which exploits the sparse and over-complete structure from the handwritten Farsi numeral ...
Wumo Pan, Tien D. Bui, Ching Y. Suen
SODA
1998
ACM
113views Algorithms» more  SODA 1998»
15 years 9 months ago
Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs
We develop data structures for dynamic closest pair problems with arbitrary (not necessarily geometric) distance functions, based on a technique previously used by the author for ...
David Eppstein
ALGORITHMICA
2010
95views more  ALGORITHMICA 2010»
15 years 7 months ago
Homogeneous String Segmentation using Trees and Weighted Independent Sets
We divide a string into k segments, each with only one sort of symbols, so as to minimize the total number of exceptions. Motivations come from machine learning and data mining. F...
Peter Damaschke
ICPR
2010
IEEE
15 years 12 months ago
Spatially Regularized Common Spatial Patterns for EEG Classification
In this paper, we propose a new algorithm for BrainComputer Interface (BCI): the Spatially Regularized Common Spatial Patterns (SRCSP). SRCSP is an extension of the famous CSP alg...
Fabien Lotte, Cuntai Guan
AAAI
2007
15 years 10 months ago
Restart Schedules for Ensembles of Problem Instances
The mean running time of a Las Vegas algorithm can often be dramatically reduced by periodically restarting it with a fresh random seed. The optimal restart schedule depends on th...
Matthew J. Streeter, Daniel Golovin, Stephen F. Sm...