Sciweavers

236 search results - page 33 / 48
» Fast Sparse Matrix Multiplication
Sort
View
JMLR
2008
188views more  JMLR 2008»
13 years 7 months ago
Maximal Causes for Non-linear Component Extraction
We study a generative model in which hidden causes combine competitively to produce observations. Multiple active causes combine to determine the value of an observed variable thr...
Jörg Lücke, Maneesh Sahani
CORR
2011
Springer
167views Education» more  CORR 2011»
13 years 2 months ago
Fast global convergence of gradient methods for high-dimensional statistical recovery
Many statistical M-estimators are based on convex optimization problems formed by the weighted sum of a loss function with a norm-based regularizer. We analyze the convergence rat...
Alekh Agarwal, Sahand Negahban, Martin J. Wainwrig...
PODS
2002
ACM
138views Database» more  PODS 2002»
14 years 7 months ago
Fast Algorithms For Hierarchical Range Histogram Construction
Data Warehousing and OLAPapplications typically view data as having multiple logical dimensions e.g., product, location with natural hierarchies de ned on each dimension. OLAP que...
Sudipto Guha, Nick Koudas, Divesh Srivastava
TSMC
2008
138views more  TSMC 2008»
13 years 7 months ago
Fast Diagnosis With Sensors of Uncertain Quality
This correspondence presents an approach to the detection and isolation of component failures in large-scale systems. In the case of sensors that report at rates of 1 Hz or less, t...
Ozgur Erdinc, Craig Brideau, Peter Willett, Thiaga...
ICCV
2009
IEEE
13 years 5 months ago
Fast realistic multi-action recognition using mined dense spatio-temporal features
Within the field of action recognition, features and descriptors are often engineered to be sparse and invariant to transformation. While sparsity makes the problem tractable, it ...
Andrew Gilbert, John Illingworth, Richard Bowden