9611 search results - page 182 / 1923 » A Note on Difference Sets |
127
click to vote
SODA
2008
ACM
15 years 6 months ago
2008
ACM
This paper studies an extension of the k-median problem where we are given a metric space (V, d) and not just one but m client sets {Si V }m i=1, and the goal is to open k facili...
165
Voted
ML
2008
ACM
15 years 5 months ago
2008
ACM
It is well-known that heuristic search in ILP is prone to plateau phenomena. An explanation can be given after the work of Giordana and Saitta: the ILP covering test is NP-complete...
136
Voted
LATINCRYPT
2010
15 years 3 months ago
2010
Abstract. A cryptographic accumulator is a scheme where a set of elements is represented by a single short value. This value, along with another value called witness, allows to pro...
150
click to vote
WOTE
2010
15 years 3 months ago
2010
We present a K-out-of-L voting scheme, i.e., a voting scheme that allows every voter to vote for (up to) K candidates from a set of L candidates. The scheme is receipt-free, which ...
181
Voted
DPD
2010
15 years 2 months ago
2010
Abstract Bloom filters are extensively used in distributed applications, especially in distributed databases and distributed information systems, to reduce network requirements and...