483 search results - page 22 / 97 » On perfectness of sums of graphs |
CRYPTO
2006
Springer
15 years 2 months ago
2006
Springer
Abstract. The problem of perfectly secure message transmission concerns two synchronized non-faulty processors sender (S) and receiver (R) that are connected by a synchronous netwo...
ACISP
2007
Springer
15 years 2 months ago
2007
Springer
This paper studies the interplay of network connectivity and perfectly secure message transmission under the corrupting influence of a Byzantine mobile adversary that may move from...
CORR
2006
Springer
14 years 10 months ago
2006
Springer
We show that the number of k-matching in a given undirected graph G is equal to the number of perfect matching of the corresponding graph Gk on an even number of vertices divided ...
IPPS
2009
IEEE
15 years 5 months ago
2009
IEEE
We investigate the problem of converting sets of sensors into strongly connected networks of sensors using multiple directional antennae. Consider a set S of n points in the plane...
105
click to vote
NIPS
2007
15 years 2 days ago
2007
We consider the estimation problem in Gaussian graphical models with arbitrary structure. We analyze the Embedded Trees algorithm, which solves a sequence of problems on tractable...