2157 search results - page 97 / 432 » Optimal Fast Hashing |
156
click to vote
ICMCS
2005
IEEE
15 years 10 months ago
2005
IEEE
The major complexity source in H.264 is the rate distortion (R-D) optimization. This work proposes a method to reduce the complexity of R-D analysis, paying a little video degrada...
122
click to vote
ISPD
2005
ACM
15 years 10 months ago
2005
ACM
This paper presents an efficient heuristic algorithm to design a power distribution network of a chip by employing a successive partitioning and grid refinement scheme. In an it...
126
click to vote
GD
2005
Springer
15 years 10 months ago
2005
Springer
Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height...
123
click to vote
ICCSA
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Given a simple n-sided polygon in the plane with a boundary partitioned into subchains some of which are convex and colored, we consider the following problem: Which is t...
145
click to vote
DAC
2003
ACM
15 years 9 months ago
2003
ACM
In this paper we propose a partitioning-based placement algorithm for FPGAs. The method incorporates simple, but effective heuristics that target delay minimization. The placement...