1066 search results - page 53 / 214 » Computing Private Set Operations with Linear Complexities |
PODC
2009
ACM
15 years 10 months ago
2009
ACM
Consider a completely asynchronous network consisting of n parties where every two parties are connected by a private channel. An adversary At with unbounded computing power activ...
DIS
2005
Springer
15 years 3 months ago
2005
Springer
We consider the problem of discovering the optimal pattern from a set of strings and associated numeric attribute values. The goodness of a pattern is measured by the correlation b...
CDC
2009
IEEE
15 years 2 months ago
2009
IEEE
— Given an arbitrary network of interconnected nodes, each with an initial value from a discrete set, we consider the problem of distributively disseminating these initial values...
SOSP
2007
ACM
15 years 6 months ago
2007
ACM
We propose a new paradigm for building scalable distributed systems. Our approach does not require dealing with message-passing protocols—a major complication in existing distri...
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
The use of genotypic populations is necessary for adaptation in Evolutionary Algorithms. We use a technique called form-invariant commutation to study the immediate effect of evol...