Sciweavers

214 search results - page 42 / 43
» Foundations of probabilistic answers to queries
Sort
View
STOC
2007
ACM
101views Algorithms» more  STOC 2007»
14 years 7 months ago
The price of privacy and the limits of LP decoding
This work is at the intersection of two lines of research. One line, initiated by Dinur and Nissim, investigates the price, in accuracy, of protecting privacy in a statistical dat...
Cynthia Dwork, Frank McSherry, Kunal Talwar
ICSE
2005
IEEE-ACM
14 years 7 months ago
Verification and change-impact analysis of access-control policies
Sensitive data are increasingly available on-line through the Web and other distributed protocols. This heightens the need to carefully control access to data. Control means not o...
Kathi Fisler, Shriram Krishnamurthi, Leo A. Meyero...
COMPGEOM
2007
ACM
13 years 11 months ago
On approximate halfspace range counting and relative epsilon-approximations
The paper consists of two major parts. In the first part, we re-examine relative -approximations, previously studied in [12, 13, 18, 25], and their relation to certain geometric p...
Boris Aronov, Sariel Har-Peled, Micha Sharir
PODS
2005
ACM
211views Database» more  PODS 2005»
14 years 7 months ago
Join-distinct aggregate estimation over update streams
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. Pro...
Sumit Ganguly, Minos N. Garofalakis, Amit Kumar, R...
SODA
2010
ACM
704views Algorithms» more  SODA 2010»
14 years 4 months ago
A locality-sensitive hash for real vectors
We present a simple and practical algorithm for the c-approximate near neighbor problem (c-NN): given n points P Rd and radius R, build a data structure which, given q Rd , can ...
Tyler Neylon