4908 search results - page 915 / 982 » On the Complexity of Optimal K-Anonymity |
104
click to vote
CADE
2005
Springer
16 years 5 days ago
2005
Springer
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
117
click to vote
STOC
2004
ACM
16 years 4 days ago
2004
ACM
A collaborative filtering system at an e-commerce site or similar service uses data about aggregate user behavior to make recommendations tailored to specific user interests. We d...
106
click to vote
STOC
2004
ACM
16 years 4 days ago
2004
ACM
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
111
click to vote
OSDI
2006
ACM
16 years 4 days ago
2006
ACM
Operating systems are complex and their behavior depends on many factors. Source code, if available, does not directly help one to understand the OS's behavior, as the behavi...
194
click to vote
VLDB
2007
ACM
16 years 2 days ago
2007
ACM
We propose XRPC, a minimal XQuery extension that enables distributed yet efficient querying of heterogeneous XQuery data sources. XRPC enhances the existing concept of XQuery func...