1056 search results - page 106 / 212 » Constraint-Based Graph Matching |
ICCV
2007
IEEE
14 years 11 months ago
2007
IEEE
We present a novel method to reconstruct the 3D shape of a scene from several calibrated images. Our motivation is that most existing multi-view stereovision approaches require so...
ICRA
2005
IEEE
14 years 2 months ago
2005
IEEE
— For a mobile robot it is a natural task to build a 3D model of its environment. Such a model is not only useful for planning robot actions but also to provide a remote human su...
STOC
2010
ACM
14 years 2 months ago
2010
ACM
We combine the work of Garg and K¨onemann, and Fleischer with ideas from dynamic graph algorithms to obtain faster (1 − ε)-approximation schemes for various versions of the mu...
APPROX
2007
Springer
14 years 1 months ago
2007
Springer
We show that the multi-commodity max-flow/min-cut gap for series-parallel graphs can be as bad as 2, matching a recent upper bound [8] for this class, and resolving one side of a ...
CIE
2006
Springer
14 years 28 days ago
2006
Springer
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in the vast literature, in particular, the chromatic polynomial, various generaliz...