3875 search results - page 161 / 775 » Approximation algorithms for the 0-extension problem |
132
Voted
INFOCOM
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract—We study the joint power control and minimumframe-length scheduling problem in wireless networks, under the physical interference model and subject to consecutive transm...
167
click to vote
DAM
2011
14 years 12 months ago
2011
In this paper we tackle the problem of matching two colored point sets in R3 under the bottleneck distance. First we present an exact matching algorithm that requires the computat...
135
Voted
COMPGEOM
2003
ACM
15 years 10 months ago
2003
ACM
Given a set H of n hyperplanes in IRd , we present an algorithm that ε-approximates the extent between the top and bottom k levels of the arrangement of H in time O(n+(k/ε)c), w...
151
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Abstract—This paper studies the problem of distributed computation over a network of wireless sensors. While this problem applies to many emerging applications, to keep our discu...