83 search results - page 5 / 17 » Two techniques for fast computation of constrained shortest ... |
ICDE
2012
IEEE
11 years 10 months ago
2012
IEEE
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
CVPR
2006
IEEE
14 years 9 months ago
2006
IEEE
We propose a novel, fast and robust technique for the computation of anatomical connectivity in the brain. Our approach exploits the information provided by Diffusion Tensor Magne...
WSDM
2010
ACM
14 years 4 months ago
2010
ACM
We study the fundamental problem of computing distances between nodes in large graphs such as the web graph and social networks. Our objective is to be able to answer distance que...
CIAC
2000
Springer
13 years 11 months ago
2000
Springer
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
HPCA
1998
IEEE
13 years 11 months ago
1998
IEEE
We propose and evaluate two complementary techniques to protect and virtualize a tightly-coupled network interface in a multicomputer. The techniques allow efficient, direct appli...