287 search results - page 29 / 58 » Constant Factor Approximations for the Hotlink Assignment Pr... |
ICML
2010
IEEE
13 years 9 months ago
2010
IEEE
We introduce a natural generalization of submodular set cover and exact active learning with a finite hypothesis class (query learning). We call this new problem interactive submo...
SPIRE
2010
Springer
13 years 7 months ago
2010
Springer
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
ESA
2009
Springer
14 years 3 months ago
2009
Springer
In this paper, we study the complexity and approximability of the orthogonal frequency-division multiple access (OFDMA) scheduling problem with uniformly related communication chan...
ADHOCNETS
2009
Springer
14 years 3 months ago
2009
Springer
Topology control is the problem of assigning powers to the nodes of an ad hoc network so as to create a specified network topology while minimizing the energy consumed by the netw...
TOC
2008
13 years 8 months ago
2008
Abstract: Schnorr's algorithm for finding an approximation for the shortest nonzero vector in an n-dimensional lattice depends on a parameter k. He proved that for a fixed k ...