default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMostafa Rahmani
This is just a disambiguation page, and is not intended to be the bibliography of an actual person. Any publication listed on this page has not been assigned to an actual author yet. If you know the true author of one of the publications listed below, you are welcome to contact us.
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j14]Mostafa Rahmani
, Manijeh Bashar, Mohammad Javad Dehghani, Ali Akbari, Pei Xiao, Rahim Tafazolli, Mérouane Debbah:
Deep Reinforcement Learning-Based Sum Rate Fairness Trade-Off for Cell-Free mMIMO. IEEE Trans. Veh. Technol. 72(5): 6039-6055 (2023)- [c25]Mostafa Rahmani, James Caverlee, Fei Wang:
Incorporating Time in Sequential Recommendation Models. RecSys 2023: 784-790 - [i20]Yingqiang Ge, Mostafa Rahmani, Athirai A. Irissappane, Jose Sepulveda, James Caverlee, Fei Wang:
Automated Data Denoising for Recommendation. CoRR abs/2305.07070 (2023) - 2022
- [j13]Mostafa Rahmani, Mohammad Javad Dehghani, Pei Xiao, Manijeh Bashar, Mérouane Debbah:
Multi-Agent Reinforcement Learning-Based Pilot Assignment for Cell-Free Massive MIMO Systems. IEEE Access 10: 120492-120502 (2022) - [c24]Mostafa Rahmani:
Clustering a union of linear subspaces via matrix factorization and innovation search. UAI 2022: 1654-1664 - [c23]Mostafa Rahmani, Manijeh Bashar, Mohammad Javad Dehghani, Pei Xiao, Rahim Tafazolli, Mérouane Debbah:
Deep Reinforcement Learning-based Power Allocation in Uplink Cell-Free Massive MIMO. WCNC 2022: 459-464 - [i19]Mostafa Rahmani:
Provable Clustering of a Union of Linear Manifolds Using Optimal Directions. CoRR abs/2201.02745 (2022) - [i18]Mostafa Rahmani, Anoop Deoras, Laurent Callot:
Robust Projection based Anomaly Extraction (RPE) in Univariate Time-Series. CoRR abs/2205.15548 (2022) - 2021
- [j12]Mostafa Rahmani, Ping Li:
Closed-Form, Provable, and Robust PCA via Leverage Statistics and Innovation Search. IEEE Trans. Signal Process. 69: 3132-3144 (2021) - [c22]Weiwei Li, Mostafa Rahmani, Ping Li:
Provable Data Clustering via Innovation Search. ACSCC 2021: 498-503 - [c21]Mostafa Rahmani, Rasoul Shafipour, Ping Li:
Non-Local Feature Aggregation on Graphs via Latent Fixed Data Structures. ACSCC 2021: 1551-1557 - [c20]Mostafa Rahmani, Ping Li:
Fast and Provable Robust PCA VIA Normalized Coherence Pursuit. ICASSP 2021: 5305-5309 - [i17]Mostafa Rahmani, Ping Li:
Closed-Form, Provable, and Robust PCA via Leverage Statistics and Innovation Search. CoRR abs/2106.12190 (2021) - [i16]Weiwei Li, Mostafa Rahmani, Ping Li:
Provable Data Clustering via Innovation Search. CoRR abs/2108.06888 (2021) - [i15]Mostafa Rahmani, Rasoul Shafipour, Ping Li:
Non-Local Feature Aggregation on Graphs via Latent Fixed Data Structures. CoRR abs/2108.07028 (2021) - 2020
- [j11]Mostafa Rahmani, Andre Beckus, Adel Karimian, George K. Atia:
Scalable and Robust Community Detection With Randomized Sketching. IEEE Trans. Signal Process. 68: 962-977 (2020) - [c19]Mostafa Rahmani, Ping Li:
The Necessity of Geometrical Representation for Deep Graph Analysis. ICDM 2020: 1232-1237
2010 – 2019
- 2019
- [c18]Mostafa Rahmani, Ping Li:
Outlier Detection and Robust PCA Using a Convex Measure of Innovation. NeurIPS 2019: 14200-14210 - [c17]Martin Slawski, Mostafa Rahmani, Ping Li:
A Sparse Representation-Based Approach to Linear Regression with Partially Shuffled Labels. UAI 2019: 38-48 - [i14]Mostafa Rahmani, Ping Li:
Graph Analysis and Graph Pooling in the Spatial Domain. CoRR abs/1910.01589 (2019) - [i13]Mostafa Rahmani, Ping Li:
Outlier Detection and Data Clustering via Innovation Search. CoRR abs/1912.12988 (2019) - 2018
- [j10]Mostafa Rahmani, George K. Atia:
Low-Rank Matrix Recovery With Simultaneous Presence of Outliers and Sparse Corruption. IEEE J. Sel. Top. Signal Process. 12(6): 1170-1181 (2018) - [c16]Mostafa Rahmani, George K. Atia:
Data Dropout in Arbitrary Basis for Deep Network Regularization. ACSSC 2018: 66-70 - [c15]Adel Karimian, Mostafa Rahmani, Andre Beckus, George K. Atia:
Randomized Robust matrix Completion for the Community Detection Problem. ACSSC 2018: 2099-2103 - [i12]Mostafa Rahmani, Adel Karimian, Andre Beckus, George K. Atia:
Randomized Robust Matrix Completion for the Community Detection Problem. CoRR abs/1805.10927 (2018) - 2017
- [j9]Mostafa Rahmani, George K. Atia:
Spatial Random Sampling: A Structure-Preserving Data Sketching Tool. IEEE Signal Process. Lett. 24(9): 1398-1402 (2017) - [j8]Mostafa Rahmani, George K. Atia:
Subspace Clustering via Optimal Direction Search. IEEE Signal Process. Lett. 24(12): 1793-1797 (2017) - [j7]Mostafa Rahmani, George K. Atia:
Randomized Robust Subspace Recovery and Outlier Detection for High Dimensional Data Matrices. IEEE Trans. Signal Process. 65(6): 1580-1594 (2017) - [j6]Mostafa Rahmani, George K. Atia:
High Dimensional Low Rank Plus Sparse Matrix Decomposition. IEEE Trans. Signal Process. 65(8): 2004-2019 (2017) - [j5]Mostafa Rahmani, George K. Atia:
Coherence Pursuit: Fast, Simple, and Robust Principal Component Analysis. IEEE Trans. Signal Process. 65(23): 6260-6275 (2017) - [j4]Mostafa Rahmani, George K. Atia:
Innovation Pursuit: A New Approach to Subspace Clustering. IEEE Trans. Signal Process. 65(23): 6276-6291 (2017) - [c14]Mostafa Rahmani, George K. Atia:
Robust PCA with concurrent column and element-wise outliers. Allerton 2017: 332-337 - [c13]Mostafa Rahmani, George K. Atia:
High dimensional decomposition of coherent/structured matrices via sequential column/row sampling. ICASSP 2017: 6419-6423 - [c12]Mostafa Rahmani, George K. Atia:
Robust and Scalable Column/Row Sampling from Corrupted Big Data. ICCV Workshops 2017: 1818-1826 - [c11]Mostafa Rahmani, George K. Atia:
Coherence Pursuit: Fast, Simple, and Robust Subspace Recovery. ICML 2017: 2864-2873 - [c10]Mostafa Rahmani, George K. Atia:
Innovation Pursuit: A New Approach to the Subspace Clustering Problem. ICML 2017: 2874-2882 - [i11]Mostafa Rahmani, George K. Atia:
Low Rank Matrix Recovery with Simultaneous Presence of Outliers and Sparse Corruption. CoRR abs/1702.01847 (2017) - [i10]Mostafa Rahmani, George K. Atia:
Spatial Random Sampling: A Structure-Preserving Data Sketching Tool. CoRR abs/1705.03566 (2017) - [i9]Mostafa Rahmani, George K. Atia:
A Direction Search and Spectral Clustering Based Approach to Subspace Clustering. CoRR abs/1706.03860 (2017) - [i8]Mostafa Rahmani, George K. Atia:
Data Dropout in Arbitrary Basis for Deep Network Regularization. CoRR abs/1712.00891 (2017) - 2016
- [j3]Omar Chakrone, EL. M. Hssini, Mostafa Rahmani, Omar Darhouche:
Multiplicity results for a p-Laplacian discrete problems of Kirchhoff type. Appl. Math. Comput. 276: 310-315 (2016) - [c9]Mostafa Rahmani, George K. Atia:
In pursuit of novelty: A decentralized approach to subspace clustering. Allerton 2016: 447-451 - [c8]M. Hadi Amini, Mostafa Rahmani, Kianoosh G. Boroojeni, George K. Atia, S. Sitharama Iyengar, Orkun Karabasoglu:
Sparsity-based error detection in DC power flow state estimation. EIT 2016: 263-268 - [c7]Mostafa Rahmani, George K. Atia:
Scalable and robust PCA approach with random column/row sampling. GlobalSIP 2016: 1320-1324 - [c6]Mostafa Rahmani, George K. Atia:
A Subspace Learning Approach for High Dimensional Matrix Decomposition with Efficient Column/Row Sampling. ICML 2016: 1206-1214 - [c5]Mostafa Rahmani, George K. Atia:
A subspace method for array covariance matrix estimation. SAM 2016: 1-5 - [i7]M. Hadi Amini, Mostafa Rahmani, Kianoosh G. Boroojeni, George K. Atia, S. S. Iyengar, Orkun Karabasoglu:
Sparsity-Based Error Detection in DC Power Flow State Estimation. CoRR abs/1605.04380 (2016) - [i6]Mostafa Rahmani, George K. Atia:
Coherence Pursuit: Fast, Simple, and Robust Principal Component Analysis. CoRR abs/1609.04789 (2016) - [i5]Mostafa Rahmani, George K. Atia:
Robust and Scalable Column/Row Sampling from Corrupted Big Data. CoRR abs/1611.05977 (2016) - 2015
- [c4]Mostafa Rahmani, George K. Atia:
Randomized subspace learning approach for high dimensional low rank plus sparse matrix decomposition. ACSSC 2015: 1796-1800 - [c3]Mostafa Rahmani, George K. Atia:
A decentralized approach to robust subspace recovery. Allerton 2015: 802-807 - [c2]Mostafa Rahmani, George K. Atia:
Analysis of randomized robust PCA for high dimensional data. SP/SPE 2015: 25-30 - [c1]Mostafa Rahmani, George K. Atia:
Randomized robust subspace recovery for big data. MLSP 2015: 1-6 - [i4]Mostafa Rahmani, George K. Atia:
High Dimensional Low Rank plus Sparse Matrix Decomposition. CoRR abs/1502.00182 (2015) - [i3]Mostafa Rahmani, George K. Atia:
Randomized Robust Subspace Recovery for High Dimensional Data Matrices. CoRR abs/1505.05901 (2015) - [i2]Mostafa Rahmani, George K. Atia:
Innovation Pursuit: A New Approach to Subspace Clustering. CoRR abs/1512.00907 (2015) - 2014
- [j2]Mostafa Rahmani, Mohammad Hasan Bastani, Sarah Shahraini:
Two layers beamforming robust against direction-of-arrival mismatch. IET Signal Process. 8(1): 49-58 (2014) - [j1]Mostafa Rahmani, Mohammad Hasan Bastani:
Robust and rapid converging adaptive beamforming via a subspace method for the signal-plus-interferences covariance matrix estimation. IET Signal Process. 8(5): 507-520 (2014) - [i1]Mostafa Rahmani, George K. Atia:
A Subspace Method for Array Covariance Matrix Estimation. CoRR abs/1411.0622 (2014)
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-08-21 21:30 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:
