1605 search results - page 134 / 321 » On Partitional Labelings of Graphs |
NIPS
2008
14 years 2 days ago
2008
We continue our study of online prediction of the labelling of a graph. We show a fundamental limitation of Laplacian-based algorithms: if the graph has a large diameter then the ...
ICML
2010
IEEE
13 years 11 months ago
2010
IEEE
We show that the mistake bound for predicting the nodes of an arbitrary weighted graph is characterized (up to logarithmic factors) by the cutsize of a random spanning tree of the...
GG
2004
Springer
14 years 4 months ago
2004
Springer
Abstract. Graph programs as introduced by Habel and Plump [8] provide a simple yet computationally complete language for computing functions and relations on graphs. We extend this...
COLT
2003
Springer
14 years 3 months ago
2003
Springer
Abstract. We study the problem of learning partitions using equivalence constraints as input. This is a binary classification problem in the product space of pairs of datapoints. ...
TIP
2008
13 years 10 months ago
2008
Abstract--This paper presents a new, simple, and efficient segmentation approach, based on a fusion procedure which aims at combining several segmentation maps associated to simple...