513 search results - page 35 / 103 » Soft Edge Coloring |
124
click to vote
IV
2010
IEEE
14 years 11 months ago
2010
IEEE
Visualization of graphs containing many nodes and edges efficiently is quite challenging since representations generally suffer from visual clutter induced by the large amount of...
114
click to vote
ALGORITHMICA
2006
15 years 17 days ago
2006
We consider the problem of coloring a planar graph with the minimum number of colors so that each color class avoids one or more forbidden graphs as subgraphs. We perform a detail...
124
click to vote
TVCG
2008
15 years 11 days ago
2008
Graphs have been widely used to model relationships among data. For large graphs, excessive edge crossings make the display visually cluttered and thus difficult to explore. In thi...
105
click to vote
CHI
2009
ACM
16 years 1 months ago
2009
ACM
Graphs are often visualized using node-link representations: vertices are depicted as dots, edges are depicted as (poly)lines connecting two vertices. A directed edge running from...
NIPS
2007
15 years 1 months ago
2007
We present a novel boosting algorithm, called SoftBoost, designed for sets of binary labeled examples that are not necessarily separable by convex combinations of base hypotheses....