2314 search results - page 85 / 463 » Minimal Partitions of a Graph |
100
Voted
DAC
1999
ACM
16 years 4 months ago
1999
ACM
Partitioning and clustering are crucial steps in circuit layout for handling large scale designs enabled by the deep submicron technologies. Retiming is an important sequential lo...
112
Voted
VLSID
2003
IEEE
16 years 3 months ago
2003
IEEE
Functional decomposition is a process of splitting a complex circuit into smaller sub-circuits. This paper deals with the problem of determining the set of best free and bound var...
158
Voted
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
— The automatic detection of failures in IP paths is an essential step for operators to perform diagnosis or for overlays to adapt. We study a scenario where a set of monitors se...
131
Voted
ISCAS
1999
IEEE
15 years 7 months ago
1999
IEEE
The bigraph crossing problem, embedding the two node sets of a bipartite graph G = V0;V1;E along two parallel lines so that edge crossings are minimized, has application to placeme...
127
Voted
ISBI
2008
IEEE
16 years 4 months ago
2008
IEEE
In this paper, we present a robust, hierarchical Partition of Unity Finite Element Method (PUFEM) to compute the transformation between two images, which is represented by a non-r...