2924 search results - page 173 / 585 » Lower Bounds in Distributed Computing |
121
Voted
JMLR
2012
13 years 3 months ago
2012
We study sparse principal components analysis in the high-dimensional setting, where p (the number of variables) can be much larger than n (the number of observations). We prove o...
ICCAD
2006
IEEE
15 years 10 months ago
2006
IEEE
Battery-powered wireless sensors are severely constrained by the amount of the available energy. A method for computing the energy budget per sensing task can be a valuable design...
128
Voted
OPODIS
2010
14 years 11 months ago
2010
The Earliest Deadline First (EDF) scheduling algorithm is known to be suboptimal for meeting all deadlines under global scheduling on multiprocessor platforms. However, EDF is an a...
126
Voted
CORR
2010
Springer
15 years 1 months ago
2010
Springer
We consider the problem of isolating the real roots of a square-free polynomial with integer coefficients using (variants of) the continued fraction algorithm (CF). We introduce a...
97
Voted
ALT
2005
Springer
15 years 10 months ago
2005
Springer
We bound the future loss when predicting any (computably) stochastic sequence online. Solomonoff finitely bounded the total deviation of his universal predictor M from the true ...