Sciweavers

3206 search results - page 194 / 642
» Optimizing Graph Algorithms for Improved Cache Performance
Sort
View
COMPGEOM
2006
ACM
16 years 14 days ago
Engineering a compact parallel delaunay algorithm in 3D
We describe an implementation of a compact parallel algorithm for 3D Delaunay tetrahedralization on a 64-processor shared-memory machine. Our algorithm uses a concurrent version o...
Daniel K. Blandford, Guy E. Blelloch, Clemens Kado...
ICPP
1995
IEEE
15 years 10 months ago
Fusion of Loops for Parallelism and Locality
Loop fusion improves data locality and reduces synchronization in data-parallel applications. However, loop fusion is not always legal. Even when legal, fusion may introduce loop-...
Naraig Manjikian, Tarek S. Abdelrahman
HIPC
2007
Springer
16 years 20 days ago
Multi-objective Peer-to-Peer Neighbor-Selection Strategy Using Genetic Algorithm
Peer-to-peer (P2P) topology has significant influence on the performance, search efficiency and functionality, and scalability of the application. In this paper, we present a Gen...
Ajith Abraham, Benxian Yue, Chenjing Xian, Hongbo ...
DATE
2004
IEEE
175views Hardware» more  DATE 2004»
15 years 10 months ago
Breaking Instance-Independent Symmetries in Exact Graph Coloring
Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems, such as graph coloring used in register allocation. Graph coloring is...
Arathi Ramani, Fadi A. Aloul, Igor L. Markov, Kare...
SIGIR
2011
ACM
14 years 9 months ago
A boosting approach to improving pseudo-relevance feedback
Pseudo-relevance feedback has proven effective for improving the average retrieval performance. Unfortunately, many experiments have shown that although pseudo-relevance feedback...
Yuanhua Lv, ChengXiang Zhai, Wan Chen