Sciweavers

5606 search results - page 665 / 1122
» Randomization Techniques for Graphs.
Sort
View
PPOPP
1997
ACM
15 years 11 months ago
Compiling Dynamic Mappings with Array Copies
Array remappings are useful to many applications on distributed memory parallel machines. They are available in High Performance Fortran, a Fortran-based data-parallel language. T...
Fabien Coelho
243
Voted
ICPP
1996
IEEE
15 years 11 months ago
Polynomial-Time Nested Loop Fusion with Full Parallelism
Data locality and synchronization overhead are two important factors that affect the performance of applications on multiprocessors. Loop fusion is an effective way for reducing s...
Edwin Hsing-Mean Sha, Chenhua Lang, Nelson L. Pass...
COCO
2010
Springer
133views Algorithms» more  COCO 2010»
15 years 11 months ago
Spectral Algorithms for Unique Games
We present a new algorithm for Unique Games which is based on purely spectral techniques, in contrast to previous work in the area, which relies heavily on semidefinite programmi...
Alexandra Kolla
DATE
2004
IEEE
122views Hardware» more  DATE 2004»
15 years 10 months ago
Phase Coupled Code Generation for DSPs Using a Genetic Algorithm
The growing use of digital signal processors (DSPs) in embedded systems necessitates the use of optimizing compilers supporting special hardware features. Due to the irregular arc...
Markus Lorenz, Peter Marwedel
CIKM
2006
Springer
15 years 10 months ago
The visual funding navigator: analysis of the NSF funding information
This paper presents an interactive visualization toolkit for navigating and analyzing the National Science Foundation (NSF) funding information. Our design builds upon an improved...
Shixia Liu, Nan Cao, Hao Lv, Hui Su