Sciweavers

2100 search results - page 125 / 420
» Learning to rank on graphs
Sort
View
EJC
2007
15 years 7 months ago
The homology of the cycle matroid of a coned graph
The cone ˆG of a finite graph G is obtained by adding a new vertex p, called the cone point, and joining each vertex of G to p by a simple edge. We show that the rank of the red...
Woong Kook
ICMCS
2007
IEEE
180views Multimedia» more  ICMCS 2007»
16 years 1 months ago
Discrete Regularization for Perceptual Image Segmentation via Semi-Supervised Learning and Optimal Control
In this paper, we present a regularization approach on discrete graph spaces for perceptual image segmentation via semisupervised learning. In this approach, first, a spectral cl...
Hongwei Zheng, Olaf Hellwich
ICMCS
2009
IEEE
104views Multimedia» more  ICMCS 2009»
15 years 4 months ago
A variational multi-view learning framework and its application to image segmentation
The paper presents a novel multi-view learning framework based on variational inference. We formulate the framework as a graph representation in form of graph factorization: the g...
Zhenglong Li, Qingshan Liu, Hanqing Lu
MLG
2007
Springer
16 years 1 months ago
Learning Graph Matching
As a fundamental problem in pattern recognition, graph matching has found a variety of applications in the field of computer vision. In graph matching, patterns are modeled as gr...
Alex J. Smola
COMBINATORICA
2010
15 years 2 months ago
The homology of a locally finite graph with ends
We show that the topological cycle space of a locally finite graph is a canonical quotient of the first singular homology group of its Freudenthal compactification, and we charact...
Reinhard Diestel, Philipp Sprüssel