Sciweavers

3256 search results - page 56 / 652
» Learning Linear Transformations
Sort
View
GECCO
2007
Springer
209views Optimization» more  GECCO 2007»
14 years 1 months ago
Kernel based automatic clustering using modified particle swarm optimization algorithm
This paper introduces a method for clustering complex and linearly non-separable datasets, without any prior knowledge of the number of naturally occurring clusters. The proposed ...
Ajith Abraham, Swagatam Das, Amit Konar
ALT
2006
Springer
14 years 4 months ago
Learning Linearly Separable Languages
This paper presents a novel paradigm for learning languages that consists of mapping strings to an appropriate high-dimensional feature space and learning a separating hyperplane i...
Leonid Kontorovich, Corinna Cortes, Mehryar Mohri
SIAMMAX
2010
189views more  SIAMMAX 2010»
13 years 2 months ago
Fast Algorithms for the Generalized Foley-Sammon Discriminant Analysis
Linear Discriminant Analysis (LDA) is one of the most popular approaches for feature extraction and dimension reduction to overcome the curse of the dimensionality of the high-dime...
Lei-Hong Zhang, Li-Zhi Liao, Michael K. Ng
SAS
2010
Springer
143views Formal Methods» more  SAS 2010»
13 years 6 months ago
Points-to Analysis as a System of Linear Equations
The efficiency of a points-to analysis is critical for several compiler optimizations and transformations, and has attracted considerable research attention. Despite several advanc...
Rupesh Nasre, Ramaswamy Govindarajan
CPM
2008
Springer
112views Combinatorics» more  CPM 2008»
13 years 9 months ago
Computing Inverse ST in Linear Complexity
The Sort Transform (ST) can significantly speed up the block sorting phase of the Burrows-Wheeler transform (BWT) by sorting only limited order contexts. However, the best result o...
Ge Nong, Sen Zhang, Wai Hong Chan