132 search results - page 22 / 27 » Sparse Boolean Matrix Factorizations |
98
Voted
CIKM
2011
Springer
13 years 11 months ago
2011
Springer
Many large-scale Web applications that require ranked top-k retrieval are implemented using inverted indices. An inverted index represents a sparse term-document matrix, where non...
CVPR
2006
IEEE
16 years 1 months ago
2006
IEEE
In this paper, we present a novel approach to learning semantic localized patterns with binary projections in a supervised manner. The pursuit of these binary projections is refor...
122
click to vote
PPOPP
1991
ACM
15 years 3 months ago
1991
ACM
This paper presents Jade, a language which allows a programmer to easily express dynamic coarse-grain parallelism. Starting with a sequential program, a programmer augments those ...
107
click to vote
CVPR
2011
IEEE
14 years 7 months ago
2011
IEEE
We develop a dictionary learning method which is (i) online, (ii) enables overlapping group structures with (iii) non-convex sparsity-inducing regularization and (iv) handles the ...
151
click to vote
CVPR
2012
IEEE
13 years 2 months ago
2012
IEEE
Subspace clustering and feature extraction are two of the most commonly used unsupervised learning techniques in computer vision and pattern recognition. State-of-theart technique...