129 search results - page 14 / 26 » Lower bounds on power dissipation for DSP algorithms |
STACS
2009
Springer
15 years 4 months ago
2009
Springer
We study online nonclairvoyant speed scaling to minimize total flow time plus energy. We first consider the traditional model where the power function is P(s) = sα . We give a ...
96
Voted
ICC
2007
IEEE
15 years 1 months ago
2007
IEEE
In this paper, the problem about power control in multiuser cognitive networks is addressed. The scenario we study is a heterogeneous network, where multiple cognitive (without the...
86
Voted
SODA
2010
ACM
15 years 6 months ago
2010
ACM
The crossing number of a graph is the least number of pairwise edge crossings in a drawing of the graph in the plane. We provide an O(n log n) time constant factor approximation al...
101
click to vote
KDD
2012
ACM
12 years 12 months ago
2012
ACM
Most time series data mining algorithms use similarity search as a core subroutine, and thus the time taken for similarity search is the bottleneck for virtually all time series d...
83
Voted
GOSLER
1995
15 years 1 months ago
1995
In designing learning algorithms it seems quite reasonable to construct them in such a way that all data the algorithm already has obtained are correctly and completely reflected...