Sciweavers

2080 search results - page 348 / 416
» Measuring empirical computational complexity
Sort
View
TMI
2010
208views more  TMI 2010»
15 years 27 days ago
Patient-Specific Modeling and Quantification of the Aortic and Mitral Valves From 4-D Cardiac CT and TEE
As decisions in cardiology increasingly rely on non-invasive methods, fast and precise image processing tools have become a crucial component of the analysis workflow. To the best ...
Razvan Ioan Ionasec, Ingmar Voigt, Bogdan Georgesc...
VISUALIZATION
2002
IEEE
15 years 11 months ago
Fast Visualization of Plane-Like Structures in Voxel Data
We present a robust, noise-resistant criterion characterizing planelike skeletons in binary voxel objects. It is based on a distance map and the geodesic distance along the object...
Steffen Prohaska, Hans-Christian Hege
STOC
1998
ACM
112views Algorithms» more  STOC 1998»
15 years 10 months ago
Quantum Circuits with Mixed States
Current formal models for quantum computation deal only with unitary gates operating on “pure quantum states”. In these models it is difficult or impossible to deal formally w...
Dorit Aharonov, Alexei Kitaev, Noam Nisan
PPOPP
2010
ACM
16 years 21 days ago
Thread to strand binding of parallel network applications in massive multi-threaded systems
In processors with several levels of hardware resource sharing, like CMPs in which each core is an SMT, the scheduling process becomes more complex than in processors with a singl...
Petar Radojkovic, Vladimir Cakarevic, Javier Verd&...
CIBCB
2007
IEEE
16 years 16 days ago
Modeling protein-DNA binding time in Stochastic Discrete Event Simulation of Biological Processes
Abstract— This paper presents a parametric model to estimate the DNA-protein binding time using the DNA and protein structures and details of the binding site. To understand the ...
Preetam Ghosh, Samik Ghosh, Kalyan Basu, Sajal K. ...