Sciweavers

1664 search results - page 89 / 333
» Distance labeling in graphs
Sort
View
ICCV
2003
IEEE
16 years 6 months ago
Minimally-Supervised Classification using Multiple Observation Sets
This paper discusses building complex classifiers from a single labeled example and vast number of unlabeled observation sets, each derived from observation of a single process or...
Chris Stauffer
CORR
2010
Springer
103views Education» more  CORR 2010»
15 years 4 months ago
Random Information Spread in Networks
Let G = (V, E) be an undirected loopless graph with possible parallel edges and s, t V . Assume that s is labelled at the initial time step and that every labelled vertex copies i...
Raymond Lapus, Frank Simon, Peter Tittmann
ICMCS
2007
IEEE
180views Multimedia» more  ICMCS 2007»
15 years 10 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
ICML
2007
IEEE
16 years 5 months ago
The rendezvous algorithm: multiclass semi-supervised learning with Markov random walks
We consider the problem of multiclass classification where both labeled and unlabeled data points are given. We introduce and demonstrate a new approach for estimating a distribut...
Arik Azran
GD
2005
Springer
15 years 9 months ago
Visualizing Graphs as Trees: Plant a Seed and Watch it Grow
TreePlus is a graph browsing technique based on a tree-style layout. It shows the missing graph structure using interaction techniques and enables users to start with a specific no...
Bongshin Lee, Cynthia Sims Parr, Catherine Plaisan...