1951 search results - page 35 / 391 » An algorithm for improving graph partitions |
ICTAI
2006
IEEE
15 years 4 months ago
2006
IEEE
This paper describes a new bipartite formulation for word-document co-clustering such that hyperclique patterns, strongly affiliated documents in this case, are guaranteed not to ...
ISPD
1999
ACM
15 years 2 months ago
1999
ACM
Netlist partitioning is an important and well studied problem. In this paper, a linear time partitioning approach based on iterative deletion is presented. We use the partitioning...
CIIA
2009
14 years 11 months ago
2009
Vertical partition is an important technique in database design used to enhance performance in database systems. Vertical fragmentation is a combinatorial optimization problem that...
ISAAC
2005
Springer
15 years 3 months ago
2005
Springer
A partition of a set of n items is a grouping of the items into k disjoint classes of equal size. Any partition can be modeled as a graph: the items become the vertices of the grap...
ICPADS
1998
IEEE
15 years 2 months ago
1998
IEEE
The DAG-based task graph model has been found effective in scheduling for performance prediction and optimization of parallel applications. However the scheduling complexity and s...