Sciweavers

876 search results - page 70 / 176
» New Results for the Martin Polynomial
Sort
View
LICS
2009
IEEE
14 years 3 months ago
An Exponential Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know it
This paper presents a new lower bound for the discrete strategy improvement algorithm for solving parity games due to V¨oge and Jurdzi´nski. First, we informally show which stru...
Oliver Friedmann
FUN
2007
Springer
78views Algorithms» more  FUN 2007»
14 years 2 months ago
Wooden Geometric Puzzles: Design and Hardness Proofs
We discuss some new geometric puzzles and the complexity of their extension to arbitrary sizes. For gate puzzles and two-layer puzzles we prove NP-completeness of solving them. No...
Helmut Alt, Hans L. Bodlaender, Marc J. van Krevel...
WABI
2007
Springer
14 years 2 months ago
A Graph Clustering Approach to Weak Motif Recognition
The aim of the motif recognition problem is to detect a set of mutually similar subsequences within a collection of biological sequences. The weak motif recognition problem on DNA ...
Christina Boucher, Daniel G. Brown, Paul Church
DAGM
2004
Springer
14 years 2 months ago
Estimation of Multiple Orientations at Corners and Junctions
Abstract. Features like junctions and corners are a rich source of information for image understanding. We present a novel theoretical framework for the analysis of such 2D feature...
Cicero Mota, Ingo Stuke, Til Aach, Erhardt Barth
HYBRID
2004
Springer
14 years 2 months ago
Constructing Invariants for Hybrid Systems
Abstract. An invariant of a system is a predicate that holds for every reachable state. In this paper, we present techniques to generate invariants for hybrid systems. This is achi...
Sriram Sankaranarayanan, Henny Sipma, Zohar Manna