2631 search results - page 24 / 527 » A Practical Method for the Sparse Resultant |
MOC
2010
14 years 6 months ago
2010
The Lanczos method is often used to solve a large and sparse symmetric matrix eigenvalue problem. There is a well-established convergence theory that produces bounds to predict the...
ALT
2008
Springer
15 years 8 months ago
2008
Springer
We give a bound on the expected reconstruction error for a general coding method where data in a Hilbert space are represented by finite dimensional coding vectors. The result can...
WACV
2005
IEEE
15 years 5 months ago
2005
IEEE
In this paper, we present a novel solution of image segmentation based on positiveness by regarding the segmentation as one of the graph-theoretic clustering problems. On the cont...
103
click to vote
FGR
2006
IEEE
15 years 3 months ago
2006
IEEE
Non-linear subspaces derived using kernel methods have been found to be superior compared to linear subspaces in modeling or classification tasks of several visual phenomena. Such...
126
click to vote
ICCV
2011
IEEE
13 years 11 months ago
2011
IEEE
Sparse representation based classification has led to interesting image recognition results, while the dictionary used for sparse coding plays a key role in it. This paper present...