45 citations · 115 across the 24 of their papers we have counts for
Showing 2008Show all
2 papers · 1 filter
cs.DS2008
Transitive-Closure Spanners
Arnab Bhattacharyya, Elena Grigorescu, Kyomin Jung +2
Given a directed graph G = (V,E) and an integer k>=1, a k-transitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V, E_H) that has (1) the same transitive-closure a…
cs.LG2008★ 45 cited
What Can We Learn Privately?
Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi Nissim +2
Learning problems form an important category of computational tasks that generalizes many of the computations researchers apply to large real-life data sets. We ask: what concept c…