1664 search results - page 109 / 333 » Distance labeling in graphs |
119
click to vote
NIPS
2008
15 years 5 months 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 ...
137
click to vote
ICML
2010
IEEE
15 years 5 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...
141
click to vote
ICIP
2007
IEEE
16 years 6 months ago
2007
IEEE
This paper introduces an invoice analysis approach using CaseBased Reasoning (CBR). CBR is used to analyze and interpret new invoices thanks to the previous processing experiences...
123
click to vote
ECCV
2006
Springer
16 years 6 months ago
2006
Springer
For many medical segmentation tasks, the contrast along most of the boundary of the target object is high, allowing simple thresholding or region growing approaches to provide near...
130
click to vote
GG
2004
Springer
15 years 9 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...