Sciweavers

869 search results - page 41 / 174
» MicroARTMAP for pattern recognition problems
Sort
View
CORR
2007
Springer
88views Education» more  CORR 2007»
13 years 7 months ago
Faster subsequence recognition in compressed strings
Abstract. Processing compressed strings without decompression is often essential when dealing with massive data sets. We consider local subsequence recognition problems on strings ...
Alexandre Tiskin
CVPR
2006
IEEE
14 years 9 months ago
Learning Semantic Patterns with Discriminant Localized Binary Projections
In this paper, we present a novel approach to learning semantic localized patterns with binary projections in a supervised manner. The pursuit of these binary projections is refor...
Shuicheng Yan, Tianqiang Yuan, Xiaoou Tang
ICPR
2004
IEEE
14 years 8 months ago
Adjustable Invariant Features by Partial Haar-Integration
A very common type of a-priori knowledge in pattern analysis problems is invariance of the input data with respect to transformation groups, e.g. geometric transformations of imag...
Alaa Halawani, Bernard Haasdonk, Hans Burkhardt
IBPRIA
2007
Springer
14 years 1 months ago
A Fast and Robust Iris Segmentation Method
Image preprocessing stage (also known as iris segmentation) is the first step of the iris recognition process and determines its accuracy. In this paper, we propose a method for ir...
Noé Otero-Mateo, Miguel A. Vega-Rodrí...
STOC
2000
ACM
174views Algorithms» more  STOC 2000»
14 years 2 days ago
Noise-tolerant learning, the parity problem, and the statistical query model
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
Avrim Blum, Adam Kalai, Hal Wasserman