Sciweavers

192 search results - page 31 / 39
» A Constant-Factor Approximation Algorithm for the Multicommo...
Sort
View
CORR
2010
Springer
94views Education» more  CORR 2010»
13 years 7 months ago
When LP is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings
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...
Nikhil Bansal, Anupam Gupta, Jian Li, Juliá...
SPAA
1999
ACM
14 years 27 days ago
Time-Constrained Scheduling of Weighted Packets on Trees and Meshes
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 ...
Micah Adler, Sanjeev Khanna, Rajmohan Rajaraman, A...
STOC
2003
ACM
142views Algorithms» more  STOC 2003»
14 years 9 months ago
Optimal probabilistic fingerprint codes
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...
Gábor Tardos
SODA
2010
ACM
135views Algorithms» more  SODA 2010»
14 years 6 months ago
Probabilistic Analysis of the Semidefinite Relaxation Detector in Digital Communications
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...
Anthony Man-Cho So
ICRA
2007
IEEE
203views Robotics» more  ICRA 2007»
14 years 2 months ago
Energy Saving Target Tracking Using Mobile Sensor Networks
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 ...
Yingying Li, Yun-Hui Liu