Sciweavers

459 search results - page 51 / 92
» Average Case Analysis of Conjunctive Learning Algorithms
Sort
View
JEA
2008
120views more  JEA 2008»
13 years 7 months ago
Better external memory suffix array construction
Suffix arrays are a simple and powerful data structure for text processing that can be used for full text indexes, data compression, and many other applications in particular in b...
Roman Dementiev, Juha Kärkkäinen, Jens M...
GECCO
2010
Springer
155views Optimization» more  GECCO 2010»
14 years 16 days ago
Negative selection algorithms without generating detectors
Negative selection algorithms are immune-inspired classifiers that are trained on negative examples only. Classification is performed by generating detectors that match none of ...
Maciej Liskiewicz, Johannes Textor
COR
2008
122views more  COR 2008»
13 years 7 months ago
First steps to the runtime complexity analysis of ant colony optimization
: The paper presents results on the runtime complexity of two ant colony optimization (ACO) algorithms: Ant System, the oldest ACO variant, and GBAS, the first ACO variant for whic...
Walter J. Gutjahr
NIPS
2007
13 years 9 months ago
Learning with Transformation Invariant Kernels
This paper considers kernels invariant to translation, rotation and dilation. We show that no non-trivial positive definite (p.d.) kernels exist which are radial and dilation inv...
Christian Walder, Olivier Chapelle
CVPR
2008
IEEE
13 years 9 months ago
Classification via semi-Riemannian spaces
In this paper, we develop a geometric framework for linear or nonlinear discriminant subspace learning and classification. In our framework, the structures of classes are conceptu...
Deli Zhao, Zhouchen Lin, Xiaoou Tang