Sublinear algorithms for massive data problems by Mahabadi, Sepideh

Get full text

Approximate nearest neighbor and its many variants by Mahabadi, Sepideh

Get full text

Simultaneous nearest neighbor search by Kleinberg, Robert, Yuan, Yang, Indyk, Piotr, Mahabadi, Sepideh

Get full text
Get full text
Get full text

Composable core-sets for diversity and coverage maximization by Indyk, Piotr, Mahabadi, Sepideh, Mahdian, Mohammad, Mirrokni, Vahab S.

Get full text
Get full text
Get full text

Towards Tight Bounds for the Streaming Set Cover Problem by Har-Peled, Sariel, Indyk, Piotr, Mahabadi, Sepideh, Vakilian, Ali

Get full text
Get full text
Get full text
Get full text

Real-Time Recommendation of Diverse Related Articles by Indyk, Piotr, Mahabadi, Sepideh, Abbar, Sofiane, Amer-Yahia, Sihem

Get full text
Get full text
Get full text

On Streaming and Communication Complexity of the Set Cover Problem by Demaine, Erik D., Indyk, Piotr, Mahabadi, Sepideh, Vakilian, Ali

Get full text
Get full text
Get full text
Get full text
Get full text

Set Cover in Sub-linear Time by Indyk, Piotr, Mahabadi, Sepideh, Rubinfeld, Ronitt, Vakilian, Ali, Yodpinyanee, Anak

Get full text

Fractional Set Cover in the Streaming Model by Indyk, Piotr, Mahabadi, Sepideh, Rubinfeld, Ronitt, Ullman, Jonathan, Vakilian, Ali, Yodipinyanee, Anak

Get full text

Diverse near neighbor problem by Abbar, Sofiane, Amer-Yahia, Sihem, Indyk, Piotr, Mahabadi, Sepideh, Varadarajan, Kasturi R.

Get full text
Get full text
Get full text