315 search results - page 6 / 63 » Algebraic Lower Bounds for Computing on Encrypted Data |
CRYPTO
2008
Springer
14 years 11 months ago
2008
Springer
In this work we study the design of secure protocols for linear algebra problems. All current solutions to the problem are either inefficient in terms of communication complexity o...
ICDM
2006
IEEE
15 years 3 months ago
2006
IEEE
The k-means algorithm is a popular clustering method used in many different fields of computer science, such as data mining, machine learning and information retrieval. However, ...
85
Voted
FOCS
2006
IEEE
15 years 3 months ago
2006
IEEE
We convert cell-probe lower bounds for polynomial space into stronger lower bounds for near-linear space. Our technique applies to any lower bound proved through the richness meth...
FOCS
2008
IEEE
15 years 3 months ago
2008
IEEE
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
ICALP
2005
Springer
15 years 3 months ago
2005
Springer
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...