Sciweavers

159 search results - page 28 / 32
» Sparse non-Gaussian component analysis
Sort
View
NIPS
2008
13 years 10 months ago
Theory of matching pursuit
We analyse matching pursuit for kernel principal components analysis (KPCA) by proving that the sparse subspace it produces is a sample compression scheme. We show that this bound...
Zakria Hussain, John Shawe-Taylor
ICASSP
2010
IEEE
13 years 8 months ago
Learning with synthesized speech for automatic emotion recognition
Data sparseness is an ever dominating problem in automatic emotion recognition. Using artificially generated speech for training or adapting models could potentially ease this: t...
Bjoern Schuller, Felix Burkhardt
DAS
2010
Springer
13 years 12 months ago
Handwritten Arabic text line segmentation using affinity propagation
In this paper, we present a novel graph-based method for extracting handwritten text lines in monochromatic Arabic document images. Our approach consists of two steps Coarse text ...
Jayant Kumar, Wael Abd-Almageed, Le Kang, David S....
IPPS
2008
IEEE
14 years 3 months ago
SNAP, Small-world Network Analysis and Partitioning: An open-source parallel graph framework for the exploration of large-scale
We present SNAP (Small-world Network Analysis and Partitioning), an open-source graph framework for exploratory study and partitioning of large-scale networks. To illustrate the c...
David A. Bader, Kamesh Madduri
SC
1995
ACM
14 years 2 days ago
Parallel Implementations of the Power System Transient Stability Problem on Clusters of Workstations
Power system transient stability analysis computes the response of the rapidly changing electrical components of a power system to a sequence of large disturbances followed by ope...
Monika ten Bruggencate, Suresh Chalasani