4934 search results - page 242 / 987 » complexity 2008 |
141
click to vote
SIGPLAN
2008
15 years 5 months ago
2008
Programs encounter increasingly complex and fragile mappings to computing platforms, resulting in performance characteristics that are often mysterious to students, practitioners,...
151
Voted
SIGPRO
2008
15 years 5 months ago
2008
: In this letter, an efficient algorithm for three-dimensional (3-D) vector radix decimation in frequency is derived for computing the type-III 3-D discrete W transform (DWT). Comp...
143
click to vote
TCAD
2008
15 years 5 months ago
2008
Abstract--Recent analytical global placers use density constraints to approximate nonoverlap constraints, and these show very successful results. This paper unifies a wide range of...
130
click to vote
IPL
2007
15 years 5 months ago
2007
We study the Kolmogorov complexity of a Binary Insertion Tree, and present a succinct encoding scheme for Binary Insertion Trees produced from incompressible permutations. Based o...
155
click to vote
TCS
2008
15 years 5 months ago
2008
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...