Sciweavers

451 search results - page 53 / 91
» Some Lower Bounds on Geometric Separability Problems
Sort
View
INFOCOM
2006
IEEE
15 years 3 months ago
On the Performance of Joint Rate/Power Control with Adaptive Modulation in Wireless CDMA Networks
Abstract— Adaptive rate/power control schemes have great potential to increase the throughput of wireless CDMA networks. In this paper, we investigate the additional gains achiev...
Alaa Muqattash, Tao Shu, Marwan Krunz
FOCS
1999
IEEE
15 years 2 months ago
Approximate Nearest Neighbor Algorithms for Hausdorff Metrics via Embeddings
Hausdorff metrics are used in geometric settings for measuring the distance between sets of points. They have been used extensively in areas such as computer vision, pattern recog...
Martin Farach-Colton, Piotr Indyk
CORR
2002
Springer
104views Education» more  CORR 2002»
14 years 9 months ago
Preprocessing Chains for Fast Dihedral Rotations Is Hard or Even Impossible
We examine a computational geometric problem concerning the structure of polymers. We model a polymer as a polygonal chain in three dimensions. Each edge splits the polymer into t...
Michael A. Soss, Jeff Erickson, Mark H. Overmars
GOSLER
1995
15 years 1 months ago
Learning and Consistency
In designing learning algorithms it seems quite reasonable to construct them in such a way that all data the algorithm already has obtained are correctly and completely reflected...
Rolf Wiehagen, Thomas Zeugmann
DAGSTUHL
2007
14 years 11 months ago
Approximating min-max k-clustering
We consider the problems of set partitioning into k clusters with minimum total cost and minimum of the maximum cost of a cluster. The cost function is given by an oracle, and we ...
Asaf Levin