Sciweavers

3020 search results - page 136 / 604
» Optimal partition trees
Sort
View
DAC
1989
ACM
15 years 10 months ago
Fast Hypergraph Partition
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 ...
Andrew B. Kahng
ICMCS
2005
IEEE
68views Multimedia» more  ICMCS 2005»
16 years 2 days ago
On the Performance Improvement of H.264 Through Foreground and Background Analyses
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...
Zhe-Kuan Lin, Horng-Horng Lin, Yu-Hsin Chen, Jen-H...
ICCAD
1997
IEEE
83views Hardware» more  ICCAD 1997»
15 years 10 months ago
Replication for logic bipartitioning
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...
Morgan Enos, Scott Hauck, Majid Sarrafzadeh
TJS
2008
98views more  TJS 2008»
15 years 6 months ago
Mapping functions and data redistribution for parallel files
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...
Florin Isaila, Walter F. Tichy
SAC
2009
ACM
16 years 1 months ago
LEGAL-tree: a lexicographic multi-objective genetic algorithm for decision tree induction
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...
Márcio P. Basgalupp, Rodrigo C. Barros, And...