3206 search results - page 125 / 642 » Optimizing Graph Algorithms for Improved Cache Performance |
125
click to vote
IPPS
2007
IEEE
15 years 9 months ago
2007
IEEE
— We consider memory subsystem optimizations for improving the performance of sparse scientific computation while reducing the power consumed by the CPU and memory. We first co...
118
click to vote
ICCAD
1994
IEEE
15 years 7 months ago
1994
IEEE
We consider the problem of performance driven lookup-table (LUT) based technology mapping for FPGAs using a general delay model. In the general delay model, each interconnection e...
120
click to vote
ISCC
2008
IEEE
15 years 9 months ago
2008
IEEE
We propose efficient scheduling algorithms for downlink MIMO-CDMA systems using zero forcing beamforming to achieve high system throughput with low computational complexity. Base...
137
click to vote
ICALP
2009
Springer
16 years 3 months ago
2009
Springer
We improve the approximation ratios for two optimization problems in planar graphs. For node-weighted Steiner tree, a classical network-optimization problem, the best achievable ap...
124
Voted
ICCAD
2003
IEEE
15 years 8 months ago
2003
IEEE
This paper proposes for latency insensitive systems a performance optimization technique called channel buffer queue sizing, which is performed after relay station insertion in th...