5889 search results - page 238 / 1178 » Graph Layout Problems |
157
click to vote
COMGEO
2007
ACM
15 years 6 months ago
2007
ACM
We consider the problem of simultaneous embedding of planar graphs. There are two variants of this problem, one in which the mapping between the vertices of the two graphs is given...
176
Voted
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
We propose a linear programming relaxation scheme for the class of multiple object tracking problems where the inter-object interaction metric is convex and the intraobject term q...
185
Voted
RECOMB
2001
Springer
16 years 7 months ago
2001
Springer
For the last twenty years fragment assembly in DNA sequencing followed the "overlap - layout - consensus" paradigm that is used in all currently available assembly tools...
180
click to vote
INFOVIS
2003
IEEE
15 years 12 months ago
2003
IEEE
An algorithm is presented for the visualisation of multidimensional abstract data, building on a hybrid model introduced at InfoVis 2002. The most computationally complex stage of...
156
click to vote
ISPD
2000
ACM
15 years 11 months ago
2000
ACM
We address the problem of computing critical area for missing material defects in a circuit layout. The extraction of critical area is the main computational problem in VLSI yield...