72 search results - page 6 / 15 » Fast algorithm for beamforming problems in distributed commu... |
CDC
2010
IEEE
13 years 2 months ago
2010
IEEE
In this paper we study the constrained consensus problem, i.e. the problem of reaching a common point from the estimates generated by multiple agents that are constrained to lie in...
SPAA
2006
ACM
14 years 1 months ago
2006
ACM
Consider a network in which a collection of source nodes maintain and periodically update data objects for a collection of sink nodes, each of which periodically accesses the data...
JPDC
2006
13 years 7 months ago
2006
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
EUROPAR
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Total Exchange is one of the most important collective communication patterns for scientific applications. In this paper we propose an algorithm called LG for the total e...
CISS
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract— The growth of video content and diversification of content-sharing methods in the Internet lead to an exciting range of new problems in networking, communications, and...