289 search results - page 15 / 58 » A Framework for Visualising Large Graphs |
BMCBI
2008
14 years 12 months ago
2008
Background: Graphs and networks are common analysis representations for biological systems. Many traditional graph algorithms such as k-clique, k-coloring, and subgraph matching h...
JCP
2008
14 years 11 months ago
2008
Fault detection in large-scale systems is conducted by the use of sensors, thus the sensor location influences the performances of fault detection directly. As the scale of systems...
CVPR
2007
IEEE
16 years 1 months ago
2007
IEEE
Many vision tasks are posed as either graph partitioning (coloring) or graph matching (correspondence) problems. The former include segmentation and grouping, and the latter inclu...
116
click to vote
CORR
2010
Springer
14 years 12 months ago
2010
Springer
We continue the line of research on graph compression started in [BV04], but we move our focus to the compression of social networks in a proper sense (e.g., LiveJournal): the app...
123
click to vote
IPCO
2008
15 years 1 months ago
2008
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...