244 search results - page 28 / 49 » Compressive PCA on Graphs |
134
click to vote
ICSE
2004
IEEE-ACM
16 years 2 months ago
2004
IEEE-ACM
Dynamic slicing is a well-known program debugging technique. Given a program P and input I, it finds all program statements which directly/indirectly affect the values of some var...
113
Voted
CORR
2011
Springer
14 years 9 months ago
2011
Springer
The problem of storing a set of strings – a string dictionary – in compact form appears naturally in many cases. While classically it has represented a small part of the whole ...
154
click to vote
TIT
2010
14 years 9 months ago
2010
Compressed sensing (CS) has recently emerged as a powerful signal acquisition paradigm. In essence, CS enables the recovery of high-dimensional sparse signals from relatively few ...
135
click to vote
IACR
2011
14 years 2 months ago
2011
We consider the family of 2n-to-n-bit compression functions that are solely based on at most three permutation executions and on XOR-operators, and analyze its collision and preima...
132
click to vote
SSPR
2010
Springer
15 years 7 days ago
2010
Springer
Abstract. In order to use structural techniques from graph-based pattern recognition, a first necessary step consists in extracting a graph in an automatic way from an image. We pr...