Sciweavers

1221 search results - page 11 / 245
» Balanced graph partitioning
Sort
View
IPPS
2007
IEEE
14 years 1 months ago
Route Table Partitioning and Load Balancing for Parallel Searching with TCAMs
With the continuous advances in optical communications technology, the link transmission speed of Internet backbone has been increasing rapidly. This in turn demands more powerful...
Dong Lin, Yue Zhang 0006, Chengchen Hu, Bin Liu, X...
ICS
2009
Tsinghua U.
14 years 4 days ago
Dynamic task set partitioning based on balancing memory requirements to reduce power consumption
ABSTRACT Because of technology advances power consumption has emerged up as an important design issue in modern high-performance microprocessors. As a consequence, research on redu...
Diana Bautista, Julio Sahuquillo, Houcine Hassan, ...
SIAMDM
2000
77views more  SIAMDM 2000»
13 years 7 months ago
Recognizing Perfect 2-Split Graphs
A graph is a split graph if its vertices can be partitioned into a clique and a stable set. A graph is a k-split graph if its vertices can be partitioned into k sets, each of which...
Chính T. Hoàng, Van Bang Le
ISPAN
2008
IEEE
14 years 1 months ago
Product Line Sigraphs
Intuitively, a signed graph is a graph in which every edge is labeled with a + or − sign. For each edge, its sign represents the mode of the relationship between the vertices it...
Daniela Ferrero
GECCO
2005
Springer
14 years 1 months ago
Walsh transforms, balanced sum theorems and partition coefficients over multary alphabets
M. Teresa Iglesias, Bart Naudts, Alain Verschoren,...