446 search results - page 63 / 90 » A fast algorithm for computing steiner edge connectivity |
109
click to vote
ISQED
2007
IEEE
15 years 9 months ago
2007
IEEE
In this paper, we address the interconnect-driven floorplanning problem that integrates OPC-friendly bus assignment with floorplanning. Buses consist of a number of horizontal/v...
127
click to vote
COMPGEOM
2003
ACM
15 years 8 months ago
2003
ACM
Given a Morse function over a 2-manifold with or without boundary, the Reeb graph is obtained by contracting the connected components of the level sets to points. We prove tight u...
142
click to vote
WABI
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. The orientation of physical networks is a prime task in deciphering the signaling-regulatory circuitry of the cell. One manifestation of this computational task is as a m...
118
click to vote
SIAMDM
2008
15 years 2 months ago
2008
Let G be a connected graph, and let V and V two n-element subsets of its vertex set V (G). Imagine that we place a chip at each element of V and we want to move them into the posi...
106
click to vote
ACCV
2010
Springer
14 years 10 months ago
2010
Springer
In this paper, we proposed a fast and accurate human pose estimation framework that combines top-down and bottom-up methods. The framework consists of an initialization stage and a...