2314 search results - page 72 / 463 » Minimal Partitions of a Graph |
112
Voted
IPPS
1999
IEEE
15 years 5 months ago
1999
IEEE
This paper proposes a method for reducing the maximum degree of vertices in graphs that maintain optimal broadcast time when a vertex can call a vertex at distance at most k durin...
120
Voted
CODES
1998
IEEE
15 years 5 months ago
1998
IEEE
The HW/SW partitioning problem addressed in this paper is one of the key steps in the co-design flow of heterogeneous embedded systems. Generally the aim is to provide solutions t...
99
Voted
CLUSTER
2006
IEEE
15 years 7 months ago
2006
IEEE
This paper presents a new partitioning algorithm to perform matrix multiplication on two interconnected heterogeneous processors. Data is partitioned in a way which minimizes the ...
103
Voted
WEA
2005
Springer
15 years 6 months ago
2005
Springer
We propose a novel algorithm based on random graphs to construct minimal perfect hash functions h. For a set of n keys, our algorithm outputs h in expected time O(n). The evaluatio...
98
Voted
DATE
2009
IEEE
15 years 8 months ago
2009
IEEE
Abstract - This paper describes an efficient graphbased method to optimize data-flow expressions for best hardware implementation. The method is based on factorization, common su...