61 search results - page 11 / 13 » On Linear Secret Sharing for Connectivity in Directed Graphs |
INFOCOM
2008
IEEE
14 years 1 months ago
2008
IEEE
—We introduce the concepts of monitoring paths (MPs) and monitoring cycles (MCs) for unique localization of shared risk linked group (SRLG) failures in all-optical networks. An S...
IPPS
2006
IEEE
14 years 1 months ago
2006
IEEE
In this paper an analysis of a dynamically reconfigurable processor is presented. The network processor incorporates a processor and a number of coprocessors that can be connected...
ESA
2010
Springer
13 years 8 months ago
2010
Springer
We show how to route on very large public transportation networks (up to half a billion arcs) with average query times of a few milliseconds. We take into account many realistic fe...
FOCS
2008
IEEE
14 years 1 months ago
2008
IEEE
We present a distributed clock synchronization algorithm that guarantees an exponentially improved bound of O(log D) on the clock skew between neighboring nodes in any graph G of ...
ICWS
2008
IEEE
13 years 8 months ago
2008
IEEE
Service-oriented computing (SOC) has emerged as the eminent market environment for sharing and reusing service-centric capabilities. The underpinning for an organization's us...