557 search results - page 59 / 112 » Visualizing Weighted Edges in Graphs |
108
click to vote
ICRA
2007
IEEE
15 years 9 months ago
2007
IEEE
— In this paper we propose an on-line incremental vision-based topological map learning for AIBO robots. The topological map is represented through a graph, where the vertices en...
128
click to vote
AAAI
2012
13 years 5 months ago
2012
In many dynamic matching applications—especially high-stakes ones—the competitive ratios of prior-free online algorithms are unacceptably poor. The algorithm should take distr...
106
click to vote
INFORMATICALT
2006
15 years 3 months ago
2006
In this work labeling of planar graphs is taken up which involves labeling the p vertices, the q edges and the f internal faces such that the weights of the faces form an arithmeti...
115
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
We provide linear-time algorithms for geometric graphs with sublinearly many crossings. That is, we provide algorithms running in O(n) time on connected geometric graphs having n ...
152
click to vote
STOC
2010
ACM
15 years 7 months ago
2010
ACM
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...