Sciweavers

457 search results - page 63 / 92
» A relative trust-region algorithm for independent component ...
Sort
View
NIPS
2008
14 years 11 months ago
Theory of matching pursuit
We analyse matching pursuit for kernel principal components analysis (KPCA) by proving that the sparse subspace it produces is a sample compression scheme. We show that this bound...
Zakria Hussain, John Shawe-Taylor
86
Voted
BMCBI
2010
116views more  BMCBI 2010»
14 years 9 months ago
permGPU: Using graphics processing units in RNA microarray association studies
Background: Many analyses of microarray association studies involve permutation, bootstrap resampling and crossvalidation, that are ideally formulated as embarrassingly parallel c...
Ivo D. Shterev, Sin-Ho Jung, Stephen L. George, Ko...
DOA
2001
137views more  DOA 2001»
14 years 11 months ago
Supporting Distributed Processing of Time-Based Media Streams
There are many challenges in devising solutions for online content processing of live networked multimedia sessions. These include content analysis under uncertainty (evidence of ...
Viktor S. Wold Eide, Frank Eliassen, Olav Lysne
121
Voted
KDD
2012
ACM
207views Data Mining» more  KDD 2012»
13 years 2 days ago
Robust multi-task feature learning
Multi-task learning (MTL) aims to improve the performance of multiple related tasks by exploiting the intrinsic relationships among them. Recently, multi-task feature learning alg...
Pinghua Gong, Jieping Ye, Changshui Zhang
TAPSOFT
1995
Springer
15 years 1 months ago
Anatomy of the Pentium Bug
The Pentium computer chip’s division algorithm relies on a table from which five entries were inadvertently omitted, with the result that 1738 single precision dividenddivisor ...
Vaughan R. Pratt