674 search results - page 97 / 135 » The computational complexity of the parallel knock-out probl... |
143
click to vote
SPAA
2010
ACM
15 years 6 months ago
2010
ACM
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
109
click to vote
EDO
2000
Springer
15 years 5 months ago
2000
Springer
: Middleware technologies such as CORBA and DCOM have been developed as a means of tackling heterogeneity and complexity problems inherent in distributed systems. However, more wor...
ICPP
1999
IEEE
15 years 5 months ago
1999
IEEE
This paper presents a mesh with virtual buses as the bandwidth-efficient implementation of the mesh with multiple broadcasting on which many computational problems can be solved w...
113
click to vote
TC
2008
15 years 1 months ago
2008
Cryptanalysis of ciphers usually involves massive computations. The security parameters of cryptographic algorithms are commonly chosen so that attacks are infeasible with availabl...
104
click to vote
IPPS
2005
IEEE
15 years 7 months ago
2005
IEEE
Secret sharing algorithms have been used for intrusion tolerance, which ensure the confidentiality, integrity and availability of critical information. However, dynamically changi...