Sciweavers

5244 search results - page 995 / 1049
» When are two algorithms the same
Sort
View
STOC
2007
ACM
136views Algorithms» more  STOC 2007»
14 years 9 months ago
Exponential separations for one-way quantum communication complexity, with applications to cryptography
We give an exponential separation between one-way quantum and classical communication protocols for two partial Boolean functions, both of which are variants of the Boolean Hidden...
Dmitry Gavinsky, Julia Kempe, Iordanis Kerenidis, ...
STOC
2005
ACM
112views Algorithms» more  STOC 2005»
14 years 9 months ago
Covert two-party computation
We introduce the novel concept of covert two-party computation. Whereas ordinary secure two-party computation only guarantees that no more knowledge is leaked about the inputs of t...
Luis von Ahn, Nicholas J. Hopper, John Langford
SIGMOD
2001
ACM
124views Database» more  SIGMOD 2001»
14 years 9 months ago
Query Optimization In Compressed Database Systems
Over the last decades, improvements in CPU speed have outpaced improvements in main memory and disk access rates by orders of magnitude, enabling the use of data compression techn...
Zhiyuan Chen, Johannes Gehrke, Flip Korn
EDBT
2008
ACM
111views Database» more  EDBT 2008»
14 years 9 months ago
Micro-aggregation-based heuristics for p-sensitive k-anonymity: one step beyond
Micro-data protection is a hot topic in the field of Statistical Disclosure Control (SDC), that has gained special interest after the disclosure of 658000 queries by the AOL searc...
Agusti Solanas, Francesc Sebé, Josep Doming...
SODA
2010
ACM
177views Algorithms» more  SODA 2010»
14 years 6 months ago
Convergence, Stability, and Discrete Approximation of Laplace Spectra
Spectral methods have been widely used in a broad range of application fields. One important object involved in such methods is the Laplace-Beltrami operator of a manifold. Indeed...
Tamal K. Dey, Pawas Ranjan, Yusu Wang