Sciweavers

374 search results - page 37 / 75
» Stochastic Minority on Graphs
Sort
View
3DPH
2009
190views Healthcare» more  3DPH 2009»
13 years 11 months ago
Vessels-Cut: A Graph Based Approach to Patient-Specific Carotid Arteries Modeling
We present a nearly automatic graph-based segmentation method for patient specific modeling of the aortic arch and carotid arteries from CTA scans for interventional radiology simu...
Moti Freiman, Noah Broide, Miriam Natanzon, Einav ...
ICPR
2010
IEEE
13 years 10 months ago
Approximate Belief Propagation by Hierarchical Averaging of Outgoing Messages
Abstract—This paper presents an approximate belief propagation algorithm that replaces outgoing messages from a node with the averaged outgoing message and propagates messages fr...
Koichi Ogawara
COMBINATORICS
2002
87views more  COMBINATORICS 2002»
13 years 9 months ago
Map Genus, Forbidden Maps, and Monadic Second-Order Logic
A map is a graph equipped with a circular order of edges around each vertex. These circular orders represent local planar embeddings. The genus of a map is the minimal genus of an...
Bruno Courcelle, V. Dussaux
FOCS
2008
IEEE
14 years 4 months ago
Some Results on Greedy Embeddings in Metric Spaces
Geographic Routing is a family of routing algorithms that uses geographic point locations as addresses for the purposes of routing. Such routing algorithms have proven to be both ...
Ankur Moitra, Tom Leighton
DICS
2006
14 years 1 months ago
Fault-Tolerant Parallel Applications with Dynamic Parallel Schedules: A Programmer's Perspective
Dynamic Parallel Schedules (DPS) is a flow graph based framework for developing parallel applications on clusters of workstations. The DPS flow graph execution model enables automa...
Sebastian Gerlach, Basile Schaeli, Roger D. Hersch