1883 search results - page 38 / 377 » Ordered theta graphs |
MFCS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. It is a well-known result that the set of reachable stack contents in a pushdown automaton is a regular set of words. We consider the more general case of higher-order pu...
FSTTCS
1998
Springer
13 years 12 months ago
1998
Springer
Partial order methods have been introduced to avoid the state explosion problem in veri cation resulting from the representation of multiple interleavings of concurrent transitions...
IJCV
2002
13 years 7 months ago
2002
This paper describes a new algorithm for disparity estimation using trinocular stereo. The three cameras are placed in a right angled configuration. A graph is then constructed wh...
WAOA
2004
Springer
14 years 1 months ago
2004
Springer
Borodin, Nielsen and Rackoff [5] proposed a framework for ing the main properties of greedy-like algorithms with emphasis on scheduling problems, and Davis and Impagliazzo [6] ext...
APAL
2011
13 years 2 months ago
2011
We define a new NP search problem, the “local improvement” principle, about labellings of an acyclic, bounded-degree graph. We show that, provably in PV, it characterizes the...