28 citations · 244 across the 83 of their papers we have counts for
Showing 2008Show all
3 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.DS2008
Stream sampling for variance-optimal estimation of subset sums
Edith Cohen, Nick Duffield, Haim Kaplan +2
From a high volume stream of weighted items, we want to maintain a generic sample of a certain limited size that we can later use to estimate the total weight of arbitrary subs…
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…