450 search results - page 76 / 90 » The Complexity of Computing Minimal Unidirectional Covering ... |
ICIP
2002
IEEE
16 years 1 months ago
2002
IEEE
In this paper, we propose a novel algorithm to smooth and simplify simultaneously range images and also triangle meshes derived from those images. These data sets often suffer fro...
STOC
2009
ACM
16 years 13 days ago
2009
ACM
We consider and analyze a new algorithm for balancing indivisible loads on a distributed network with n processors. The aim is minimizing the discrepancy between the maximum and m...
ICCAD
2007
IEEE
15 years 8 months ago
2007
IEEE
— Determination of maximum operating frequencies (Fmax) during manufacturing test at different operating voltages is required to: (a) to ensure that, for a Dynamic Voltage and Fr...
100
click to vote
EUROGP
2009
Springer
15 years 6 months ago
2009
Springer
Code bloat, the excessive increase of code size, is an important issue in Genetic Programming (GP). This paper proposes a theoretical analysis of code bloat in GP from the perspec...
IEEEPACT
2007
IEEE
15 years 6 months ago
2007
IEEE
Loop nest optimization is a combinatorial problem. Due to the growing complexity of modern architectures, it involves two increasingly difficult tasks: (1) analyzing the profita...