Sciweavers

819 search results - page 23 / 164
» Parallelization with Tree Skeletons
Sort
View
PRL
1998
152views more  PRL 1998»
13 years 8 months ago
A 3D 6-subiteration thinning algorithm for extracting medial lines
Thinning is a frequently used method for extracting skeletons in discrete spaces. This paper presents an efficient parallel Žthinning algorithm that directly extracts medial line...
Kálmán Palágyi, Attila Kuba
MICCAI
2001
Springer
14 years 27 days ago
3D+t Modeling of Coronary Artery Tree from Standard Non Simultaneous Angiograms
Abstract. 3D models of coronary arteries is a valuable help for the planning and simulation of minimally-invasive cardiac surgery, and may be used in per-operative augmented realit...
Fabien Mourgues, Frederic Devernay, Grégoir...
IPPS
2006
IEEE
14 years 2 months ago
Parallel multiple sequence alignment with local phylogeny search by simulated annealing
The problem of multiple sequence alignment is one of the most important problems in computational biology. In this paper we present a new method that simultaneously performs multi...
Jaroslaw Zola, Denis Trystram, Andrei Tchernykh, C...
ASPLOS
2012
ACM
12 years 4 months ago
Scalable address spaces using RCU balanced trees
Software developers commonly exploit multicore processors by building multithreaded software in which all threads of an application share a single address space. This shared addre...
Austin T. Clements, M. Frans Kaashoek, Nickolai Ze...
SAS
2009
Springer
175views Formal Methods» more  SAS 2009»
14 years 9 months ago
Automatic Parallelization and Optimization of Programs by Proof Rewriting
We show how, given a program and its separation logic proof, one can parallelize and optimize this program and transform its proof simultaneously to obtain a proven parallelized an...
Clément Hurlin