2877 search results - page 47 / 576 » The Complexity of Planarity Testing |
APLAS
2008
ACM
13 years 11 months ago
2008
ACM
Abstract. We study the problem of generating a test sequence that achieves maximal coverage for a reactive system under test. We formulate the problem as a repeated game between th...
COMGEO
2010
ACM
13 years 9 months ago
2010
ACM
We study the complexity and the I/O-efficient computation of flow on triangulated terrains. We present an acyclic graph, the descent graph, that enables us to trace flow paths in ...
DNA
2006
Springer
14 years 21 days ago
2006
Springer
We study the complexity of the Accretive Graph Assembly Problem (AGAP). An instance of AGAP consists of an edge-weighted graph G, a seed vertex in G, and a temperature . The goal i...
ECCV
1998
Springer
14 years 1 months ago
1998
Springer
This paper investigates the linear degeneracies of projective structure estimation from point and line features across three views. We show that the rank of the linear system of e...
SODA
2008
ACM
13 years 10 months ago
2008
ACM
We introduce a new feature size for bounded domains in the plane endowed with an intrinsic metric. Given a point x in a domain X, the homotopy feature size of X at x measures half...