68 search results - page 4 / 14 » TALE: A Tool for Approximate Large Graph Matching |
SIGMOD
2011
ACM
12 years 10 months ago
2011
ACM
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
SMI
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract In this paper, we study the problem of approximate topological matching for quadrilateral meshes, that is, the problem of finding as large a set as possible of matching p...
ICCV
2007
IEEE
14 years 9 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...
PAMI
2007
13 years 7 months ago
2007
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
SODA
2001
ACM
13 years 9 months ago
2001
ACM
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...