102 search results - page 19 / 21 » Distributed Approximation Algorithms for Weighted Problems i... |
ECCC
2007
13 years 5 months ago
2007
This paper addresses the problem of testing whether a Boolean-valued function f is a halfspace, i.e. a function of the form f(x) = sgn(w·x−θ). We consider halfspaces over the ...
KDD
2008
ACM
14 years 6 months ago
2008
ACM
: Locality Sensitive Hash functions are invaluable tools for approximate near neighbor problems in high dimensional spaces. In this work, we are focused on LSH schemes where the si...
IROS
2008
IEEE
14 years 1 days ago
2008
IEEE
— Precise robot positioning is important for many applications in indoor environments. Current solutions to the indoor localization problem are either both unreliable and inaccur...
CIAC
2000
Springer
13 years 10 months ago
2000
Springer
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
ATAL
2008
Springer
13 years 7 months ago
2008
Springer
We study the complexity of manipulation for a family of election systems derived from Copeland voting via introducing a parameter that describes how ties in head-to-head contests...