5 search results - page 1 / 1 » Testing Halfspaces |
ECCC
2007
13 years 4 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 ...
PROPERTYTESTING
2010
13 years 2 months ago
2010
FOCS
2009
IEEE
13 years 11 months ago
2009
IEEE
— We prove the following strong hardness result for learning: Given a distribution on labeled examples from the hypercube such that there exists a monomial (or conjunction) consi...
CSDA
2008
13 years 5 months ago
2008
The computation of the Tukey depth, also called halfspace depth, is very demanding, even in low dimensional spaces, because it requires that all possible one-dimensional projectio...
FOCS
2009
IEEE
13 years 11 months ago
2009
IEEE
We prove the existence of an algorithm A for computing 2-d or 3-d convex hulls that is optimal for every point set in the following sense: for every set S of n points and for ever...