4850 search results - page 16 / 970 » Approximate Data Structures with Applications |
ISSAC
2005
Springer
14 years 2 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 ...
VLDB
2000
ACM
14 years 1 days 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
INFOCOM
2006
IEEE
14 years 2 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...
CIKM
2006
Springer
14 years 6 days 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...
KDD
2010
ACM
14 years 3 days ago
2010
ACM
