5 search results - page 1 / 1 » Testing Halfspaces |
84
Voted
ECCC
2007
15 years 11 days 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 ...
87
Voted
PROPERTYTESTING
2010
14 years 10 months ago
2010
87
Voted
FOCS
2009
IEEE
15 years 7 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...
97
Voted
CSDA
2008
15 years 15 days 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...
103
Voted
FOCS
2009
IEEE
15 years 7 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...