112 search results - page 21 / 23 » Rounds in Communication Complexity Revisited |
FOCS
2004
IEEE
13 years 11 months ago
2004
IEEE
We consider the approximate nearest neighbour search problem on the Hamming cube {0, 1}d. We show that a randomised cell probe algorithm that uses polynomial storage and word size...
SODA
2008
ACM
13 years 9 months ago
2008
ACM
A common approach for dealing with large data sets is to stream over the input in one pass, and perform computations using sublinear resources. For truly massive data sets, howeve...
ASIACRYPT
2001
Springer
14 years 4 days ago
2001
Springer
The aim of this article is to propose a fully distributed environment for the RSA scheme. What we have in mind is highly sensitive applications and even if we are ready to pay a pr...
ECCC
2010
13 years 6 months ago
2010
Applications based on outsourcing computation require guarantees to the data owner that the desired computation has been performed correctly by the service provider. Methods based...
ICCCN
2007
IEEE
13 years 11 months ago
2007
IEEE
Abstract-- in the current Internet, congestion control is performed jointly by the end systems running the TCP protocol and by routers running Active Queue Management (AQM) algorit...