#### Filter Results:

- Full text PDF available (9)

#### Publication Year

2010

2018

- This year (4)
- Last 5 years (13)
- Last 10 years (14)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

News articles typically drive a lot of traffic in the form of comments posted by users on a news site. Such user-generated content tends to carry additional information such as entities andâ€¦ (More)

In this paper we consider efficient construction of "composable core-sets" for basic diversity and coverage maximization problems. A core-set for a point-set in a metric space is a subset of theâ€¦ (More)

- Erik D. Demaine, Piotr Indyk, Sepideh Mahabadi, Ali Vakilian
- DISC
- 2014

We develop the first streaming algorithm and the first two-party communication protocol that uses a constant number of passes/rounds and sublinear space/communication for logarithmic approximation toâ€¦ (More)

- Sepideh Mahabadi, M. Ganjali
- Statistics in medicine
- 2010

Multivariate longitudinal data with mixed continuous and discrete responses with the possibility of non-ignorable missingness are often common in follow-up medical studies and their analysis needs toâ€¦ (More)

- Sariel Har-Peled, Piotr Indyk, Sepideh Mahabadi, Ali Vakilian
- PODS
- 2016

We consider the classic Set Cover problem in the data stream model. For n elements and m sets (m ≥ n) we give a O(1/δ)-pass algorithm with a strongly sub-linear ~O(mn<sup>δ</sup>)â€¦ (More)

- Sofiane Abbar, Sihem Amer-Yahia, Piotr Indyk, Sepideh Mahabadi, Kasturi R. Varadarajan
- Symposium on Computational Geometry
- 2013

Motivated by the recent research on diversity-aware search, we investigate the k-diverse near neighbor reporting problem. The problem is defined as follows: given a query point q, report theâ€¦ (More)

- Sepideh Mahabadi
- SODA
- 2015

We consider the Approximate Nearest Line Search (NLS) problem. Given a set L of N lines in the high dimensional Euclidean space R, the goal is to build a data structure that, given a query point q âˆˆâ€¦ (More)

- Sariel Har-Peled, Sepideh Mahabadi
- SODA
- 2017

We introduce a new variant of the nearest neighbor search problem, which allows for some coordinates of the dataset to be arbitrarily corrupted or unknown. Formally, given a dataset of n points P =â€¦ (More)

- Piotr Indyk, Sepideh Mahabadi, Ronitt Rubinfeld, Jonathan Ullman, Ali Vakilian, Anak Yodpinyanee
- APPROX-RANDOM
- 2017

We study the Fractional Set Cover problem in the streaming model. That is, we consider the relaxation of the set cover problem over a universe of n elements and a collection of m sets, where each setâ€¦ (More)

- Piotr Indyk, Robert D. Kleinberg, Sepideh Mahabadi, Yang Yuan
- Symposium on Computational Geometry
- 2016

Motivated by applications in computer vision and databases, we introduce and study the Simultaneous Nearest Neighbor Search (SNN) problem. Given a set of data points, the goal of SNN is to design aâ€¦ (More)