112 search results - page 14 / 23 » Succinct Data Structures for Retrieval and Approximate Membe... |
ACL
2007
14 years 11 months ago
2007
A Bloom filter (BF) is a randomised data structure for set membership queries. Its space requirements are significantly below lossless information-theoretic lower bounds but it ...
170
click to vote
VLDB
2007
ACM
15 years 10 months ago
2007
ACM
In this article, we propose a new approach for querying and indexing a database of trees with specific applications to XML datasets. Our approach relies on representing both the q...
ICMCS
2009
IEEE
14 years 7 months ago
2009
IEEE
Nearest Neighbor (NN) retrieval is a crucial tool of many computer vision tasks. Since the brute-force naive search is too time consuming for most applications, several tailored d...
WWW
2008
ACM
15 years 10 months ago
2008
ACM
We propose a method of classifying XML documents and extracting XML schema from XML by inductive inference based on constraint logic programming. The goal of this work is to type ...
161
Voted
SIGMOD
2006
ACM
15 years 10 months ago
2006
ACM
To enable efficient similarity search in large databases, many indexing techniques use a linear transformation scheme to reduce dimensions and allow fast approximation. In this re...