4523 search results - page 18 / 905 » Using randomization in the teaching of data structures and a... |
STOC
2003
ACM
14 years 8 months ago
2003
ACM
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
VLDB
2007
ACM
14 years 8 months ago
2007
ACM
Many aspects of the data integration problem have been considered in the literature: how to match schemas across different data sources, how to decide when different records refer...
APPROX
2004
Springer
14 years 1 months ago
2004
Springer
The problem of estimating the kth frequency moment Fk for any nonnegative k, over a data stream by looking at the items exactly once as they arrive, was considered in a seminal pap...
SODA
2004
ACM
13 years 9 months ago
2004
ACM
We consider the problem of storing an ordered dictionary data structure over a distributed set of nodes. In contrast to traditional sequential data structures, distributed data st...
JGAA
2007
13 years 8 months ago
2007
Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...