1664 search results - page 153 / 333 » Distance labeling in graphs |
148
click to vote
NIPS
2004
15 years 6 months ago
2004
This paper presents an application of Boosting for classifying labeled graphs, general structures for modeling a number of real-world data, such as chemical compounds, natural lan...
167
click to vote
NIPS
2004
15 years 6 months ago
2004
We present an algorithm based on convex optimization for constructing kernels for semi-supervised learning. The kernel matrices are derived from the spectral decomposition of grap...
174
click to vote
CVPR
2008
IEEE
15 years 4 months ago
2008
IEEE
In this work, video segmentation is viewed as an efficient intra-frame grouping temporally reinforced by a strong inter-frame coherence. Traditional approaches simply regard pixel...
158
click to vote
ACSC
2005
IEEE
15 years 10 months ago
2005
IEEE
A k-separated matching in a graph is a set of edges at distance at least k from one another (hence, for instance, a 1-separated matching is just a matching in the classical sense)...
142
click to vote
GD
2003
Springer
15 years 10 months ago
2003
Springer
We introduce an energy model whose minimum energy drawings reveal the clusters of the drawn graph. Here a cluster is a set of nodes with many internal edges and few edges to nodes ...