Sciweavers

1859 search results - page 58 / 372
» Sketch-based path design
Sort
View
MICCAI
2009
Springer
14 years 1 months ago
Bayesian Maximal Paths for Coronary Artery Segmentation from 3D CT Angiograms
We propose a recursive Bayesian model for the delineation of coronary arteries from 3D CT angiograms (cardiac CTA) and discuss the use of discrete minimal path techniques as an eļ¬...
David Lesage, Elsa D. Angelini, Isabelle Bloch, Ga...
ACISP
2007
Springer
14 years 1 months ago
A New Strategy for Finding a Differential Path of SHA-1
In this paper, we propose a new construction algorithm for finding differential paths of Round 1 of SHA-1 for use in the collision search attack. Generally, the differential path o...
Jun Yajima, Yu Sasaki, Yusuke Naito, Terutoshi Iwa...
GRAPHICSINTERFACE
2007
13 years 10 months ago
Point-based stream surfaces and path surfaces
We introduce a point-based algorithm for computing and rendering stream surfaces and path surfaces of a 3D ļ¬‚ow. The points are generated by particle tracing, and an even distrib...
Tobias Schafhitzel, Eduardo Tejada, Daniel Weiskop...
COMCOM
2007
99views more  COMCOM 2007»
13 years 9 months ago
Topology-aware overlay path probing
Path probing is essential to maintaining an eļ¬ƒcient overlay network topology. However, the cost of a full-scale probing is as high as O(n2 ), which is prohibitive in large-scale...
Chiping Tang, Philip K. McKinley
WALCOM
2010
IEEE
260views Algorithms» more  WALCOM 2010»
13 years 7 months ago
Constant-Work-Space Algorithm for a Shortest Path in a Simple Polygon
We present two space-eļ¬ƒcient algorithms. First, we show how to report a simple path between two arbitrary nodes in a given tree. Using a technique called ā€œcomputing instead of ...
Tetsuo Asano, Wolfgang Mulzer, Yajun Wang