Sciweavers

282 search results - page 30 / 57
» Additive Preconditioning for Matrix Computations
Sort
View
ICPR
2004
IEEE
16 years 1 months ago
Efficient Calculation of the Complete Optimal Classification Set
Feature and structure selection is an important part of many classification problems. In previous papers, an approach called basis pursuit classification has been proposed which p...
Martin Brown, Nicholas Costen, Shigeru Akamatsu
103
Voted
ICCV
2003
IEEE
15 years 5 months ago
On the Epipolar Geometry of the Crossed-Slits Projection
The Crossed-Slits (X-Slits) camera is defined by two nonintersecting slits, which replace the pinhole in the common perspective camera. Each point in space is projected to the im...
Doron Feldman, Tomás Pajdla, Daphna Weinsha...
CVPR
2010
IEEE
15 years 4 months ago
Local Features Are Not Lonely - Laplacian Sparse Coding for Image Classification
Sparse coding which encodes the original signal in a sparse signal space, has shown its state-of-the-art performance in the visual codebook generation and feature quantization pro...
Shenghua Gao, Wai-Hung Tsang, Liang-Tien Chia, Pei...
107
Voted
MPC
2010
Springer
174views Mathematics» more  MPC 2010»
15 years 4 months ago
Matrices as Arrows!
cting programs and point-free abstraction [2]. In order to automatically generate the fast running code there was the need to use matrix product as the basic matrix composition ope...
Hugo Daniel Macedo, José Nuno Oliveira
HICSS
2010
IEEE
200views Biometrics» more  HICSS 2010»
15 years 2 months ago
Instability of Relevance-Ranked Results Using Latent Semantic Indexing for Web Search
1 The latent semantic indexing (LSI) methodology for information retrieval applies the singular value decomposition to identify an eigensystem for a large matrix, in which cells re...
Houssain Kettani, Gregory B. Newby