Sciweavers

162 search results - page 8 / 33
» Structural Matching Via Optimal Basis Graphs
Sort
View
PAMI
2007
176views more  PAMI 2007»
13 years 10 months ago
Approximate Labeling via Graph Cuts Based on Linear Programming
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 ...
Nikos Komodakis, Georgios Tziritas
PAMI
1998
107views more  PAMI 1998»
13 years 10 months ago
Graph Matching With a Dual-Step EM Algorithm
—This paper describes a new approach to matching geometric structure in 2D point-sets. The novel feature is to unify the tasks of estimating transformation geometry and identifyi...
Andrew D. J. Cross, Edwin R. Hancock
SEMWEB
2009
Springer
14 years 3 months ago
DOGMA: A Disk-Oriented Graph Matching Algorithm for RDF Databases
RDF is an increasingly important paradigm for the representation of information on the Web. As RDF databases increase in size to approach tens of millions of triples, and as sophis...
Matthias Bröcheler, Andrea Pugliese, V. S. Su...
IPPS
2000
IEEE
14 years 2 months ago
Bandwidth-Efficient Collective Communication for Clustered Wide Area Systems
Metacomputing infrastructures couple multiple clusters (or MPPs) via wide-area networks. A major problem in programming parallel applications for such platforms is their hierarchi...
Thilo Kielmann, Henri E. Bal, Sergei Gorlatch
ACCV
2010
Springer
13 years 6 months ago
Learning Image Structures for Optimizing Disparity Estimation
We present a method for optimizing the stereo matching process when it is applied to a series of images with similar depth structures. We observe that there are similar regions wit...
M. V. Rohith, Chandra Kambhamettu