Sciweavers

688 search results - page 89 / 138
» Computing with subspaces
Sort
View
73
Voted
ICPR
2010
IEEE
14 years 7 months ago
Improving Classification Accuracy by Comparing Local Features through Canonical Correlations
Classifying images using features extracted from densely sampled local patches has enjoyed significant success in many detection and recognition tasks. It is also well known that ...
Mert Dikmen, Thomas S. Huang
ICASSP
2011
IEEE
14 years 1 months ago
Distributed linear discriminant analysis
Linear discriminant analysis (LDA) is a widely used feature extraction method for classification. We introduce distributed implementations of different versions of LDA, suitable ...
Sergio Valcarcel Macua, Pavle Belanovic, Santiago ...
CVPR
2012
IEEE
13 years 3 days ago
Non-negative low rank and sparse graph for semi-supervised learning
Constructing a good graph to represent data structures is critical for many important machine learning tasks such as clustering and classification. This paper proposes a novel no...
Liansheng Zhuang, Haoyuan Gao, Zhouchen Lin, Yi Ma...
ICASSP
2010
IEEE
14 years 10 months ago
Evaluation of random-projection-based feature combination on speech recognition
Random projection has been suggested as a means of dimensionality reduction, where the original data are projected onto a subspace using a random matrix. It represents a computati...
Tetsuya Takiguchi, Jeff Bilmes, Mariko Yoshii, Yas...
BIRTHDAY
2009
Springer
15 years 4 months ago
Hybrid BDD and All-SAT Method for Model Checking
We present a new hybrid BDD and SAT-based algorithm for model checking. Our algorithm is based on backward search, where each pre-image computation consists of an efficient All-SA...
Avi Yadgar, Orna Grumberg, Assaf Schuster