676 search results - page 20 / 136 » A Search-Free Intersection Algorithm |
CSR
2007
Springer
14 years 4 months ago
2007
Springer
Consider a family of sets and a single set, called query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Strict time cons...
FOCS
2006
IEEE
14 years 3 months ago
2006
IEEE
We give the first representation-independent hardness results for PAC learning intersections of halfspaces, a central concept class in computational learning theory. Our hardness...
WSCG
2004
13 years 11 months ago
2004
This paper describes a method for suppressing spatial conflicts in cartographic generalization of isobathymetric lines. These lines are modeled by parametric curves. For that purp...
ECCC
2006
13 years 9 months ago
2006
We give the first representation-independent hardness results for PAC learning intersections of halfspaces, a central concept class in computational learning theory. Our hardness ...
ISAAC
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient ...