129 search results - page 17 / 26 » Lower bounds on power dissipation for DSP algorithms |
105
click to vote
SIAMCOMP
2008
14 years 8 months ago
2008
Abstract. To cope with the impossibility of solving agreement problems in asynchronous systems made up of n processes and prone to t process crashes, system designers tailor their ...
ICS
2010
Tsinghua U.
15 years 6 months ago
2010
Tsinghua U.
: We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties -- such as high degree or clustering coefficient -- in large so...
GLOBECOM
2007
IEEE
15 years 3 months ago
2007
IEEE
Abstract— For MIMO broadcast systems the effects of shadowing on the channel capacity and the fairness of the system in sharing the resources amongst multiple users are important...
ANOR
2011
14 years 1 months ago
2011
The challenge of maximizing the diversity of a collection of points arises in a variety of settings, including the setting of search methods for hard optimization problems. One ver...
SPAA
1995
ACM
15 years 29 days ago
1995
ACM
We study the problem of sorting on a parallel computer with limited communication bandwidth. By using the PRAM(m) model, where p processors communicate through a globally shared me...