Sciweavers

1321 search results - page 7 / 265
» Quadratic forms on graphs
Sort
View
GBRPR
2007
Springer
14 years 1 months ago
A Quadratic Programming Approach to the Graph Edit Distance Problem
In this paper we propose a quadratic programming approach to computing the edit distance of graphs. Whereas the standard edit distance is defined with respect to a minimum-cost ed...
Michel Neuhaus, Horst Bunke
ICVGIP
2004
13 years 9 months ago
Improved Cut-Based Foreground Identification
Automatic content based schemes, as opposed to those with human endeavor, have become important as users attempt to organize massive data presented in the form of multimedia data ...
Sharat Chandran, Satwik Hebbar, Vishal Mamania, Ab...
MP
2008
81views more  MP 2008»
13 years 7 months ago
An inexact primal-dual path following algorithm for convex quadratic SDP
Abstract We propose primal-dual path-following Mehrotra-type predictorcorrector methods for solving convex quadratic semidefinite programming (QSDP) problems of the form: minX{1 2 ...
Kim-Chuan Toh
CVPR
2012
IEEE
11 years 10 months ago
Maximum weight cliques with mutex constraints for video object segmentation
In this paper, we address the problem of video object segmentation, which is to automatically identify the primary object and segment the object out in every frame. We propose a n...
Tianyang Ma, Longin Jan Latecki
BPM
2010
Springer
126views Business» more  BPM 2010»
13 years 5 months ago
Symbolic Execution of Acyclic Workflow Graphs
Abstract. We propose a new technique to analyze the control-flow, i.e., the workflow graph of a business process model, which we call symbolic execution. We consider acyclic workfl...
Cédric Favre, Hagen Völzer