192 search results - page 31 / 39 » A Constant-Factor Approximation Algorithm for the Multicommo... |
104
click to vote
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Abstract Consider a random graph model where each possible edge e is present independently with some probability pe. Given these probabilities, we want to build a large/heavy match...
130
click to vote
SPAA
1999
ACM
15 years 4 months ago
1999
ACM
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...
STOC
2003
ACM
16 years 21 hour ago
2003
ACM
We construct binary codes for fingerprinting. Our codes for n users that are -secure against c pirates have length O(c2 log(n/ )). This improves the codes proposed by Boneh and Sh...
SODA
2010
ACM
15 years 9 months ago
2010
ACM
We consider the problem of detecting a vector of symbols that is being transmitted over a fading multiple?input multiple?output (MIMO) channel, where each symbol is an ?th root of...
ICRA
2007
IEEE
15 years 6 months ago
2007
IEEE
Abstract Minimizing the energy consumption of target tracking using a mobile sensor network is proved to be NPcomplete. Based on proximity graph, an approximately optimal solution ...