1101 search results - page 129 / 221 » An Algorithm for the Graph Crossing Number Problem |
134
Voted
ICALP
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. We provide a framework for the design and analysis of dynamic programming algorithms for surface-embedded graphs on n vertices and branchwidth at most k. Our technique ap...
155
click to vote
ICIP
2007
IEEE
15 years 9 months ago
2007
IEEE
The major problem in building a good lipreading system is to extract effective visual features from enormous quantity of video sequences data. For appearance-based feature analysi...
162
click to vote
SMA
2003
ACM
15 years 10 months ago
2003
ACM
In this paper a graph-based method is presented which not only characterizes topological classification of the tessellated surfaces but also simultaneously generates the substanti...
184
click to vote
ISPD
2012
ACM
14 years 19 days ago
2012
ACM
In this paper, we propose a new approach for gated bus synthesis [16] with minimum wire capacitance per transaction in three-dimensional (3D) ICs. The 3D IC technology connects di...
132
Voted
TC
1998
15 years 4 months ago
1998
—Loop networks (or Hamiltonian circulant graphs) are a popular class of fault-tolerant network topologies which include rings and complete graphs. For this class, the fundamental...