459 search results - page 29 / 92 » Approximation Algorithms for Buy-at-Bulk Geometric Network D... |
121
click to vote
PODS
2006
ACM
16 years 4 months ago
2006
ACM
Recently, there has been an increased focus on modeling uncertainty by distributions. Suppose we wish to compute a function of a stream whose elements are samples drawn independen...
147
click to vote
COMCOM
2006
15 years 4 months ago
2006
Due to the application-specific nature of wireless sensor networks, application-aware algorithm and protocol design paradigms are highly required in order to optimize the overall ...
126
click to vote
ICNP
2006
IEEE
15 years 10 months ago
2006
IEEE
—Data caching can significantly improve the efficiency of information access in a wireless ad hoc network by reducing the access latency and bandwidth usage. However, designing e...
136
click to vote
COMPGEOM
2006
ACM
15 years 10 months ago
2006
ACM
We consider a class of geometric facility location problems in which the goal is to determine a set X of disks given by their centers (tj) and radii (rj) that cover a given set of...
136
Voted
DISOPT
2008
15 years 4 months ago
2008
We define the k-path tree matroid, and use it to solve network design problems in which the required connectivity is arbitrary for a given pair of nodes, and 1 for the other pairs...