7379 search results - page 991 / 1476 » How Many Clusters |
175
click to vote
CADE
2008
Springer
16 years 7 months ago
2008
Springer
Tree automata completion is a technique for the verification of infinite state systems. It has already been used for the verification of cryptographic protocols and the prototyping...
188
click to vote
STOC
2004
ACM
16 years 7 months ago
2004
ACM
We prove the following inequality: for every positive integer n and every collection X1, . . . , Xn of nonnegative independent random variables that each has expectation 1, the pr...
227
click to vote
STOC
2002
ACM
16 years 7 months ago
2002
ACM
d Abstract) Ran Canetti Yehuda Lindell Rafail Ostrovsky Amit Sahai? We show how to securely realize any multi-party functionality in a universally composable way, regardless of th...
288
click to vote
VLDB
2004
ACM
16 years 7 months ago
2004
ACM
Abstract. In dynamic environments like the Web, data sources may change not only their data but also their schemas, their semantics, and their query capabilities.When a mapping is ...
258
click to vote
SIGMOD
2009
ACM
16 years 7 months ago
2009
ACM
In this paper we present a method for reasoning about privacy using the concepts of exchangeability and deFinetti's theorem. We illustrate the usefulness of this technique by...