Sciweavers

42 search results - page 6 / 9
» Classes of Submodular Constraints Expressible by Graph Cuts
Sort
View
CORR
2011
Springer
215views Education» more  CORR 2011»
12 years 11 months ago
Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Quadratic Integer Programming with PSD Objectives
We present an approximation scheme for optimizing certain Quadratic Integer Programming problems with positive semidefinite objective functions and global linear constraints. Thi...
Venkatesan Guruswami, Ali Kemal Sinop
CP
2000
Springer
13 years 11 months ago
A Language for Audiovisual Template Specification and Recognition
We address the issue of detecting automatically occurrences of high level patterns in audiovisual documents. These patterns correspond to recurring sequences of shots, which are co...
Jean Carrive, Pierre Roy, François Pachet, ...
IJCV
2012
11 years 9 months ago
Minimizing Energies with Hierarchical Costs
Abstract Computer vision is full of problems elegantly expressed in terms of energy minimization. We characterize a class of energies with hierarchical costs and propose a novel hi...
Andrew Delong, Lena Gorelick, Olga Veksler, Yuri B...
MSCS
2007
91views more  MSCS 2007»
13 years 6 months ago
A rewriting calculus for cyclic higher-order term graphs
Introduced at the end of the nineties, the Rewriting Calculus (ρ-calculus, for short) is a simple calculus that fully integrates term-rewriting and λ-calculus. The rewrite rules...
Paolo Baldan, Clara Bertolissi, Horatiu Cirstea, C...
ICML
2005
IEEE
14 years 8 months ago
Semi-supervised graph clustering: a kernel approach
Semi-supervised clustering algorithms aim to improve clustering results using limited supervision. The supervision is generally given as pairwise constraints; such constraints are...
Brian Kulis, Sugato Basu, Inderjit S. Dhillon, Ray...