Sciweavers

4074 search results - page 404 / 815
» Abstract Graph Transformation
Sort
View
MST
2010
107views more  MST 2010»
15 years 5 months ago
Fixed-Parameter Algorithms for Cluster Vertex Deletion
We initiate the first systematic study of the NP-hard Cluster Vertex Deletion (CVD) problem (unweighted and weighted) in terms of fixed-parameter algorithmics. In the unweighted...
Falk Hüffner, Christian Komusiewicz, Hannes M...
194
Voted
TCS
2010
15 years 5 months ago
Translating propositional extended conjunctions of Horn clauses into Boolean circuits
Horn⊃ is a logic programming language which extends usual Horn clauses by adding intuitionistic implication in goals and clause bodies. This extension can be seen as a form of s...
Joxe Gaintzarain, Montserrat Hermo, Paqui Lucio, M...
ICCV
2011
IEEE
14 years 6 months ago
Robust Topological Features for Deformation Invariant Image Matching
Local photometric descriptors are a crucial low level component of numerous computer vision algorithms. In practice, these descriptors are constructed to be invariant to a class o...
Edgar Lobaton, Ramanarayan Vasudevan, Ron Alterovi...
CVPR
2000
IEEE
16 years 8 months ago
Fixed Topology Skeletons
In this paper, we present a novel approach to robust skeleton extraction. We use undirected graphs to model connectivity of the skeleton points. The graph topology remains unchang...
Polina Golland, W. Eric L. Grimson
ICCV
2007
IEEE
16 years 8 months ago
Globally Optimal Image Segmentation with an Elastic Shape Prior
So far global optimization techniques have been developed independently for the tasks of shape matching and image segmentation. In this paper we show that both tasks can in fact b...
Thomas Schoenemann, Daniel Cremers