Approximate Halfspace Range Counting
SIAM Journal on Computing
The VC-dimension of SQL queries and selectivity estimation through sampling
ECML PKDD'11 Proceedings of the 2011 European conference on Machine learning and knowledge discovery in databases - Volume Part II
Semialgebraic Range Reporting and Emptiness Searching with Applications
SIAM Journal on Computing
On the set multicover problem in geometric settings
ACM Transactions on Algorithms (TALG)
ECML PKDD'12 Proceedings of the 2012 European conference on Machine Learning and Knowledge Discovery in Databases - Volume Part I
Shape matching under rigid motion
Computational Geometry: Theory and Applications
Small-size relative (p,ε)-approximations for well-behaved range spaces
Proceedings of the twenty-ninth annual symposium on Computational geometry
Union of random minkowski sums and network vulnerability analysis
Proceedings of the twenty-ninth annual symposium on Computational geometry
Fast approximation of betweenness centrality through sampling
Proceedings of the 7th ACM international conference on Web search and data mining
| Hi-index | 0.00 |
We re-examine the notion of relative (p,ε)-approximations, recently introduced in Cohen et al. (Manuscript, 2006), and establish upper bounds on their size, in general range spaces of finite VC-dimension, using the sampling theory developed in Li et al. (J. Comput. Syst. Sci. 62:516–527, 2001) and in several earlier studies (Pollard in Manuscript, 1986; Haussler in Inf. Comput. 100:78–150, 1992; Talagrand in Ann. Probab. 22:28–76, 1994). We also survey the different notions of sampling, used in computational geometry, learning, and other areas, and show how they relate to each other. We then give constructions of smaller-size relative (p,ε)-approximations for range spaces that involve points and halfspaces in two and higher dimensions. The planar construction is based on a new structure—spanning trees with small relative crossing number, which we believe to be of independent interest. Relative (p,ε)-approximations arise in several geometric problems, such as approximate range counting, and we apply our new structures to obtain efficient solutions for approximate range counting in three dimensions. We also present a simple solution for the planar case.