Sciweavers

175 search results - page 31 / 35
» A DC-programming algorithm for kernel selection
Sort
View
ASPLOS
1994
ACM
14 years 20 days ago
Compiler Optimizations for Improving Data Locality
In the past decade, processor speed has become significantly faster than memory speed. Small, fast cache memories are designed to overcome this discrepancy, but they are only effe...
Steve Carr, Kathryn S. McKinley, Chau-Wen Tseng
SIGMOD
2009
ACM
250views Database» more  SIGMOD 2009»
14 years 8 months ago
Query processing techniques for solid state drives
Solid state drives perform random reads more than 100x faster than traditional magnetic hard disks, while offering comparable sequential read and write bandwidth. Because of their...
Dimitris Tsirogiannis, Stavros Harizopoulos, Mehul...
DAC
2003
ACM
14 years 9 months ago
Using estimates from behavioral synthesis tools in compiler-directed design space exploration
This paper considers the role of performance and area estimates from behavioral synthesis in design space exploration. We have developed a compilation system that automatically ma...
Byoungro So, Pedro C. Diniz, Mary W. Hall
NIPS
2008
13 years 10 months ago
Automatic online tuning for fast Gaussian summation
Many machine learning algorithms require the summation of Gaussian kernel functions, an expensive operation if implemented straightforwardly. Several methods have been proposed to...
Vlad I. Morariu, Balaji Vasan Srinivasan, Vikas C....
IDA
2009
Springer
14 years 3 months ago
Estimating Squared-Loss Mutual Information for Independent Component Analysis
Abstract. Accurately evaluating statistical independence among random variables is a key component of Independent Component Analysis (ICA). In this paper, we employ a squared-loss ...
Taiji Suzuki, Masashi Sugiyama