default search action
Ehsan Emamjomeh-Zadeh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c13]Hang Wang, Sahar Karami, Ousmane Dia, Hippolyt Ritter, Ehsan Emamjomeh-Zadeh, Jiahui Chen, Zhen Xiang, David J. Miller, George Kesidis:
Training Set Cleansing of Backdoor Poisoning by Self-Supervised Representation Learning. ICASSP 2023: 1-5 - 2022
- [i8]Fransisca Susan, Negin Golrezaei, Ehsan Emamjomeh-Zadeh, David Kempe:
Active Learning for Non-Parametric Choice Models. CoRR abs/2208.03346 (2022) - [i7]Hang Wang, Sahar Karami, Ousmane Dia, H. Ritter, Ehsan Emamjomeh-Zadeh, Jiahui Chen, Zhen Xiang, David J. Miller, George Kesidis:
Training set cleansing of backdoor poisoning by self-supervised representation learning. CoRR abs/2210.10272 (2022) - 2021
- [c12]Ehsan Emamjomeh-Zadeh, Chen-Yu Wei, Haipeng Luo, David Kempe:
Adversarial Online Learning with Changing Action Sets: Efficient Algorithms with Approximate Regret Bounds. ALT 2021: 599-618 - [c11]Ehsan Emamjomeh-Zadeh, Renato Paes Leme, Jon Schneider, Balasubramanian Sivan:
Jointly Learning Prices and Product Features. IJCAI 2021: 2360-2366 - 2020
- [c10]Ehsan Emamjomeh-Zadeh, David Kempe, Mohammad Mahdian, Robert E. Schapire:
Interactive Learning of a Dynamic Structure. ALT 2020: 277-296 - [c9]Ehsan Emamjomeh-Zadeh, Yannai A. Gonczarowski, David Kempe:
The Complexity of Interactively Learning a Stable Matching by Trial and Error. EC 2020: 599 - [i6]Ehsan Emamjomeh-Zadeh, Yannai A. Gonczarowski, David Kempe:
The Complexity of Interactively Learning a Stable Matching by Trial and Error. CoRR abs/2002.07363 (2020) - [i5]Ehsan Emamjomeh-Zadeh, Chen-Yu Wei, Haipeng Luo, David Kempe:
Adversarial Online Learning with Changing Action Sets: Efficient Algorithms with Approximate Regret Bounds. CoRR abs/2003.03490 (2020)
2010 – 2019
- 2018
- [c8]Ehsan Emamjomeh-Zadeh, David Kempe:
Adaptive Hierarchical Clustering Using Ordinal Queries. SODA 2018: 415-429 - 2017
- [j2]AmirMahdi Ahmadinejad, Sepehr Assadi, Ehsan Emamjomeh-Zadeh
, Sadra Yazdanbod, Hamid Zarrabi-Zadeh
On the rectangle escape problem. Theor. Comput. Sci. 689: 126-136 (2017) - [c7]Ehsan Emamjomeh-Zadeh, David Kempe:
A General Framework for Robust Interactive Learning. NIPS 2017: 7082-7091 - [i4]Ehsan Emamjomeh-Zadeh, David Kempe:
Adaptive Hierarchical Clustering Using Ordinal Queries. CoRR abs/1708.00149 (2017) - [i3]Ehsan Emamjomeh-Zadeh, David Kempe:
A General Framework for Robust Interactive Learning. CoRR abs/1710.05422 (2017) - 2016
- [c6]Ehsan Emamjomeh-Zadeh, David Kempe, Vikrant Singhal:
Deterministic and probabilistic binary search in graphs. STOC 2016: 519-532 - 2015
- [c5]Yu Cheng
Mixture Selection, Mechanism Design, and Signaling. FOCS 2015: 1426-1445 - [c4]Ehsan Emamjomeh-Zadeh, Mohammad Ghodsi, Hamid Homapour, Masoud Seddighin
Unit Covering in Color-Spanning Set Model. WALCOM 2015: 44-52 - [i2]Ehsan Emamjomeh-Zadeh, David Kempe:
Binary Search in Graphs. CoRR abs/1503.00805 (2015) - [i1]Yu Cheng, Ho Yee Cheung, Shaddin Dughmi, Ehsan Emamjomeh-Zadeh, Li Han, Shang-Hua Teng:
Mixture Selection, Mechanism Design, and Signaling. CoRR abs/1508.03679 (2015) - 2014
- [j1]Sepehr Assadi, Ehsan Emamjomeh-Zadeh, Ashkan Norouzi-Fard, Sadra Yazdanbod, Hamid Zarrabi-Zadeh
The Minimum Vulnerability Problem. Algorithmica 70(4): 718-731 (2014) - 2013
- [c3]Mohammed Gharib
A Novel Probabilistic Key Management Algorithm for Large-Scale MANETs. AINA Workshops 2013: 349-356 - [c2]Sepehr Assadi, Ehsan Emamjomeh-Zadeh, Sadra Yazdanbod, Hamid Zarrabi-Zadeh:
On the Rectangle Escape Problem. CCCG 2013 - 2012
- [c1]Sepehr Assadi, Ehsan Emamjomeh-Zadeh, Ashkan Norouzi-Fard, Sadra Yazdanbod, Hamid Zarrabi-Zadeh
The Minimum Vulnerability Problem. ISAAC 2012: 382-391
Coauthor Index
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.
last updated on 2024-10-07 22:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: