244 search results - page 35 / 49 » Compressive PCA on Graphs |
ICVGIP
2004
14 years 8 days ago
2004
Automatic content based schemes, as opposed to those with human endeavor, have become important as users attempt to organize massive data presented in the form of multimedia data ...
COLING
2010
13 years 5 months ago
2010
Multi-document summarization aims to distill the most important information from a set of documents to generate a compressed summary. Given a sentence graph generated from a set o...
ICASSP
2011
IEEE
13 years 2 months ago
2011
IEEE
The application of joint source-channel coding, based on fountain codes, in the broadcast timeslot of wireless two-way network coding is investigated in this paper. A computationa...
IACR
2011
12 years 10 months ago
2011
We introduce a new concept in splice-and-cut attacks on hash functions, which bridges the gap between preimage attacks and a powerful method of differential cryptanalysis. The ne...
SIGMOD
2009
ACM
14 years 11 months ago
2009
ACM
Reachability queries on large directed graphs have attracted much attention recently. The existing work either uses spanning structures, such as chains or trees, to compress the c...