1245 search results - page 99 / 249 » Binary Sparse Coding |
144
click to vote
FCCM
2007
IEEE
15 years 5 months ago
2007
IEEE
Creating a high throughput sparse matrix vector multiplication (SpMxV) implementation depends on a balanced system design. In this paper, we introduce the innovative SpMxV Solver ...
172
Voted
ICCV
2011
IEEE
14 years 3 months ago
2011
IEEE
We present an approach for dictionary learning of action attributes via information maximization. We unify the class distribution and appearance information into an objective func...
173
Voted
PAMI
2011
14 years 10 months ago
2011
—Inferring latent structures from observations helps to model and possibly also understand underlying data generating processes. A rich class of latent structures are the latent ...
208
Voted
PKC
2011
Springer
14 years 6 months ago
2011
Springer
ded abstract of this work appears in Public Key Cryptography — PKC 2011, ed. R. Gennaro, Springer LNCS 6571 (2011), 1–16. This is the full version. We propose a linearly homom...
103
click to vote
PASTE
2004
ACM
15 years 9 months ago
2004
ACM
This paper presents FIT, a Flexible open-source binary code Instrumentation Toolkit. Unlike existing tools, FIT is truly portable, with existing backends for the Alpha, x86 and AR...