1066 search results - page 53 / 214 » Computing Private Set Operations with Linear Complexities |
156
click to vote
PODC
2009
ACM
16 years 6 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...
149
click to vote
DIS
2005
Springer
15 years 11 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...
131
click to vote
CDC
2009
IEEE
15 years 10 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...
185
click to vote
SOSP
2007
ACM
16 years 2 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...
140
click to vote
GECCO
2006
Springer
15 years 9 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...