2609 search results - page 152 / 522 » Optimizing for parallelism and data locality |
106
Voted
IEEEPACT
2007
IEEE
15 years 7 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...
130
click to vote
ICPP
2006
IEEE
15 years 6 months ago
2006
IEEE
This paper discusses fast parallel algorithms for evaluating several centrality indices frequently used in complex network analysis. These algorithms have been optimized to exploi...
85
Voted
ICIP
1995
IEEE
16 years 2 months ago
1995
IEEE
Modern video applications call for computationally intensive data processing at very high data rate. In order to meet the high-performance/low-cost constraints, the stateof-the-ar...
123
Voted
CIKM
2007
Springer
15 years 7 months ago
2007
Springer
We consider the problem of document indexing and representation. Recently, Locality Preserving Indexing (LPI) was proposed for learning a compact document subspace. Different from...
MICRO
2005
IEEE
15 years 6 months ago
2005
IEEE
An emerging trend in processor design is the addition of short vector instructions to general-purpose and embedded ISAs. Frequently, these extensions are employed using traditiona...