Sciweavers

5114 search results - page 67 / 1023
» Complex networks
Sort
View
SOFSEM
2009
Springer
14 years 6 months ago
The Shortcut Problem - Complexity and Approximation
During the last years, speed-up techniques for DIJKSTRA’s algorithm have been developed that make the computation of shortest paths a matter of microseconds even on huge road net...
Reinhard Bauer, Gianlorenzo D'Angelo, Daniel Delli...
SAC
2009
ACM
14 years 3 months ago
On the practical importance of communication complexity for secure multi-party computation protocols
Many advancements in the area of Secure Multi-Party Computation (SMC) protocols use improvements in communication complexity as a justification. We conducted an experimental stud...
Florian Kerschbaum, Daniel Dahlmeier, Axel Schr&ou...
SSS
2009
Springer
115views Control Systems» more  SSS 2009»
14 years 1 months ago
How to Improve Snap-Stabilizing Point-to-Point Communication Space Complexity?
A snap-stabilizing protocol, starting from any configuration, always behaves according to its specification. In this paper, we are interested in message forwarding problem in a m...
Alain Cournier, Swan Dubois, Vincent Villain
ICC
2009
IEEE
107views Communications» more  ICC 2009»
14 years 3 months ago
Towards a Denial-of-Service Resilient Design of Complex IPsec Overlays
— By monitoring the exchanged IPsec traffic an adversary can usually easily discover the layout of virtual private networks (VPNs). Of even worse extend is the disclosure if com...
Michael Brinkmeier, Michael Rossberg, Guenter Scha...
RSFDGRC
2005
Springer
134views Data Mining» more  RSFDGRC 2005»
14 years 2 months ago
The Computational Complexity of Inference Using Rough Set Flow Graphs
Pawlak recently introduced rough set flow graphs (RSFGs) as a graphical framework for reasoning from data. Each rule is associated with three coefficients, which have been shown t...
Cory J. Butz, Wen Yan, Boting Yang