866 search results - page 60 / 174 » Networked Slepian-Wolf: Theory and Algorithms |
259
click to vote
STOC
1993
ACM
15 years 10 months ago
1993
ACM
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
228
click to vote
SENSYS
2006
ACM
16 years 8 days ago
2006
ACM
We explore fundamental performance limits of tracking a target in a two-dimensional field of binary proximity sensors, and design algorithms that attain those limits. In particul...
181
click to vote
COLT
2006
Springer
15 years 10 months ago
2006
Springer
We describe a new approach for understanding the difficulty of designing efficient learning algorithms. We prove that the existence of an efficient learning algorithm for a circui...
201
click to vote
MST
2006
15 years 6 months ago
2006
Load balancing is a critical issue for the efficient operation of peerto-peer networks. We give two new load-balancing protocols whose provable performance guarantees are within a...
172
click to vote
GLOBECOM
2008
IEEE
16 years 23 days ago
2008
IEEE
Abstract— Recent results establish the optimality of interference alignment to approach the Shannon capacity of interference networks at high SNR. However, the extent to which in...