458 search results - page 36 / 92 » Totally magic graphs |
126
Voted
DIAGRAMS
2004
Springer
15 years 7 months ago
2004
Springer
We describe a method for drawing graph-enhanced Euler diagrams using a three stage method. The first stage is to lay out the underlying Euler diagram using a multicriteria optimizi...
122
click to vote
ESA
2006
Springer
15 years 5 months ago
2006
Springer
We consider the following vertex coloring problem. We are given an undirected graph G = (V, E), where each vertex v is associated with a penalty rejection cost rv. We need to choos...
105
click to vote
IPL
2007
15 years 1 months ago
2007
Given an edge-weighted graph G = (V,E), a subset S ⊆ V , an integer k 1 and a real b 0, the minimum subpartition problem asks to find a family of k nonempty disjoint subsets X1...
140
click to vote
PAMI
2010
15 years 10 days ago
2010
—In this work, we address the problem of performing class-specific unsupervised object segmentation, i.e., automatic segmentation without annotated training images. Object segmen...
DAC
2009
ACM
16 years 2 months ago
2009
ACM
Power consumption of system-level on-chip communications is becoming more significant in the overall system-on-chip (SoC) power as technology scales down. In this paper, we propos...