We define and investigate product range spaces, for which we establish sampling theorems analogous to the standard finite VC-dimensional case. This generalizes ...

Abstract: We introduce the concept of a sensitive /spl epsi/-approximation, and use it to derive a more efficient algorithm for computing /spl epsi/-nets.

PRODUCT RANGE SPACES, SENSITIVE SAMPLING, AND. DERANDOMIZATION*. HERVS BRXNNIMANNef, BERNARD CHAZELLEwf, AND JIЕэ MATOUРEKТ. Abstract. We introduce the concept ...

Abstract. We introduce the concept of a sensitive ε-approximation and use it to derive a more efficient algorithm for computing ε-nets.

We define and investigate product range spaces, for which we establish sampling theorems analogous to the standard finite VC-dimensional case. This generalizes ...

Abstract: We introduce the concept of a sensitive /spl epsi/-approximation, and use it to derive a more efficient algorithm for computing /spl epsi/-nets.

Product Range Spaces, Sensitive Sampling, and Derandomization. Herv e Br onnimann. Department of Computer Science. Princeton University. Princeton, NJ 08544 ...

We define and investigate product range spaces, for which we establish sampling theorems analogous to the standard finite VC-dimensional case. This generalizes ...

A simpler optimal deterministic convex hull algorithm is derived, and by extending the method to the intersection of a set of balls with the same radius, ...

May 1, 1999 · This generalizes and simplifies results from previous works. Using these tools, we give a new deterministic algorithm for computing the convex ...