2314 search results - page 291 / 463 » Minimal Partitions of a Graph |
116
click to vote
ASPDAC
2004
ACM
15 years 9 months ago
2004
ACM
- This paper presents a solution to the problem of designing interconnects for memory devices. More precisely, it solves the automatic routing problem of memory peripheral circuits...
138
click to vote
DAGM
2003
Springer
15 years 9 months ago
2003
Springer
We present an approach to parallel variational optical flow computation by using an arbitrary partition of the image plane and iteratively solving related local variational proble...
123
click to vote
DATE
2002
IEEE
15 years 9 months ago
2002
IEEE
The core computation in BDD-based symbolic synthesis and verification is forming the image and pre-image of sets of states under the transition relation characterizing the sequen...
155
click to vote
DATE
2002
IEEE
15 years 9 months ago
2002
IEEE
In this paper, we show that under the constant delay model the placement problem is equivalent to minimizing a weighted sum of wire lengths. The weights can be efficiently compute...
127
click to vote
ICALP
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. We consider the clustering with diversity problem: given a set of colored points in a metric space, partition them into clusters such that each cluster has at least point...