Sciweavers

2028 search results - page 244 / 406
» Highly Predictive Blacklisting
Sort
View
ICML
2010
IEEE
13 years 10 months ago
Improved Local Coordinate Coding using Local Tangents
Local Coordinate Coding (LCC), introduced in (Yu et al., 2009), is a high dimensional nonlinear learning method that explicitly takes advantage of the geometric structure of the d...
Kai Yu, Tong Zhang
AAECC
2007
Springer
111views Algorithms» more  AAECC 2007»
13 years 9 months ago
When cache blocking of sparse matrix vector multiply works and why
Abstract. We present new performance models and a new, more compact data structure for cache blocking when applied to the sparse matrixvector multiply (SpM×V) operation, y ← y +...
Rajesh Nishtala, Richard W. Vuduc, James Demmel, K...
BMCBI
2008
85views more  BMCBI 2008»
13 years 9 months ago
Merging microarray data from separate breast cancer studies provides a robust prognostic test
Background: There is an urgent need for new prognostic markers of breast cancer metastases to ensure that newly diagnosed patients receive appropriate therapy. Recent studies have...
Lei Xu, Aik Choon Tan, Raimond L. Winslow, Donald ...
CSDA
2007
114views more  CSDA 2007»
13 years 9 months ago
Relaxed Lasso
The Lasso is an attractive regularisation method for high dimensional regression. It combines variable selection with an efficient computational procedure. However, the rate of co...
Nicolai Meinshausen
JPDC
2006
111views more  JPDC 2006»
13 years 9 months ago
Designing irregular parallel algorithms with mutual exclusion and lock-free protocols
Irregular parallel algorithms pose a significant challenge for achieving high performance because of the difficulty predicting memory access patterns or execution paths. Within an...
Guojing Cong, David A. Bader