Sciweavers

3874 search results - page 208 / 775
» Approximation Algorithms for k-hurdle Problems
Sort
View
143
Voted
JSAC
2011
126views more  JSAC 2011»
14 years 10 months ago
Spectrum Management in Multiuser Cognitive Wireless Networks: Optimality and Algorithm
Abstract— Spectrum management is used to improve performance in multiuser communication system, e.g., cognitive radio or femtocell networks, where multiuser interference can lead...
Chee Wei Tan, S. Friedland, Steven H. Low
154
Voted
WAOA
2010
Springer
209views Algorithms» more  WAOA 2010»
15 years 1 months ago
Densest k-Subgraph Approximation on Intersection Graphs
We study approximation solutions for the densest k-subgraph problem (DS-k) on several classes of intersection graphs. We adopt the concept of -quasi elimination orders, introduced ...
Danny Z. Chen, Rudolf Fleischer, Jian Li
IJSNET
2008
125views more  IJSNET 2008»
15 years 3 months ago
Minimum-cost sensor arrangement for achieving wanted coverage lifetime
: Suppose we need to watch a set of targets continuously for a required period of time, and suppose we choose any number of sensors from a fixed set of sensor types and place them ...
Jie Wang, Ning Zhong
ICASSP
2011
IEEE
14 years 7 months ago
Compressive sensing meets game theory
We introduce the Multiplicative Update Selector and Estimator (MUSE) algorithm for sparse approximation in underdetermined linear regression problems. Given f = Φα∗ + µ, the ...
Sina Jafarpour, Robert E. Schapire, Volkan Cevher
89
Voted
ECCC
2010
86views more  ECCC 2010»
15 years 3 months ago
On Approximating the Entropy of Polynomial Mappings
We investigate the complexity of the following computational problem: Polynomial Entropy Approximation (PEA): Given a low-degree polynomial mapping p : Fn Fm , where F is a finite...
Zeev Dvir, Dan Gutfreund, Guy N. Rothblum, Salil P...