909 search results - page 44 / 182 » On the approximability of some network design problems |
KDD
2010
ACM
15 years 3 months ago
2010
ACM
The fused Lasso penalty enforces sparsity in both the coefficients and their successive differences, which is desirable for applications with features ordered in some meaningful w...
115
click to vote
FOCS
2000
IEEE
15 years 6 months ago
2000
IEEE
In many optimization problems, one seeks to allocate a limited set of resources to a set of individuals with demands. Thus, such allocations can naturally be viewed as vectors, wi...
78
Voted
CONEXT
2010
ACM
14 years 11 months ago
2010
ACM
Channel Bonding (CB) combines two adjacent frequency bands to form a new, wider band to facilitate high data rate transmissions in MIMO-based 802.11n networks. However, the use of...
107
click to vote
MOBICOM
2009
ACM
15 years 8 months ago
2009
ACM
—Neighbor discovery1 is one of the first steps in the initialization of a wireless ad hoc network. In this paper, we design and analyze practical algorithms for neighbor discove...
122
click to vote
STOC
2003
ACM
16 years 1 months ago
2003
ACM
In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is O(log n). This ...