583 search results - page 48 / 117 » Computing Linking Numbers of a Filtration |
185
click to vote
CVPR
1998
IEEE
16 years 8 months ago
1998
IEEE
The Euclidean skeleton is essential for general shape representation. This paper provides an e cient method to extract a well-connected Euclidean skeleton by a neighbor bisector d...
148
click to vote
HPCA
2005
IEEE
16 years 6 months ago
2005
IEEE
In this paper, we propose a new congestion management strategy for lossless multistage interconnection networks that scales as network size and/or link bandwidth increase. Instead...
136
click to vote
ACSC
2005
IEEE
15 years 11 months ago
2005
IEEE
We examine the robustness of critical infrastructure networks in the face of terrorist attack, using a simulation experiment that incorporates link capacity; and an extension of d...
162
click to vote
CCGRID
2002
IEEE
15 years 11 months ago
2002
IEEE
—Switch-trees are peer-to-peer algorithms for building and improving end-host multicast trees. Nodes switch parents to reduce tree cost or lower source-member latency. A node swi...
165
click to vote
IPPS
2002
IEEE
15 years 11 months ago
2002
IEEE
In this paper, we propose a new distributed algorithm that constructs a sparse spanner subgraph of the unit disk graph efficiently for wireless ad hoc networks. It maintains a li...