185 search results - page 13 / 37 » Solving problems on recursively constructed graphs |
ISOLA
2010
Springer
14 years 7 months ago
2010
Springer
We give a detailed construction of a finite-state transition system for a com-connected Message Sequence Graph. Though this result is fairly well-known in the literature there has...
66
Voted
ACCV
2010
Springer
14 years 4 months ago
2010
Springer
The Viewing Graph [1] represents several views linked by the corresponding fundamental matrices, estimated pairwise. Given a Viewing Graph, the tuples of consistent camera matrices...
CORR
2006
Springer
14 years 9 months ago
2006
Springer
John McCleary insisted in his interesting textbook entitled "User's guide to spectral sequences" on the fact that the tool "spectral sequence" is not in t...
REX
1991
15 years 1 months ago
1991
Abstract. We consider an optimal-reachability problem for a timed automaton with respect to a linear cost function which results in a weighted timed automaton. Our solution to this...
SIAMCOMP
2000
14 years 9 months ago
2000
There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in Rd. t-spanners are Euclidean graphs in whic...