186 search results - page 27 / 38 » Fast Computation of Sparse Datacubes |
HPCA
1997
IEEE
14 years 2 months ago
1997
IEEE
In this paper we explore software-managed address translation. The purpose of the study is to specify the memory management design for a high clock-rate PowerPC implementation in ...
CSDA
2007
13 years 9 months ago
2007
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...
ICASSP
2008
IEEE
14 years 4 months ago
2008
IEEE
Compressive sensing aims to recover a sparse or compressible signal from a small set of projections onto random vectors; conventional solutions involve linear programming or greed...
DC
2010
13 years 10 months ago
2010
We present efficient algorithms for computing very sparse low distortion spanners in distributed networks and prove some non-trivial lower bounds on the tradeoff between time, spar...
VALUETOOLS
2006
ACM
14 years 3 months ago
2006
ACM
Min-max functions are dynamic programming operators of zero-sum deterministic games with finite state and action spaces. The problem of computing the linear growth rate of the or...