2 citations · 3 across the 4 of their papers we have counts for
Showing 2008Show all
2 papers · 1 filter
cs.CG2008
Line Transversals of Convex Polyhedra in
Haim Kaplan, Natan Rubin, Micha Sharir
We establish a bound of $O(n^2k^{1+\eps})$, for any $\eps>0$, on the combinatorial complexity of the set $\T$ of line transversals of a collection of convex polyhedra in $\…
cs.DB2008★ 2 cited
Sketch-Based Estimation of Subpopulation-Weight
Edith Cohen, Haim Kaplan
Summaries of massive data sets support approximate query processing over the original data. A basic aggregate over a set of records is the weight of subpopulations specified as a p…