7930 search results - page 1331 / 1586 » Greedy in Approximation Algorithms |
142
click to vote
STOC
2003
ACM
16 years 5 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...
171
click to vote
SIGMOD
2001
ACM
16 years 5 months ago
2001
ACM
In this paper, we investigate how to scale hierarchical clustering methods (such as OPTICS) to extremely large databases by utilizing data compression methods (such as BIRCH or ra...
186
click to vote
PODS
2007
ACM
16 years 5 months ago
2007
ACM
IP packet streams consist of multiple interleaving IP flows. Statistical summaries of these streams, collected for different measurement periods, are used for characterization of ...
161
click to vote
EDBT
2009
ACM
15 years 11 months ago
2009
ACM
In recent years, large amount of data modeled by graphs, namely graph data, have been collected in various domains. Efficiently processing queries on graph databases has attracted...
152
click to vote
GLOBECOM
2009
IEEE
15 years 11 months ago
2009
IEEE
—One of the key factors underlying the popularity of Low-density parity-check (LDPC) code is its iterative decoding algorithm that is amenable to efficient hardware implementati...