1056 search results - page 106 / 212 » Constraint-Based Graph Matching |
195
click to vote
ICCV
2007
IEEE
16 years 8 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...
167
click to vote
ICRA
2005
IEEE
15 years 12 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...
160
click to vote
STOC
2010
ACM
15 years 11 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...
150
click to vote
APPROX
2007
Springer
15 years 10 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 ...
193
click to vote
CIE
2006
Springer
15 years 10 months 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...