Sciweavers

760 search results - page 75 / 152
» Algorithms for finding clique-transversals of graphs
Sort
View
EACL
1993
ACL Anthology
13 years 10 months ago
Towards efficient parsing with proof-nets
This paper presents a method for parsing associative Lambek grammars based on graphtheoretic properties. Connection graphs, which are a simplified version of proof-nets, are actua...
Alain Lecomte
CVPR
2006
IEEE
14 years 11 months ago
Hierarchical Volumetric Multi-view Stereo Reconstruction of Manifold Surfaces based on Dual Graph Embedding
This paper presents a new volumetric stereo algorithm to reconstruct the 3D shape of an arbitrary object. Our method is based on finding the minimum cut in an octahedral graph str...
Alexander Hornung, Leif Kobbelt
ECCV
2008
Springer
14 years 10 months ago
Feature Correspondence Via Graph Matching: Models and Global Optimization
Abstract. In this paper we present a new approach for establishing correspondences between sparse image features related by an unknown non-rigid mapping and corrupted by clutter an...
Lorenzo Torresani, Vladimir Kolmogorov, Carsten Ro...
ICPR
2000
IEEE
14 years 10 months ago
Attributed Tree Homomorphism Using Association Graphs
The matching of hierarchical relational structures is of significant interest in computer vision and pattern recognition. We have recently introduced a new solution to this proble...
Massimo Bartoli, Marcello Pelillo, Kaleem Siddiqi,...
CLIN
2004
13 years 10 months ago
Query-Based Summarization using Rhetorical Structure Theory
Research on Question Answering is focused mainly on classifying the question type and finding the answer. Presenting the answer in a way that suits the user's needs has recei...
Wauter Bosma