441 search results - page 65 / 89 » Sparse Recovery Using Sparse Random Matrices |
168
click to vote
CVPR
2010
IEEE
16 years 1 months ago
2010
IEEE
We propose a face recognition approach based on hashing. The approach yields comparable recognition rates with the random 1 approach [18], which is considered the stateof-the-art....
140
click to vote
SWAT
2004
Springer
15 years 11 months ago
2004
Springer
In this paper, we consider the problems of generating all maximal (bipartite) cliques in a given (bipartite) graph G = (V, E) with n vertices and m edges. We propose two algorithms...
160
click to vote
CORR
2011
Springer
15 years 15 days ago
2011
Springer
This paper studies the “explanation problem” for tree- and linearly-ordered array data, a problem motivated by database applications and recently solved for the one-dimensiona...
179
click to vote
FOCM
2011
14 years 9 months ago
2011
This paper considers large-scale simulations of wave propagation phenomena. We argue that it is possible to accurately compute a wavefield by decomposing it onto a largely incomp...
176
click to vote
ICPR
2010
IEEE
16 years 1 months ago
2010
IEEE
Matching near-infrared (NIR) face images to visible light (VIS) face images offers a robust approach to face recognition with unconstrained illumination. In this paper we propose ...