Sciweavers

277 search results - page 37 / 56
» New results on shortest paths in three dimensions
Sort
View
GD
2004
Springer
14 years 1 months ago
Visualisation of Large and Complex Networks Using PolyPlane
This paper discusses a new method for visualisation of large and complex networks in three dimensions. In particular, we focus on visualising the core tree structure of the large a...
Seok-Hee Hong, Tom Murtagh
CVPR
2009
IEEE
14 years 2 months ago
Tubular anisotropy for 2D vessel segmentation
In this paper, we present a new approach for segmentation of tubular structures in 2D images providing minimal interaction. The main objective is to extract centerlines and bounda...
Fethallah Benmansour, Laurent D. Cohen, Max W. K. ...
COMPGEOM
2008
ACM
13 years 9 months ago
Towards persistence-based reconstruction in euclidean spaces
Manifold reconstruction has been extensively studied for the last decade or so, especially in two and three dimensions. Recent advances in higher dimensions have led to new method...
Frédéric Chazal, Steve Oudot
ASPDAC
2004
ACM
102views Hardware» more  ASPDAC 2004»
14 years 1 months ago
TranGen: a SAT-based ATPG for path-oriented transition faults
— This paper presents a SAT-based ATPG tool targeting on a path-oriented transition fault model. Under this fault model, a transition fault is detected through the longest sensit...
Kai Yang, Kwang-Ting Cheng, Li-C. Wang
NETWORKING
2007
13 years 9 months ago
Maximum Energy Welfare Routing in Wireless Sensor Networks
Most routing algorithms for sensor networks focus on finding energy efficient paths to prolong the lifetime of sensor networks. As a result, the sensors on the efficient paths are ...
Changsoo Ok, Prasenjit Mitra, Seokcheon Lee, Sound...