139 search results - page 6 / 28 » Sparse Projections over Graph |
ICPR
2010
IEEE
15 years 4 months ago
2010
IEEE
Face recognition (FR) is an active yet challenging topic in computer vision applications. As a powerful tool to represent high dimensional data, recently sparse representation bas...
108
click to vote
WD
2010
14 years 9 months ago
2010
Gossip-based epidemic protocols are used to aggregate data in distributed systems. This fault-tolerant approach does neither require maintenance of any global network state nor kno...
140
click to vote
STOC
2006
ACM
15 years 12 months ago
2006
ACM
We introduce a new low-distortion embedding of d 2 into O(log n) p (p = 1, 2), called the Fast-Johnson-LindenstraussTransform. The FJLT is faster than standard random projections ...
ICASSP
2008
IEEE
15 years 6 months ago
2008
IEEE
The theory of compressed sensing shows that samples in the form of random projections are optimal for recovering sparse signals in high-dimensional spaces (i.e., finding needles ...
EACL
2006
ACL Anthology
15 years 1 months ago
2006
ACL Anthology
We investigate a series of graph-theoretic constraints on non-projective dependency parsing and their effect on expressivity, i.e. whether they allow naturally occurring syntactic...