Sciweavers

598 search results - page 43 / 120
» The Puzzle Layout Problem
Sort
View
ISCI
2007
96views more  ISCI 2007»
13 years 7 months ago
A new algorithm for removing node overlapping in graph visualization
Techniques for drawing graphs have proven successful in producing good layouts of undirected graphs. When nodes must be labeled however, the problem of overlapping nodes arises, p...
Xiaodi Huang, Wei Lai, A. S. M. Sajeev, Junbin Gao
ICCV
2011
IEEE
12 years 7 months ago
Who Blocks Who: Simultaneous Clothing Segmentation for Grouping Images
Clothing is one of the most informative cues of human appearance. In this paper, we propose a novel multi-person clothing segmentation algorithm for highly occluded images. The ke...
Wang Nan, Haizhou Ai
CVPR
2012
IEEE
11 years 10 months ago
Learning shared body plans
We cast the problem of recognizing related categories as a unified learning and structured prediction problem with shared body plans. When provided with detailed annotations of o...
Ian Endres, Vivek Srikumar, Ming-Wei Chang, Derek ...
JGAA
2002
81views more  JGAA 2002»
13 years 7 months ago
Graph Drawing in Motion
Enabling the user of a graph drawing system to preserve the mental map between two different layouts of a graph is a major problem. In this paper we present methods that smoothly ...
Carsten Friedrich, Peter Eades
ARC
2009
Springer
137views Hardware» more  ARC 2009»
14 years 2 months ago
Heterogeneous Architecture Exploration: Analysis vs. Parameter Sweep
This paper argues the case for the use of analytical models in FPGA architecture layout exploration. We show that the problem when simplified, is amenable to formal optimization t...
Asma Kahoul, George A. Constantinides, Alastair M....