85 search results - page 7 / 17 » Generalized approximate counting revisited |
ICALP
2009
Springer
15 years 12 months ago
2009
Springer
Correlation Clustering was defined by Bansal, Blum, and Chawla as the problem of clustering a set of elements based on a possibly inconsistent binary similarity function between e...
191
click to vote
ICDT
2009
ACM
16 years 11 days ago
2009
ACM
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...
95
Voted
TKDE
2010
14 years 10 months ago
2010
—Bloom filter is effective, space-efficient data structure for concisely representing a data set and supporting approximate membership queries. Traditionally, researchers often b...
102
click to vote
GLVLSI
2010
IEEE
14 years 12 months ago
2010
IEEE
We revisit voltage partitioning problem when the mapped voltages of functional units are predetermined. If energy consumption is estimated by formulation E = CV 2 , a published wo...
103
Voted
ACSD
2007
IEEE
15 years 6 months ago
2007
IEEE
This paper proposes a new approach for the hazard checking of timed asynchronous circuits. Previous papers proposed either exact algorithms, which suffer from statespace explosion...