1664 search results - page 314 / 333 » Distance labeling in graphs |
106
click to vote
INFOCOM
2011
IEEE
14 years 1 months ago
2011
IEEE
—Localizability of network or node is an important subproblem in sensor localization. While rigidity theory plays an important role in identifying several localizability conditio...
110
click to vote
SAC
2011
ACM
14 years 22 days ago
2011
ACM
Optimal Communication Spanning Tree (OCST) is a well-known NP-hard problem on the graph that seeks for the spanning tree with the lowest cost. The tree cost depends on the demand ...
CVPR
2012
IEEE
13 years 10 days ago
2012
IEEE
We study the problem of segmenting multiple cell nuclei from GFP or Hoechst stained microscope images with a shape prior. This problem is encountered ubiquitously in cell biology ...
254
click to vote
Publication
In this paper, we present a novel framework for computing centerlines for both 2D and 3D shape analysis. The framework works as follows: an object centerline point is
selected aut...
250
click to vote
Presentation
In this paper, we present a novel framework for computing centerlines for both 2D and 3D shape analysis. The framework works as follows: an object centerline point is selected auto...