2272 search results - page 180 / 455 » Capture Complexity by Partition |
170
click to vote
ICMCS
2006
IEEE
16 years 19 days ago
2006
IEEE
1 In this paper, we introduce and evaluate a low complexity macroblock partition mode decision algorithm for interframe prediction in MPEG-2 to H.264 transcoder. The proposed tools...
190
click to vote
MFCS
2005
Springer
16 years 2 days ago
2005
Springer
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
179
click to vote
TPCG
2003
IEEE
15 years 12 months ago
2003
IEEE
In many application areas an optimal visualization of a complex graph depends on the specific task to be accomplished by the user. Therefore a means of locally customizable layou...
156
click to vote
ISPD
2003
ACM
15 years 12 months ago
2003
ACM
Previous works on buffer planning are mainly based on fixed die placement. It is necessary to reduce the complexity of computing the feasible buffer insertion sites to integrate t...
155
click to vote
SI3D
1999
ACM
15 years 11 months ago
1999
ACM
We present a system for rendering very complex 3D models at interactive rates. We select a subset of the model as preferred viewpoints and partition the space into virtual cells. ...