Add to ORKGthis paper will appear in the proceedings of the 37th FOCS. The paper is also available via the Web at "http://www.cs.duke.edu
This paper addresses the problem of testing whether a Boolean-valued function f is a halfspace, i.e....
AbstractWe give a new algorithm for learning intersections of halfspaces with a margin, i.e. under t...
Restricted-orientation convexity is the study of geometric objects whose intersection with lines fro...
We derive a lower bound of\Omega n 4=3 ) for the halfspace emptiness problem: Given a set of n p...
For S ⊆ {0, 1} n, a Boolean function f: S → {−1, 1} is a halfspace over S if there exist w ∈ R n and...
International audienceFollowing groundbreaking work by Haussler and Welzl (1987), the use of small-n...
Following groundbreaking work by Haussler and Welzl (1987), the use of small epsilon-nets has become...
Abstract. For S ⊆ {0, 1}n, a Boolean function f: S → {−1, 1} is a halfspace over S if there exist w ...
International audienceFollowing groundbreaking work by Haussler and Welzl (1987), the use of small-n...
Abstract. Exact learning of half-spaces over finite subsets of IR n from membership queries is consi...
Following groundbreaking work by Haussler and Welzl (1987), the use of small ε-nets has become a sta...
Let M be a complete locally compact CAT(0)-space, and X an asymptotic cone of M . For γ ⊂...
http://deepblue.lib.umich.edu/bitstream/2027.42/4051/5/bab6283.0001.001.pdfhttp://deepblue.lib.umich...
The paper consists of two major parts. In the first part, we re-examine relative ε-approximations, p...
Abstract The main objective is to derive a lower bound from an upper one for har-monic functions in ...
This paper addresses the problem of testing whether a Boolean-valued function f is a halfspace, i.e....
AbstractWe give a new algorithm for learning intersections of halfspaces with a margin, i.e. under t...
Restricted-orientation convexity is the study of geometric objects whose intersection with lines fro...
We derive a lower bound of\Omega n 4=3 ) for the halfspace emptiness problem: Given a set of n p...
For S ⊆ {0, 1} n, a Boolean function f: S → {−1, 1} is a halfspace over S if there exist w ∈ R n and...
International audienceFollowing groundbreaking work by Haussler and Welzl (1987), the use of small-n...
Following groundbreaking work by Haussler and Welzl (1987), the use of small epsilon-nets has become...
Abstract. For S ⊆ {0, 1}n, a Boolean function f: S → {−1, 1} is a halfspace over S if there exist w ...
International audienceFollowing groundbreaking work by Haussler and Welzl (1987), the use of small-n...
Abstract. Exact learning of half-spaces over finite subsets of IR n from membership queries is consi...
Following groundbreaking work by Haussler and Welzl (1987), the use of small ε-nets has become a sta...
Let M be a complete locally compact CAT(0)-space, and X an asymptotic cone of M . For γ ⊂...
http://deepblue.lib.umich.edu/bitstream/2027.42/4051/5/bab6283.0001.001.pdfhttp://deepblue.lib.umich...
The paper consists of two major parts. In the first part, we re-examine relative ε-approximations, p...
Abstract The main objective is to derive a lower bound from an upper one for har-monic functions in ...
This paper addresses the problem of testing whether a Boolean-valued function f is a halfspace, i.e....
AbstractWe give a new algorithm for learning intersections of halfspaces with a margin, i.e. under t...
Restricted-orientation convexity is the study of geometric objects whose intersection with lines fro...