Sciweavers

605 search results - page 82 / 121
» Constrained Graph Layout
Sort
View
SIAMDM
2008
139views more  SIAMDM 2008»
13 years 9 months ago
Approximate Integer Decompositions for Undirected Network Design Problems
A well-known theorem of Nash-Williams and Tutte gives a necessary and sufficient condition for the existence of k edge-disjoint spanning trees in an undirected graph. A corollary o...
Chandra Chekuri, F. Bruce Shepherd
CVPR
2010
IEEE
14 years 6 months ago
Collect-Cut: Segmentation with Top-Down Cues Discovered in Multi-Object Images
We present a method to segment a collection of unlabeled images while exploiting automatically discovered appearance patterns shared between them. Given an unlabeled pool of multi...
Yong Jae Lee, Kristen Grauman
ICCAD
1999
IEEE
120views Hardware» more  ICCAD 1999»
14 years 2 months ago
Regularity extraction via clan-based structural circuit decomposition
Identifying repeating structural regularities in circuits allows the minimization of synthesis, optimization, and layout e orts. We introduce in this paper a novel method for ident...
Soha Hassoun, Carolyn McCreary
ICS
1989
Tsinghua U.
14 years 1 months ago
Control flow optimization for supercomputer scalar processing
Control intensive scalar programs pose a very different challenge to highly pipelined supercomputers than vectorizable numeric applications. Function call/return and branch instru...
Pohua P. Chang, Wen-mei W. Hwu
WWW
2011
ACM
13 years 4 months ago
OntoTrix: a hybrid visualization for populated ontologies
Most Semantic Web data visualization tools structure the representation according to the concept definitions and interrelations that constitute the ontology’s vocabulary. Insta...
Benjamin Bach, Emmanuel Pietriga, Ilaria Liccardi,...