274 search results - page 33 / 55 » The Polymatroid Steiner Problems |
129
Voted
CORR
2007
Springer
15 years 21 days ago
2007
Springer
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to ...
106
click to vote
TIT
2010
14 years 7 months ago
2010
We consider the problem of rate and power allocation in a multiple-access channel. Our objective is to obtain rate and power allocation policies that maximize a general concave ut...
118
Voted
SIAMCOMP
2008
15 years 20 days ago
2008
We develop approximation algorithms for the problem of placing replicated data in arbitrary networks, where the nodes may both issue requests for data objects and have capacity fo...
226
click to vote
ICDE
2009
IEEE
16 years 2 months ago
2009
IEEE
Increasing prevalence of large-scale distributed monitoring and computing environments such as sensor networks, scientific federations, Grids etc., has led to a renewed interest in...
ICDCS
1998
IEEE
15 years 5 months ago
1998
IEEE
This paper considers the problem of key agreement in a group setting with highly-dynamic group member population. A protocol suite, called CLIQUES, is developed by extending the w...