126 search results - page 7 / 26 » Consistent graph layout for weighted graphs |
ICTCS
2005
Springer
14 years 1 months ago
2005
Springer
Given a vertex-weighted graph G = (V, E; w), w(v) ≥ 0 for any v ∈ V , we consider a weighted version of the coloring problem which consists in finding a partition S = (S1, . ...
191
click to vote
CVPR
2012
IEEE
11 years 10 months ago
2012
IEEE
A novel approach for event summarization and rare event detection is proposed. Unlike conventional methods that deal with event summarization and rare event detection independently...
MP
1998
13 years 8 months ago
1998
In this paper we consider the problem of ^-partitioning the nodes of a graph with capacity restrictions on the sum of the node weights in each subset of the partition, and the obje...
ICSM
2005
IEEE
14 years 2 months ago
2005
IEEE
Clustering layouts of software systems combine two important aspects: they reveal groups of related artifacts of the software system, and they produce a visualization of the resul...
ICML
2009
IEEE
14 years 9 months ago
2009
IEEE
Graph based semi-supervised learning (SSL) methods play an increasingly important role in practical machine learning systems. A crucial step in graph based SSL methods is the conv...