Sciweavers

5595 search results - page 869 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
INFOCOM
2010
IEEE
15 years 4 months ago
Distributed Dynamic Speed Scaling
In recent years we have witnessed a great interest in large distributed computing platforms, also known as clouds. While these systems offer enormous computing power, they are howe...
Rade Stanojevic, Robert Shorten
ICDT
2009
ACM
147views Database» more  ICDT 2009»
16 years 7 months ago
The average-case complexity of counting distinct elements
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...
David P. Woodruff
ESA
2006
Springer
140views Algorithms» more  ESA 2006»
15 years 10 months ago
Latency Constrained Aggregation in Sensor Networks
A sensor network consists of sensing devices which may exchange data through wireless communication. A particular feature of sensor networks is that they are highly energy constrai...
Luca Becchetti, Peter Korteweg, Alberto Marchetti-...
ICASSP
2009
IEEE
16 years 1 months ago
Robust-SL0 for stable sparse representation in noisy settings
In the last few years, we have witnessed an explosion in applications of sparse representation, the majority of which share the need for finding sparse solutions of underdetermine...
Armin Eftekhari, Massoud Babaie-Zadeh, Christian J...
ARITH
2007
IEEE
16 years 1 months ago
Worst Cases of a Periodic Function for Large Arguments
One considers the problem of finding hard to round cases of a periodic function for large floating-point inputs, more precisely when the function cannot be efficiently approxim...
Guillaume Hanrot, Vincent Lefèvre, Damien S...