Sciweavers

16404 search results - page 862 / 3281
» A set coverage problem
Sort
View
TCOM
2010
91views more  TCOM 2010»
15 years 6 months ago
Robust Power Allocation Algorithms for Wireless Relay Networks
—Resource allocation promises significant benefits in wireless networks. In order to fully reap these benefits, it is important to design efficient resource allocation algori...
Tony Q. S. Quek, Moe Z. Win, Marco Chiani
TMC
2010
196views more  TMC 2010»
15 years 6 months ago
Joint Routing, Channel Assignment, and Scheduling for Throughput Maximization in General Interference Models
—Throughput optimization in wireless networks with multiple channels and multiple radio interfaces per node is a challenging problem. For general traffic models (given a set of ...
Mahmoud Al-Ayyoub, Himanshu Gupta
SIGMOD
2011
ACM
206views Database» more  SIGMOD 2011»
14 years 10 months ago
Sampling based algorithms for quantile computation in sensor networks
We study the problem of computing approximate quantiles in large-scale sensor networks communication-efficiently, a problem previously studied by Greenwald and Khana [12] and Shri...
Zengfeng Huang, Lu Wang, Ke Yi, Yunhao Liu
ICDM
2009
IEEE
129views Data Mining» more  ICDM 2009»
16 years 2 months ago
Extended Boolean Matrix Decomposition
—With the vast increase in collection and storage of data, the problem of data summarization is most critical for effective data management. Since much of this data is categorica...
Haibing Lu, Jaideep Vaidya, Vijayalakshmi Atluri, ...
COLT
1993
Springer
15 years 11 months ago
Parameterized Learning Complexity
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...
Rodney G. Downey, Patricia A. Evans, Michael R. Fe...