Abstract. We consider smoothed versions of geometric range spaces, so an element of the ground set (e.g. a point) can be contained in a range with a non-binary value in [0, 1]. Similar notions have been considered for kernels; we extend them to more general types of ranges. We then consider approximations of these range spaces through ε-nets and ε-samples (aka ε-approximations). We characterize when size bounds for ε-samples on kernels can be extended to these more general smoothed range spaces. We also describe new generalizations for ε-nets to these range spaces and show when results from binary range spaces can carry over to these smoothed ones.
One of the main problems of interval computations is to find an enclosure Y that contains the range ...
ABSTRACT. We study sets on which measurable real-valued functions on a measur-able space with neglig...
AbstractIn this paper we investigate approximation from shift-invariant spaces by using generalized ...
We present improved upper bounds for the size of relative (p, ε)-approximation for range spaces with...
AbstractWe give an efficient deterministic algorithm for computing ϵ-approximations and ϵ-nets for r...
Abstract: Range searching is a well known problem in the area of geometric data structures. We consi...
Range searching is a well known problem in the area of geometric data structures. We consider this p...
The paper consists of two major parts. In the first part, we re-examine relative ε-approximations, p...
We study the worst case error of kernel density estimates via subset approximation. A kernel density...
Range searching is a well known problem in the area of geometric data structures. We consider this p...
AbstractRange searching is a well known problem in the area of geometric data structures. We conside...
Range searching is a fundamental problem in computational geometry. The problem involves preprocessi...
Abstract Range searching is a well known problem in the area of geometric data structures. Weconside...
AbstractRestricted range approximation in uniform norm from an extended Haar space of a certain orde...
The range searching problem is a fundamental problem in computational geometry, with numerous import...
One of the main problems of interval computations is to find an enclosure Y that contains the range ...
ABSTRACT. We study sets on which measurable real-valued functions on a measur-able space with neglig...
AbstractIn this paper we investigate approximation from shift-invariant spaces by using generalized ...
We present improved upper bounds for the size of relative (p, ε)-approximation for range spaces with...
AbstractWe give an efficient deterministic algorithm for computing ϵ-approximations and ϵ-nets for r...
Abstract: Range searching is a well known problem in the area of geometric data structures. We consi...
Range searching is a well known problem in the area of geometric data structures. We consider this p...
The paper consists of two major parts. In the first part, we re-examine relative ε-approximations, p...
We study the worst case error of kernel density estimates via subset approximation. A kernel density...
Range searching is a well known problem in the area of geometric data structures. We consider this p...
AbstractRange searching is a well known problem in the area of geometric data structures. We conside...
Range searching is a fundamental problem in computational geometry. The problem involves preprocessi...
Abstract Range searching is a well known problem in the area of geometric data structures. Weconside...
AbstractRestricted range approximation in uniform norm from an extended Haar space of a certain orde...
The range searching problem is a fundamental problem in computational geometry, with numerous import...
One of the main problems of interval computations is to find an enclosure Y that contains the range ...
ABSTRACT. We study sets on which measurable real-valued functions on a measur-able space with neglig...
AbstractIn this paper we investigate approximation from shift-invariant spaces by using generalized ...