Results 1  10
of
294,453
EFFICIENT PROTOCOLS FOR COMPUTING THE OPTIMAL SWAP EDGES OF A SHORTEST PATH TREE
"... Abstract We consider the problem of computing the optimal swap edges of a shortestpath tree. This theoretical problem arises in practice in systems that offer pointoffailure shortestpath rerouting service in presence of a single link failure: if the shortest path is not affected by the failed li ..."
Abstract
 Add to MetaCart
for computing the optimal swap edges of a shortestpath tree. One algorithm uses messages containing a constant amount of information, while the other is tailored for systems that allow long messages. The amount of data transferred by the protocols is the same and depends on on the structure of the shortestpath
153 EFFICIENT PROTOCOLS FOR COMPUTING THE OPTIMAL SWAP EDGES OF A SHORTEST PATH TREE
"... Keywords: We consider the problem of computing the optimal swap edges of a shortestpath tree. This theoretical problem arises in practice in systems that offer pointoffailure shortestpath rerouting service in presence of a single link failure: if the shortest path is not affected by the failed li ..."
Abstract
 Add to MetaCart
for computing the optimal swap edges of a shortestpath tree. One algorithm uses messages containing a constant amount of information, while the other is tailored for systems that allow long messages. The amount of data transferred by the protocols is the same and depends on on the structure of the shortestpath
Finding the k Shortest Paths
, 1997
"... We give algorithms for finding the k shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our algorithms output an implicit representation of these paths in a digraph with n vertices and m edges, in time O(m + n log n + k). We can also find the k shortest pat ..."
Abstract

Cited by 401 (2 self)
 Add to MetaCart
We give algorithms for finding the k shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our algorithms output an implicit representation of these paths in a digraph with n vertices and m edges, in time O(m + n log n + k). We can also find the k shortest
Efficient protocols for computing optimal swap edges
 In Proc. of 3rd IFIP International Conference on Theoretical Computer Science (TCS
"... Abstract We consider the problem of computing the optimal swap edges of a shortestpath tree. This theoretical problem arises in practice in systems that offer pointoffailure shortestpath rerouting service in presence of a single link failure: if the shortest path is not affected by the failed lin ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
for computing the optimal swap edges of a shortestpath tree. One algorithm uses messages containing a constant amount of information, while the other is tailored for systems that allow long messages. The amount of data transferred by the protocols is the same and depends on on the structure of the shortestpath
The ubiquitous Btree
 ACM Computing Surveys
, 1979
"... Btrees have become, de facto, a standard for file organization. File indexes of users, dedicated database systems, and generalpurpose access methods have all been proposed and nnplemented using Btrees This paper reviews Btrees and shows why they have been so successful It discusses the major var ..."
Abstract

Cited by 653 (0 self)
 Add to MetaCart
Btrees have become, de facto, a standard for file organization. File indexes of users, dedicated database systems, and generalpurpose access methods have all been proposed and nnplemented using Btrees This paper reviews Btrees and shows why they have been so successful It discusses the major
An Adaptive EnergyEfficient MAC Protocol for Wireless Sensor Networks
 SENSYS'03
, 2003
"... In this paper we describe TMAC, a contentionbased Medium Access Control protocol for wireless sensor networks. Applications for these networks have some characteristics (low message rate, insensitivity to latency) that can be exploited to reduce energy consumption by introducing an active/sleep du ..."
Abstract

Cited by 526 (13 self)
 Add to MetaCart
In this paper we describe TMAC, a contentionbased Medium Access Control protocol for wireless sensor networks. Applications for these networks have some characteristics (low message rate, insensitivity to latency) that can be exploited to reduce energy consumption by introducing an active
On the Construction of EnergyEfficient Broadcast and Multicast Trees in Wireless Networks
, 2000
"... wieselthier @ itd.nrl.navy.mil nguyen @ itd.nrl.navy.mil ..."
Abstract

Cited by 554 (13 self)
 Add to MetaCart
wieselthier @ itd.nrl.navy.mil nguyen @ itd.nrl.navy.mil
Cilk: An Efficient Multithreaded Runtime System
 JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING
, 1995
"... Cilk (pronounced "silk") is a Cbased runtime system for multithreaded parallel programming. In this paper, we document the efficiency of the Cilk workstealing scheduler, both empirically and analytically. We show that on real and synthetic applications, the "work" and "cri ..."
Abstract

Cited by 750 (40 self)
 Add to MetaCart
Cilk (pronounced "silk") is a Cbased runtime system for multithreaded parallel programming. In this paper, we document the efficiency of the Cilk workstealing scheduler, both empirically and analytically. We show that on real and synthetic applications, the "work" and "criticalpath
Mtree: An Efficient Access Method for Similarity Search in Metric Spaces
, 1997
"... A new access meth d, called Mtree, is proposed to organize and search large data sets from a generic "metric space", i.e. whE4 object proximity is only defined by a distance function satisfyingth positivity, symmetry, and triangle inequality postulates. We detail algorith[ for insertion o ..."
Abstract

Cited by 652 (38 self)
 Add to MetaCart
A new access meth d, called Mtree, is proposed to organize and search large data sets from a generic "metric space", i.e. whE4 object proximity is only defined by a distance function satisfyingth positivity, symmetry, and triangle inequality postulates. We detail algorith[ for insertion
Results 1  10
of
294,453