189 search results - page 26 / 38 » Task-Driven Color Coding |
ICSM
2007
IEEE
15 years 3 months ago
2007
IEEE
Large object-oriented applications are structured over large number of packages. Packages are important but complex structural entities that may be difficult to understand since ...
PLDI
2004
ACM
15 years 3 months ago
2004
ACM
Graph-coloring register allocation is an elegant and extremely popular optimization for modern machines. But as currently formulated, it does not handle two characteristics common...
IMR
2003
Springer
15 years 2 months ago
2003
Springer
The visualization of 3D vector and tensor fields in a 2D image is challenging because the large amount of information will either be mixed during projection to 2D or lead to seve...
90
Voted
ICPR
2000
IEEE
15 years 2 months ago
2000
IEEE
We present an algorithm for segmentation of traffic scenes that distinguishes moving objects from cast shadows. Three image features at each pixel site are considered: brightness,...
IEEEPACT
1998
IEEE
15 years 1 months ago
1998
IEEE
Register coalescing is used, as part of register allocation, to reduce the number of register copies. Developing efficient register coalescing heuristics is particularly important ...