4850 search results - page 123 / 970 » Approximate Data Structures with Applications |
FOCS
2007
IEEE
15 years 4 months ago
2007
IEEE
We present a strongly history independent (SHI) hash table that supports search in O(1) worst-case time, and insert and delete in O(1) expected time using O(n) data space. This ma...
KDD
2007
ACM
15 years 10 months ago
2007
ACM
Clustering methods can be either data-driven or need-driven. Data-driven methods intend to discover the true structure of the underlying data while need-driven methods aims at org...
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...
FORMATS
2007
Springer
15 years 4 months ago
2007
Springer
Dierence Bound Matrices (DBMs) are the most commonly used data structure for model checking timed automata. Since long they are being used in successful tools like Kronos or UPPAA...
CIDR
2003
14 years 11 months ago
2003
It has frequently been observed that most of the world’s data lies outside database systems. The reason is that database systems focus on structured data, leaving the unstructur...