1664 search results - page 75 / 333 » Distance labeling in graphs |
161
click to vote
ICMCS
2010
IEEE
15 years 5 months ago
2010
IEEE
Labeling persons appearing in video frames with names detected from the video transcript helps improving the video content identification and search task. We develop a face naming...
159
click to vote
CORR
2010
Springer
15 years 23 days ago
2010
Springer
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper ...
130
click to vote
ECAI
2008
Springer
15 years 5 months ago
2008
Springer
We extend the resistance distance kernel to the domain of signed dissimilarity values, and show how it can be applied to collaborative rating prediction. The resistance distance is...
159
click to vote
GC
2008
Springer
15 years 4 months ago
2008
Springer
An acyclic coloring of a graph G is a proper coloring of the vertex set of G such that G contains no bichromatic cycles. The acyclic chromatic number of a graph G is the minimum nu...
143
click to vote
SIAMDM
2010
14 years 10 months ago
2010
We consider the problem of finding obnoxious centers in graphs. For arbitrary graphs with n vertices and m edges, we give a randomized algorithm with O(n log2 n + m log n) expecte...