Sciweavers

1658 search results - page 42 / 332
» Learning Unknown Graphs
Sort
View
ICML
2006
IEEE
16 years 2 months ago
Estimating relatedness via data compression
We show that it is possible to use data compression on independently obtained hypotheses from various tasks to algorithmically provide guarantees that the tasks are sufficiently r...
Brendan Juba
STOC
1990
ACM
135views Algorithms» more  STOC 1990»
15 years 6 months ago
A Separator Theorem for Graphs with an Excluded Minor and its Applications
ions (Extended Abstract) Noga Alon Paul Seymour Robin Thomas Let G be an n-vertex graph with nonnegative weights whose sum is 1 assigned to its vertices, and with no minor isomorp...
Noga Alon, Paul D. Seymour, Robin Thomas
ICMCS
2009
IEEE
104views Multimedia» more  ICMCS 2009»
14 years 11 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
15 years 8 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
14 years 9 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