2168 search results - page 390 / 434 » Randomized Algorithms and Complexity Theory |
105
Voted
ICFP
2010
ACM
15 years 3 months ago
2010
ACM
We want assurances that sensitive information will not be disclosed when aggregate data derived from a database is published. Differential privacy offers a strong statistical guar...
148
Voted
PR
2008
15 years 1 months ago
2008
The randomness of iris pattern makes it one of the most reliable biometric traits. On the other hand, the complex iris image structure and the various sources of intra-class varia...
129
Voted
IACR
2011
14 years 2 months ago
2011
In this paper, we study the complexity of secure multiparty computation using only the secure arithmetic black-box of a finite field, counting the cost by the number of secure m...
131
Voted
STACS
2010
Springer
15 years 9 months ago
2010
Springer
One-counter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CT...
120
Voted
PODS
2010
ACM
15 years 7 months ago
2010
ACM
The notion of certain answers arises when one queries incompletely specified databases, e.g., in data integration and exchange scenarios, or databases with missing information. W...