757 search results - page 80 / 152 » On the hardness of approximating Max-Satisfy |
COMPGEOM
2006
ACM
15 years 3 months ago
2006
ACM
We study the problem of minimum-distortion embedding of ultrametrics into the plane and higher dimensional spaces. Ultrametrics are a natural class of metrics that frequently occu...
109
click to vote
COMPGEOM
2004
ACM
15 years 3 months ago
2004
ACM
A frequently arising problem in computational geometry is when a physical structure, such as an ad-hoc wireless sensor network or a protein backbone, can measure local information...
SENSYS
2004
ACM
15 years 3 months ago
2004
ACM
Wireless sensor networks offer the potential to span and monitor large geographical areas inexpensively. Sensors, however, have significant power constraint (battery life), makin...
ICALP
2004
Springer
15 years 3 months ago
2004
Springer
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
SIGECOM
2003
ACM
15 years 3 months ago
2003
ACM
We prove the existence of -Nash equilibrium strategies with support logarithmic in the number of pure strategies. We also show that the payoffs to all players in any (exact) Nash...