289 search results - page 27 / 58 » A Framework for Visualising Large Graphs |
WIOPT
2010
IEEE
14 years 10 months ago
2010
IEEE
—K-shell (or k-core) graph decomposition methods were introduced as a tool for studying the structure of large graphs. K-shell decomposition methods have been recently proposed [...
IROS
2007
IEEE
15 years 6 months ago
2007
IEEE
— This paper presents a hybrid localization scheme for a mobile robot using the hierarchical atlas. The hierarchical atlas is a map that consists of a higher level topological gr...
ICVGIP
2004
15 years 1 months ago
2004
Automatic content based schemes, as opposed to those with human endeavor, have become important as users attempt to organize massive data presented in the form of multimedia data ...
219
click to vote
SDM
2011
SIAM
14 years 2 months ago
2011
SIAM
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
102
click to vote
UAI
2004
15 years 1 months ago
2004
Based on a recent development in the area of error control coding, we introduce the notion of convolutional factor graphs (CFGs) as a new class of probabilistic graphical models. ...