Sciweavers

3206 search results - page 150 / 642
» Optimizing Graph Algorithms for Improved Cache Performance
Sort
View
CVPR
2009
IEEE
16 years 10 months ago
Higher-Order Clique Reduction in Binary Graph Cut
We introduce a new technique that can reduce any higher-order Markov random field with binary labels into a first-order one that has the same minima as the original. Moreover, w...
Hiroshi Ishikawa 0002
SIGARCH
2008
94views more  SIGARCH 2008»
15 years 3 months ago
Optimized on-chip pipelining of memory-intensive computations on the cell BE
Multiprocessors-on-chip, such as the Cell BE processor, regularly suffer from restricted bandwidth to off-chip main memory. We propose to reduce memory bandwidth requirements, and...
Christoph W. Kessler, Jörg Keller
SIGMOD
2004
ACM
173views Database» more  SIGMOD 2004»
16 years 3 months ago
Relaxed Currency and Consistency: How to Say "Good Enough" in SQL
Despite the widespread and growing use of asynchronous copies to improve scalability, performance and availability, this practice still lacks a firm semantic foundation. Applicati...
Hongfei Guo, Jonathan Goldstein, Per-Åke Lar...
ISPASS
2008
IEEE
15 years 9 months ago
Pinpointing and Exploiting Opportunities for Enhancing Data Reuse
—The potential for improving the performance of data-intensive scientific programs by enhancing data reuse in cache is substantial because CPUs are significantly faster than me...
Gabriel Marin, John M. Mellor-Crummey
AUSAI
2011
Springer
14 years 3 months ago
Image Feature Selection Based on Ant Colony Optimization
Image feature selection (FS) is an important task which can affect the performance of image classification and recognition. In this paper, we present a feature selection algorithm ...
Ling Chen, Bolun Chen, Yixin Chen