Sciweavers

1361 search results - page 222 / 273
» Skeletonization of Digital Objects
Sort
View
FSTTCS
2010
Springer
14 years 10 months ago
Satisfiability of Acyclic and Almost Acyclic CNF Formulas
We study the propositional satisfiability problem (SAT) on classes of CNF formulas (formulas in Conjunctive Normal Form) that obey certain structural restrictions in terms of thei...
Sebastian Ordyniak, Daniël Paulusma, Stefan S...
WCET
2010
14 years 9 months ago
A Code Policy Guaranteeing Fully Automated Path Analysis
Calculating the worst-case execution time (WCET) of real-time tasks is still a tedious job. Programmers are required to provide additional information on the program flow, analyzi...
Benedikt Huber, Peter P. Puschner
APVIS
2009
14 years 9 months ago
Contextual picking of volumetric structures
This paper presents a novel method for the interactive identification of contextual interest points within volumetric data by picking on a direct volume rendered image. In clinica...
Peter Kohlmann, Stefan Bruckner, Armin Kanitsar, M...
ICCV
2009
IEEE
14 years 9 months ago
Local distance functions: A taxonomy, new algorithms, and an evaluation
We present a taxonomy for local distance functions where most existing algorithms can be regarded as approximations of the geodesic distance defined by a metric tensor. We categor...
Deva Ramanan, Simon Baker
FSTTCS
2010
Springer
14 years 9 months ago
The Complexity of Model Checking (Collapsible) Higher-Order Pushdown Systems
We study (collapsible) higher-order pushdown systems -- theoretically robust and well-studied models of higher-order programs -- along with their natural subclass called (collapsi...
Matthew Hague, Anthony Widjaja To