We present a new 0 (n2) heuristic for hypergraph min-cut bipartitioning, an important problem in circuit placement. Fastest previous methods for this problem are O(n2 log n). Our ...
A more efficient coding scheme for H.264 by heuristically assign macroblock partition types for video foreground and background coding is proposed. High visual quality of foregro...
Logic replication, the duplication of logic in order to limit communication between partitions, is an effective part of a complete partitioning solution. In this paper we seek a b...
A parallel file may be physically stored on several independent disks and logically partitioned by several processors. This paper presents general algorithms for mapping between t...
Decision trees are widely disseminated as an effective solution for classification tasks. Decision tree induction algorithms have some limitations though, due to the typical strat...