2542 search results - page 299 / 509 » Computing Cartograms with Optimal Complexity |
113
Voted
IPPS
1999
IEEE
15 years 4 months ago
1999
IEEE
Parallel programming models should attempt to satisfy two conflicting goals. On one hand, they should hide architectural details so that algorithm designers can write simple, port...
121
Voted
ICPADS
1998
IEEE
15 years 4 months ago
1998
IEEE
The DAG-based task graph model has been found effective in scheduling for performance prediction and optimization of parallel applications. However the scheduling complexity and s...
103
Voted
HPCA
1996
IEEE
15 years 4 months ago
1996
IEEE
Exploiting instruction-level parallelism (ILP) is extremely important for achieving high performance in application specific instruction set processors (ASIPs) and embedded process...
106
click to vote
SPDP
1993
IEEE
15 years 4 months ago
1993
IEEE
This paper presents a solution to the (processor) group membership problem. The methodology followed in designing the algorithm is summarized by the option to optimize the perform...
119
Voted
ARITH
2001
IEEE
15 years 4 months ago
2001
IEEE
A recently introduced double-base number representation has proved to be successful in optimizing the performance of several algorithms in cryptography and digital signal processi...