560 search results - page 10 / 112 » Multiplication by a Constant is Sublinear |
147
Voted
STACS
2007
Springer
15 years 9 months ago
2007
Springer
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
141
Voted
STACS
2009
Springer
15 years 10 months ago
2009
Springer
Motivated by the quantum algorithm for testing commutativity of black-box groups (Magniez and Nayak, 2007), we study the following problem: Given a black-box finite ring by an add...
139
Voted
ISAAC
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. We study the problem of maintaining a (1+ )-factor approximation of the diameter of a stream of points under the sliding window model. In one dimension, we give a simple ...
121
Voted
EUROCRYPT
2006
Springer
15 years 7 months ago
2006
Springer
We construct a fully collusion resistant tracing traitors system with sublinear size ciphertexts and constant size private keys. More precisely, let N be the total number of users...
138
click to vote
CRYPTO
2001
Springer
15 years 8 months ago
2001
Springer
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...