#### Filter Results:

- Full text PDF available (45)

#### Publication Year

2004

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Data Set Used

#### Key Phrases

Learn More

- Martin Fürer, Shiva Prasad Kasiviswanathan
- Electronic Colloquium on Computational Complexity
- 2005

An algorithm is presented for exactly solving (in fact, counting) the number of maximum weight satisfying assignments of a 2-Cnf formula. The worst case running time of O(1.246 n) for formulas with n variables improves on the previous bound of O(1.256 n) by Dahllöf, Jonsson, and Wahlström. The algorithm uses only polynomial space. As a consequence we get an… (More)

- Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi Nissim, Sofya Raskhodnikova, Adam D. Smith
- 2008 49th Annual IEEE Symposium on Foundations of…
- 2008

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 classes can be learned privately, namely, by an algorithm whose output does not depend too heavily on any one input or specific training example? More precisely, we investigate… (More)

We develop algorithms for the private analysis of network data that provide accurate analysis of realistic networks while satisfying stronger privacy guarantees than those of previous work. We present several techniques for designing node differentially private algorithms, that is, algorithms whose output distribution does not change significantly when a… (More)

We describe novel subgradient methods for a broad class of matrix optimization problems involving nuclear norm regularization. Unlike existing approaches, our method executes very cheap iterations by combining low-rank stochastic subgradients with efficient incremental SVD updates, made possible by highly optimized and parallelizable dense linear algebra… (More)

Privacy is an increasingly important aspect of data publishing. Reasoning about privacy, however, is fraught with pitfalls. One of the most significant is the auxiliary information (also called external knowledge, background knowledge, or side information) that an adversary gleans from other channels such as the web, public records, or domain knowledge.… (More)

— Wireless networks employing directional antennas are expected to proliferate. We study the problem of provisioning the subscribers of such networks in two fundamental settings: (i) subscriber-centric, where the objective is to fairly allocate bandwidth among the subscribers and (ii) provider-centric, where the objective is to maximize the revenue that the… (More)

- Amos Beimel, Shiva Prasad Kasiviswanathan, Kobbi Nissim
- Machine Learning
- 2010

Learning is a task that generalizes many of the analyses that are applied to collections of data, in particular, to collections of sensitive individual information. Hence, it is natural to ask what can be learned while preserving individual privacy. Kasiviswanathan et al. (in SIAM J. Comput., 40(3):793–826, 2011) initiated such a discussion. They formalized… (More)

Motivated by the widespread proliferation of wireless networks employing directional antennas, we study some capacitated covering problems arising in these networks. Geometrically, the area covered by a directional antenna with parameters α,ρ,<i>r</i> is a set of points with polar coordinates (<i>r</i>,θ) such that <i>r</i> ≤ <i>r</i>… (More)

Given their pervasive use, social media, such as Twitter, have become a leading source of breaking news. A key task in the automated identification of such news is the detection of novel documents from a voluminous stream of text documents in a scalable manner. Motivated by this challenge, we introduce the problem of online 1-dictionary learning where… (More)

- Martin Fürer, Shiva Prasad Kasiviswanathan
- WADS
- 2007

EEcient algorithms are presented for constructing spanners in geometric intersection graphs. For a unit ball graph in R k , a (1 +)-spanner with O(nn-k+1) edges is obtained using eecient partitioning of the space into hypercubes and solving bichromatic closest pair problems. The spanner construction has almost equivalent complexity to the construction of… (More)