4131 search results - page 90 / 827 » The Generalized Max-Controlled Set Problem |
PROVSEC
2009
Springer
15 years 9 months ago
2009
Springer
Secure set-intersection computation is one of important problems in secure multiparty computation with various applications. We propose a general construction for secure 2-party se...
121
click to vote
STACS
2007
Springer
15 years 9 months ago
2007
Springer
We study the following problem. Given a weighted planar graph G, assign labels L(v) to vertices so that given L(u), L(v) and L(x) for x ∈ X for any X ⊂ V (G), compute the dist...
126
click to vote
COORDINATION
2004
Springer
15 years 8 months ago
2004
Springer
A development environment for applications specified in an extended version of a previously developed coordination model based on associatively broadcast interactions is presented....
107
click to vote
DGCI
2000
Springer
15 years 7 months ago
2000
Springer
A generalization of a classical discrete tomography problem is considered: Reconstruct binary matrices from their absorbed row and columns sums, i.e., when some known absorption is...
131
click to vote
FOCS
1993
IEEE
15 years 7 months ago
1993
IEEE
: Weprove tight bounds on the time needed to solve k-set agreement, a natural generalization of consensus. We analyze this problem in a synchronous, message-passing model where pro...