Sepideh Mahabadi is on Facebook. Join Facebook to connect with Sepideh Mahabadi and others you may know. Facebook gives people the power to share and makes the world more open and connected.

Affiliation: CSAIL MIT

Search for Sepideh Mahabadi's work. Search Search. Home Sepideh Mahabadi. Sepideh Mahabadi. Skip slideshow.

Filter by Year. OR AND NOT 1. 2013 Sepideh Mahabadi is a research assistant professor at the Toyota Technological Institute at Chicago (TTIC). She received her PhD from MIT, where she was advised by Piotr Indyk. For a year, she was a postdoctoral research scientist at Simons Collaboration on Algorithms and Geometry based at Columbia University. %0 Conference Paper %T Composable Core-sets for Determinant Maximization: A Simple Near-Optimal Algorithm %A Sepideh Mahabadi %A Piotr Indyk %A Shayan Oveis Gharan %A Alireza Rezaei %B Proceedings of the 36th International Conference on Machine Learning %C Proceedings of Machine Learning Research %D 2019 %E Kamalika Chaudhuri %E Ruslan Salakhutdinov %F pmlr-v97-mahabadi19a %I PMLR %P 4254 In Spring Quarter 2021, Sepideh Mahabadi will be teaching a new course, Special Topics: Algorithms for Massive Data.

Nov 22, 2013 Sepideh Mahabadi received 2011 her B.Sc. in Computer Engineering from the Sharif University of Technology, Iran. That year she moved to

Olympiads Countries Tasks Hall of Fame Search. Login Add Edit View Sepideh Mahabadi’s profile on LinkedIn, the world’s largest professional community. Sepideh has 1 job listed on their profile. See the complete profile on LinkedIn and discover Sepideh’s connections and jobs at similar companies.

Sepideh Mahabadi. 1. 0. 0. Contestant. Year. ▽. Country, Tasks, Score, Rank, Medal. Abs. Rel. Abs. Rel. 2007 · Iran · 100 · 40 · 100 · 100 · 64 · 5, 409, 68.17%

2013. Real-time recommendation of diverse related articles. In Proceedings of the 22nd international conference on World Wide Web (WWW '13). International World Wide Web Conferences Steering Committee, Republic and Canton of Geneva, Switzerland, 1-12. 2014-10-12 Sepideh Mahabadi, Konstantin Makarychev, Yury Makarychev, Ilya Razenshteyn, Nonlinear Dimension Reduction via Outer Bi-Lipschitz Extensions, STOC 2018. (pdf, slides) Piotr Indyk, Sepideh Mahabadi, Ronitt Rubinfeld, Ali Vakilian, Anak Yodpinyanee, Set Cover in Sub-linear Time, SODA 2018.

In this talk, I will focus on these two tasks from the perspective of diversity and fairness. Search is often formalized as the (approximate) nearest neighbor problem. Sepideh Mahabadi Research Assistant Professor Toyota Technological Institute at Chicago (TTIC) WHEN: September 18, 2020 @ 10:00 am - 11:00 am Sepideh Mahabadi Ali Vakiliany Abstract We give a local search based algorithm for k-median and k-means (and more generally for any k-clustering with ‘ p norm cost function) from the perspective of individual fairness.
Green logistics trucking

OR AND NOT 1.

Sepideh Mahabadi, Piotr Indyk, Shayan Oveis Gharan, Alireza Rezaei.
Hur går man ner i vikt snabbt

Composable Core-sets for Determinant Maximization: A Simple Near-Optimal Algorithm. Sepideh Mahabadi, Piotr Indyk, Shayan Oveis Gharan, Alireza Rezaei.

Individual Fairness for k-Clustering. Sepideh Mahabadi · Ali Vakilian.

Taxe foncière

arXiv:1807.11648v2 [cs.DS] 16 Nov 2019 Composable Core-sets for Determinant Maximization Problems via Spectral Spanners Piotr Indyk MIT indyk@mit.edu Sepideh Mahabadi TTIC mahabad

Sepideh Mahabadi's 24 research works with 180 citations and 395 reads, including: Streaming Complexity of SVMs Sepideh Mahabadi is a research assistant professor at the Toyota Technological Institute at Chicago (TTIC). She received her Ph.D. from MIT, where she was advised by Piotr Indyk. For a year, she was a postdoctoral research scientist at Simons Collaboration on … Sepideh Mahabadi: Composable Core-sets for Diversity and Coverage Maximization, and Its Application in Diverse Near Neighbor Problem Wednesday, May 7, 2014 - 4:00pm to 5:00pm Location: View the profiles of people named Sepideh Mahabadi.