![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 34 matches
- 2024
- Emile Anand, Jan van den Brand, Mehrdad Ghadiri, Daniel J. Zhang:
The Bit Complexity of Dynamic Algebraic Formulas and Their Determinants. ICALP 2024: 10:1-10:20 - Mehrdad Ghadiri, Richard Santiago, F. Bruce Shepherd:
A Parameterized Family of Meta-Submodular Functions. SODA 2024: 1278-1306 - Mehrdad Ghadiri
, Yin Tat Lee
, Swati Padmanabhan
, William Swartworth
, David P. Woodruff
, Guanghao Ye
:
Improving the Bit Complexity of Communication for Distributed Convex Optimization. STOC 2024: 1130-1140 - Emile Anand, Jan van den Brand, Mehrdad Ghadiri, Daniel J. Zhang:
The Bit Complexity of Dynamic Algebraic Formulas and their Determinants. CoRR abs/2401.11127 (2024) - Mehrdad Ghadiri, Yin Tat Lee, Swati Padmanabhan, William Swartworth, David P. Woodruff, Guanghao Ye:
Improving the Bit Complexity of Communication for Distributed Convex Optimization. CoRR abs/2403.19146 (2024) - 2023
- Mehrdad Ghadiri:
On Symmetric Factorizations of Hankel Matrices. FOCS 2023: 2081-2092 - Mehrdad Ghadiri, Richard Peng, Santosh S. Vempala:
The Bit Complexity of Efficient Continuous Optimization. FOCS 2023: 2059-2070 - Mehrdad Ghadiri, Matthew Fahrbach, Gang Fu, Vahab Mirrokni:
Approximately Optimal Core Shapes for Tensor Decompositions. ICML 2023: 11237-11254 - Mehrdad Ghadiri, David Arbour, Tung Mai, Cameron Musco, Anup B. Rao:
Finite Population Regression Adjustment and Non-asymptotic Guarantees for Treatment Effect Estimation. NeurIPS 2023 - Mehrdad Ghadiri, Matthew Fahrbach, Gang Fu, Vahab Mirrokni:
Approximately Optimal Core Shapes for Tensor Decompositions. CoRR abs/2302.03886 (2023) - Mehrdad Ghadiri, Richard Peng, Santosh S. Vempala:
The Bit Complexity of Efficient Continuous Optimization. CoRR abs/2304.02124 (2023) - Mehrdad Ghadiri:
On Symmetric Factorizations of Hankel Matrices. CoRR abs/2307.00805 (2023) - 2022
- Saeid Naderiparizi, Adam Scibior, Andreas Munk, Mehrdad Ghadiri, Atilim Gunes Baydin, Bradley J. Gram-Hansen, Christian A. Schröder de Witt, Robert Zinkov, Philip H. S. Torr, Tom Rainforth, Yee Whye Teh, Frank Wood:
Amortized Rejection Sampling in Universal Probabilistic Programming. AISTATS 2022: 8392-8412 - Matthew Fahrbach, Gang Fu, Mehrdad Ghadiri:
Subquadratic Kronecker Regression with Applications to Tensor Decomposition. NeurIPS 2022 - Mehrdad Ghadiri, Mohit Singh, Santosh S. Vempala:
Constant-Factor Approximation Algorithms for Socially Fair k-Clustering. CoRR abs/2206.11210 (2022) - Matthew Fahrbach, Thomas Fu, Mehrdad Ghadiri:
Subquadratic Kronecker Regression with Applications to Tensor Decomposition. CoRR abs/2209.04876 (2022) - 2021
- Mehrdad Ghadiri, Samira Samadi, Santosh S. Vempala:
Socially Fair k-Means Clustering. FAccT 2021: 438-448 - Mehrdad Ghadiri, Richard Santiago, F. Bruce Shepherd:
Beyond Submodular Maximization via One-Sided Smoothness. SODA 2021: 1006-1025 - Matthew Fahrbach, Mehrdad Ghadiri, Thomas Fu:
Fast Low-Rank Tensor Decomposition by Ridge Leverage Score Sampling. CoRR abs/2107.10654 (2021) - Mehrdad Ghadiri, Richard Peng, Santosh S. Vempala:
Sparse Regression Faster than dω. CoRR abs/2109.11537 (2021) - 2020
- Mehrdad Ghadiri, Samira Samadi, Santosh S. Vempala:
Fair k-Means Clustering. CoRR abs/2006.10085 (2020) - Mehrdad Ghadiri, Richard Santiago, F. Bruce Shepherd:
A Parameterized Family of Meta-Submodular Functions. CoRR abs/2006.13754 (2020) - 2019
- Mehrdad Ghadiri, Mark Schmidt:
Distributed Maximization of "Submodular plus Diversity" Functions for Multi-label Feature Selection on Huge Datasets. AISTATS 2019: 2077-2086 - Mehrdad Ghadiri, Mark Schmidt:
Distributed Maximization of "Submodular plus Diversity" Functions for Multi-label Feature Selection on Huge Datasets. CoRR abs/1903.08351 (2019) - Mehrdad Ghadiri, Richard Santiago, F. Bruce Shepherd:
Beyond Submodular Maximization. CoRR abs/1904.09216 (2019) - Saeid Naderiparizi, Adam Scibior, Andreas Munk, Mehrdad Ghadiri, Atilim Günes Baydin, Bradley Gram-Hansen, Christian Schröder de Witt, Robert Zinkov, Philip H. S. Torr, Tom Rainforth, Yee Whye Teh, Frank Wood:
Amortized Rejection Sampling in Universal Probabilistic Programming. CoRR abs/1910.09056 (2019) - 2017
- Sepehr Abbasi Zadeh, Mehrdad Ghadiri, Vahab S. Mirrokni, Morteza Zadimoghaddam:
Scalable Feature Selection via Distributed Diversity Maximization. AAAI 2017: 2876-2883 - 2016
- Mehrdad Ghadiri, Sina Yazdanbod:
Minimizing the Total Movement for Movement to Independence Problem on a Line. CCCG 2016: 15-20 - Aditya Bhaskara, Mehrdad Ghadiri, Vahab S. Mirrokni, Ola Svensson:
Linear Relaxations for Finding Diverse Elements in Metric Spaces. NIPS 2016: 4098-4106 - Amin Aghaee, Mehrdad Ghadiri, Mahdieh Soleymani Baghshah:
Active Distance-Based Clustering Using K-Medoids. PAKDD (1) 2016: 253-264
skipping 4 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-07-27 10:42 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint