112 search results - page 7 / 23 » Succinct Data Structures for Retrieval and Approximate Membe... |
102
click to vote
CCS
2008
ACM
15 years 2 days ago
2008
ACM
Hash tables are fundamental data structures that optimally answer membership queries. Suppose a client stores n elements in a hash table that is outsourced at a remote server so t...
LCN
2008
IEEE
15 years 4 months ago
2008
IEEE
— Bloom filters are a well known data structure for approximate set membership. Bloom filters are space efficient but require many independent hashes and consecutive memory acces...
MLDM
1999
Springer
15 years 2 months ago
1999
Springer
In large content-based image database applications, e cient information retrieval depends heavily on good indexing structures of the extracted features. While indexing techniques f...
ICDIM
2008
IEEE
15 years 4 months ago
2008
IEEE
Latent Semantic Indexing (LSI) is an effective method to discover the underlying semantic structure of data. It has numerous applications in information retrieval and data mining....
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
In this paper, we rst present a theorem that HOSVD-based representation of high-order tensor data provides a robust framework that can be used for a uni ed representation of the H...