223 search results - page 5 / 45 » Generalized Descriptor Compression for Storage and Matching |
KDD
2009
ACM
14 years 8 months ago
2009
ACM
Motivated by structural properties of the Web graph that support efficient data structures for in memory adjacency queries, we study the extent to which a large network can be com...
CGF
2011
12 years 11 months ago
2011
Bidirectional texture functions (BTFs) represent the appearance of complex materials. Three major shortcomings with BTFs are the bulky storage, the difficulty in editing and the ...
CIKM
2011
Springer
12 years 7 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...
KDD
2006
ACM
14 years 7 months ago
2006
ACM
Often the best performing supervised learning models are ensembles of hundreds or thousands of base-level classifiers. Unfortunately, the space required to store this many classif...
SIGMOD
2009
ACM
14 years 7 months ago
2009
ACM
We consider the problem of collectively approximating a set of sensor signals using the least amount of space so that any individual signal can be efficiently reconstructed within...