608 search results - page 111 / 122 » On Dependent Randomized Rounding Algorithms |
126
Voted
STOC
2005
ACM
16 years 2 months ago
2005
ACM
We present new explicit constructions of deterministic randomness extractors, dispersers and related objects. We say that a distribution X on binary strings of length n is a -sour...
134
Voted
CIKM
2006
Springer
15 years 6 months ago
2006
Springer
We consider the problem of finding highly correlated pairs in a large data set. That is, given a threshold not too small, we wish to report all the pairs of items (or binary attri...
136
Voted
EUROGRAPHICS
2010
Eurographics
15 years 3 months ago
2010
Eurographics
This paper proposes two variants of a simple but efficient algorithm for structure-preserving halftoning. Our algorithm extends Floyd-Steinberg error diffusion; the goal of our ex...
139
Voted
IM
2007
15 years 2 months ago
2007
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
113
click to vote
KDD
2005
ACM
16 years 3 months ago
2005
ACM
Protection of privacy has become an important problem in data mining. In particular, individuals have become increasingly unwilling to share their data, frequently resulting in in...