default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAshkan Esmaeili
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Ashkan Esmaeili
, Marzieh Edraki, Nazanin Rahnavard, Ajmal Mian, Mubarak Shah:
Low-Rank and Sparse Decomposition for Low-Query Decision-Based Adversarial Attacks. IEEE Trans. Inf. Forensics Secur. 19: 1561-1575 (2024)- 2022
- [j5]Saeed Vahidian, Mohsen Joneidi, Ashkan Esmaeili, Siavash Khodadadeh, Sharare Zehtabian, Bill Lin:
Spectrum Pursuit With Residual Descent for Column Subset Selection Problem: Theoretical Guarantees and Applications in Deep Learning. IEEE Access 10: 88164-88177 (2022) - [c7]Umar Khalid, Ashkan Esmaeili, Nazmul Karim, Nazanin Rahnavard:
RODD: A Self-Supervised Approach for Robust Out-of-Distribution Detection. CVPR Workshops 2022: 163-170 - [c6]Nazmul Karim, Umar Khalid, Ashkan Esmaeili, Nazanin Rahnavard:
CNLL: A Semi-supervised Approach For Continual Noisy Label Learning. CVPR Workshops 2022: 3877-3887 - [i14]Umar Khalid, Ashkan Esmaeili, Nazmul Karim, Nazanin Rahnavard:
RODD: A Self-Supervised Approach for Robust Out-of-Distribution Detection. CoRR abs/2204.02553 (2022) - [i13]Nazmul Karim, Umar Khalid, Ashkan Esmaeili, Nazanin Rahnavard:
CNLL: A Semi-supervised Approach For Continual Noisy Label Learning. CoRR abs/2204.09881 (2022) - 2021
- [c5]Ashkan Esmaeili, Mohsen Joneidi, Mehrdad Salimitari, Umar Khalid, Nazanin Rahnavard:
Two-Way Spectrum Pursuit for CUR Decomposition and its Application in Joint Column/Row Subset Selection. MLSP 2021: 1-6 - [i12]Ashkan Esmaeili, Marzieh Edraki, Nazanin Rahnavard, Mubarak Shah, Ajmal Mian:
LSDAT: Low-Rank and Sparse Decomposition for Decision-based Adversarial Attack. CoRR abs/2103.10787 (2021) - [i11]Ashkan Esmaeili, Mohsen Joneidi, Mehrdad Salimitari, Umar Khalid, Nazanin Rahnavard:
Two-way Spectrum Pursuit for CUR Decomposition and Its Application in Joint Column/Row Subset Selection. CoRR abs/2106.06983 (2021) - [i10]Ashkan Esmaeili:
Generative Model Adversarial Training for Deep Compressed Sensing. CoRR abs/2106.10696 (2021) - 2020
- [j4]Ashkan Esmaeili, Kayhan Behdin, Mohammad Amin Fakharian, Farokh Marvasti:
Transductive multi-label learning from missing data using smoothed rank function. Pattern Anal. Appl. 23(3): 1225-1233 (2020) - [j3]Masoumeh Azghani, Ashkan Esmaeili, Kayhan Behdin, Farokh Marvasti:
Missing Low-Rank and Sparse Decomposition Based on Smoothed Nuclear Norm. IEEE Trans. Circuits Syst. Video Technol. 30(6): 1550-1558 (2020) - [c4]Mohsen Joneidi, Saeed Vahidian, Ashkan Esmaeili, Weijia Wang, Nazanin Rahnavard, Bill Lin, Mubarak Shah:
Select to Better Learn: Fast and Accurate Deep Learning Using Data Selection From Nonlinear Manifolds. CVPR 2020: 7816-7826
2010 – 2019
- 2019
- [j2]Ashkan Esmaeili, Farokh Marvasti:
A Novel Approach to Quantized Matrix Completion Using Huber Loss Measure. IEEE Signal Process. Lett. 26(2): 337-341 (2019) - 2018
- [j1]Ashkan Esmaeili, Ehsan Asadi Kangarshahi, Farokh Marvasti:
Iterative null space projection method with adaptive thresholding in sparse signal recovery. IET Signal Process. 12(5): 605-612 (2018) - [i9]Ashkan Esmaeili, Kayhan Behdin, Mohammad Amin Fakharian, Farokh Marvasti:
Transduction with Matrix Completion Using Smoothed Rank Function. CoRR abs/1805.07561 (2018) - [i8]Ashkan Esmaeili, Kayhan Behdin, Sina Al-E.-Mohammad, Farokh Marvasti:
Recovering Quantized Data with Missing Information Using Bilinear Factorization and Augmented Lagrangian Method. CoRR abs/1810.03222 (2018) - [i7]Ashkan Esmaeili, Farokh Marvasti:
A Novel Approach to Quantized Matrix Completion Using Huber Loss Measure. CoRR abs/1810.12460 (2018) - [i6]Ashkan Esmaeili, Farokh Marvasti:
A Novel Approach to Sparse Inverse Covariance Estimation Using Transform Domain Updates and Exponentially Adaptive Thresholding. CoRR abs/1811.06773 (2018) - 2017
- [i5]Mohammad Amin Fakharian, Ashkan Esmaeili, Farokh Marvasti:
New Methods of Enhancing Prediction Accuracy in Linear Models with Missing Data. CoRR abs/1701.00677 (2017) - [i4]Ali Mottaghi, Kayhan Behdin, Ashkan Esmaeili, Mohammadreza Heydari, Farrokh Marvasti:
OBTAIN: Real-Time Beat Tracking in Audio Signals. CoRR abs/1704.02216 (2017) - 2016
- [c3]Ashkan Esmaeili, Arash Amini, Farokh Marvasti:
Fast methods for recovering sparse parameters in linear low rank models. GlobalSIP 2016: 1403-1407 - [c2]Ashkan Esmaeili, Farokh Marvasti:
Comparison of several sparse recovery methods for low rank matrices with random samples. IST 2016: 191-195 - [i3]Ashkan Esmaeili, Farokh Marvasti:
Comparison of Several Sparse Recovery Methods for Low Rank Matrices with Random Samples. CoRR abs/1606.03672 (2016) - [i2]Ashkan Esmaeili, Arash Amini, Farokh Marvasti:
Fast Methods for Recovering Sparse Parameters in Linear Low Rank Models. CoRR abs/1606.08009 (2016) - [i1]Ehsan Asadi, Ashkan Esmaeili, Farokh Marvasti:
Iterative Null-space Projection Method with Adaptive Thresholding in Sparse Signal Recovery and Matrix Completion. CoRR abs/1610.00287 (2016) - 2014
- [c1]Ashkan Esmaeili, Saeed Mashhadi:
Optimizing sensing duration for multiple secondary users in cognitive radio networks. IWCIT 2014: 1-6
Coauthor Index
aka: Farokh Marvasti
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-08-05 21:17 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:
