390 search results - page 56 / 78 » Computing shortest paths for any number of hops |
232
click to vote
ICDE
2008
IEEE
16 years 3 months ago
2008
IEEE
Abstract- Data streams of real numbers are generated naturally in many applications. The technology of online subsequence searching in data streams becomes more and more important ...
111
click to vote
NSDI
2007
15 years 4 months ago
2007
Many studies show that, when Internet links go up or down, the dynamics of BGP may cause several minutes of packet loss. The loss occurs even when multiple paths between the sende...
101
click to vote
IPPS
1997
IEEE
15 years 6 months ago
1997
IEEE
In this paper, we evaluated various distributed mutual exclusion algorithms on the IBM SP2 machine and the Intel iPSC/860 system. The empirical results are compared in terms of su...
116
click to vote
IPPS
2002
IEEE
15 years 6 months ago
2002
IEEE
‘ We take advantage of the hierarchical structure of the star graph network to obtain an efficient method for constructing node-disjoint paths between arbitrary pairs of nodes in...
137
Voted
COMPGEOM
2005
ACM
15 years 3 months ago
2005
ACM
We introduce a new type of diagram called the VV(c)-diagram (the visibility–Voronoi diagram for clearance c), which is a hybrid between the visibility graph and the Voronoi diag...