1248 search results - page 42 / 250 » On the Number of Birch Partitions |
ISSS
1998
IEEE
14 years 28 days ago
1998
IEEE
This paper presents a codesign approach which incorporates communication protocol selection as a design parameter within hardware/software partitioning. The presented approach tak...
EVOW
2006
Springer
14 years 10 days ago
2006
Springer
The k-cut problem is an NP-complete problem which consists of finding a partition of a graph into k balanced parts such that the number of cut edges is minimized. Different algori...
SC
1995
ACM
14 years 6 days ago
1995
ACM
Recently, a number of researchers have investigated a class of algorithms that are based on multilevel graph partitioning that have moderate computational complexity, and provide ...
JGT
2007
13 years 8 months ago
2007
: Let G be a graph with maximum degree d ≥ 3 and ω(G) ≤ d, where ω(G) is the clique number of the graph G. Let p1 and p2 be two positive integers such that d = p1 + p2. In th...
TMC
2011
13 years 3 months ago
2011
—In recent years, there has been an exponential increase in the number of mobile phone users. In addition, a significant growth in the demand for high-rate multimedia services o...