1221 search results - page 63 / 245 » Balanced graph partitioning |
123
Voted
IPPS
1997
IEEE
15 years 7 months ago
1997
IEEE
We propose a distributed data structure for maintaining spatial data sets on message-passing, distributed memory machines. The data structure is based on orthogonal bisection tree...
109
Voted
CASES
2007
ACM
15 years 6 months ago
2007
ACM
We present an efficient framework for dynamic reconfiguration of application-specific custom instructions. A key component of this framework is an iterative algorithm for temporal...
123
Voted
IPPS
1999
IEEE
15 years 7 months ago
1999
IEEE
Abstract. A new approach to parallelizing harmonic balance simulation is presented. The technique leverages circuit substructure to expose potential parallelism in the form of a di...
124
Voted
SYNASC
2005
IEEE
15 years 8 months ago
2005
IEEE
In this paper we apply integer programming (IP) based techniques to the problem of delay balancing in wave-pipelined circuits. The proposed approach considers delays, as well as f...
123
Voted
CVPR
2005
IEEE
16 years 4 months ago
2005
IEEE
We consider the problem of clustering in domains where the affinity relations are not dyadic (pairwise), but rather triadic, tetradic or higher. The problem is an instance of the ...