4850 search results - page 16 / 970 » Approximate Data Structures with Applications |
153
click to vote
ISSAC
2005
Springer
15 years 11 months ago
2005
Springer
This paper presents a duality analysis and an algorithm for computing the multiplicity structure of a zero to a polynomial system, while the zero can be exact or approximate with ...
132
click to vote
VLDB
2000
ACM
15 years 9 months ago
2000
ACM
We propose a novel index structure, A-tree (Approximation tree), for similarity search of high-dimensional data. The basic idea of the
186
click to vote
INFOCOM
2006
IEEE
15 years 12 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...
161
click to vote
CIKM
2006
Springer
15 years 9 months ago
2006
Springer
We present a hierarchical tree structure for online maintenance of time-decaying synopses over streaming data. We exemplify such an amnesic behavior over streams of locations take...
