Sciweavers

201 search results - page 16 / 41
» Memory Optimizations For Fast Power-Aware Sparse Computation...
Sort
View
TSP
2008
116views more  TSP 2008»
13 years 7 months ago
Fast Blind Separation of Long Mixture Recordings Using Multivariate Polynomial Identification
This correspondence presents new approaches for optimizing kurtosis-based separation criteria in the case of long mixture recordings. Our methods are based on a multivariate polyno...
Johan Thomas, Yannick Deville, Shahram Hosseini
HPCA
2006
IEEE
14 years 8 months ago
LogTM: log-based transactional memory
Transactional memory (TM) simplifies parallel programming by guaranteeing that transactions appear to execute atomically and in isolation. Implementing these properties includes p...
Kevin E. Moore, Jayaram Bobba, Michelle J. Moravan...
ICDM
2010
IEEE
122views Data Mining» more  ICDM 2010»
13 years 5 months ago
Learning Preferences with Millions of Parameters by Enforcing Sparsity
We study the retrieval task that ranks a set of objects for a given query in the pairwise preference learning framework. Recently researchers found out that raw features (e.g. word...
Xi Chen, Bing Bai, Yanjun Qi, Qihang Lin, Jaime G....
CVPR
2009
IEEE
1372views Computer Vision» more  CVPR 2009»
15 years 2 months ago
Blind motion deblurring from a single image using sparse approximation
Restoring a clear image from a single motion-blurred image due to camera shake has long been a challenging problem in digital imaging. Existing blind deblurring techniques eithe...
Jian-Feng Cai (National University of Singapore), ...
PLDI
2010
ACM
14 years 19 days ago
Z-rays: divide arrays and conquer speed and flexibility
Arrays are the ubiquitous organization for indexed data. Throughout programming language evolution, implementations have laid out arrays contiguously in memory. This layout is pro...
Jennifer B. Sartor, Stephen M. Blackburn, Daniel F...