Sciweavers

1272 search results - page 14 / 255
» Approximate Parameterized Matching
Sort
View
SIGMOD
2009
ACM
111views Database» more  SIGMOD 2009»
15 years 9 months ago
Language-model-based ranking in entity-relation graphs
We propose a language-model-based ranking approach for SPARQLlike queries on entity-relationship graphs. Our ranking model supports exact matching, approximate structure matching,...
Shady Elbassuoni, Maya Ramanath, Gerhard Weikum
MST
2007
138views more  MST 2007»
14 years 9 months ago
Parameterized Complexity of Vertex Cover Variants
Important variants of the Vertex Cover problem (among others, Connected Vertex Cover, Capacitated Vertex Cover, and Maximum Partial Vertex Cover) have been intensively studied in ...
Jiong Guo, Rolf Niedermeier, Sebastian Wernicke
ACIVS
2007
Springer
15 years 3 months ago
Colon Visualization Using Cylindrical Parameterization
Abstract. Using cylindrical parameterization, the 3D mesh surface extracted from colon CT scan images is parameterized onto a cylinder, and afterwards visualized with a modified C...
Zhenhua Mai, Toon Huysmans, Jan Sijbers
CAV
2007
Springer
122views Hardware» more  CAV 2007»
15 years 1 months ago
Parameterized Verification of Infinite-State Processes with Global Conditions
We present a simple and effective approximated backward reachability algorithm for parameterized systems with existentially and universally quantified global conditions. The indivi...
Parosh Aziz Abdulla, Giorgio Delzanno, Ahmed Rezin...
NJC
1998
86views more  NJC 1998»
14 years 9 months ago
Parametric Permutation Routing via Matchings
The problem of routing permutations on graphs via matchings is considered, and we present a general algorithm which can be parameterized by different heuristics. This leads to a ...
Peter Høyer, Kim S. Larsen