112 search results - page 4 / 23 » Succinct Data Structures for Retrieval and Approximate Membe... |
COMPGEOM
2005
ACM
13 years 7 months ago
2005
ACM
We present a new multi-dimensional data structure, which we call the skip quadtree (for point data in R2) or the skip octree (for point data in Rd, with constant d > 2). Our da...
INFOCOM
2006
IEEE
13 years 11 months ago
2006
IEEE
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
AUTOMATICA
2008
13 years 5 months ago
2008
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...
AMR
2005
Springer
13 years 11 months ago
2005
Springer
The XML language is a W3C standard sustained by both the industry and the scientific community. Therefore, the available information annotated in XML keeps and will keep increasing...
VLDB
2005
ACM
13 years 11 months ago
2005
ACM
In various applications such as data cleansing, being able to retrieve categorical or numerical attributes based on notions of approximate match (e.g., edit distance, numerical di...