Sciweavers

405 search results - page 2 / 81
» Alignment and Distribution is NOT (Always) NP-Hard
Sort
View
GLOBECOM
2008
IEEE
14 years 3 months ago
Approaching the Capacity of Wireless Networks through Distributed Interference Alignment
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...
Krishna Srikanth Gomadam, Viveck R. Cadambe, Syed ...
SSD
2007
Springer
243views Database» more  SSD 2007»
14 years 2 months ago
Continuous Medoid Queries over Moving Objects
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
Stavros Papadopoulos, Dimitris Sacharidis, Kyriako...
JSAC
2007
132views more  JSAC 2007»
13 years 8 months ago
Lifetime maximization via cooperative nodes and relay deployment in wireless networks
— Extending lifetime of battery-operated devices is a key design issue that allows uninterrupted information exchange among distributed nodes in wireless networks. Cooperative co...
Thanongsak Himsoon, W. Pam Siriwongpairat, Zhu Han...
IPPS
1998
IEEE
14 years 24 days ago
Partial Rearrangements of Space-Shared FPGAs
Abstract Oliver Diessel1 and Hossam ElGindy2 1Department of Computer Science and Software Engineering 2Department of Electrical and Computer Engineering The University of Newcastle...
Oliver Diessel, Hossam A. ElGindy
ATAL
2009
Springer
14 years 3 months ago
Easy and hard coalition resource game formation problems: a parameterized complexity analysis
Coalition formation is a key topic in multi–agent systems (mas). Coalitions enable agents to achieve goals that they may not have been able to achieve independently, and encoura...
Tammar Shrot, Yonatan Aumann, Sarit Kraus