default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSajad Mehrizi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j9]Sajad Mehrizi
, Symeon Chatzinotas:
Network Traffic Modeling and Prediction Using Graph Gaussian Processes. IEEE Access 10: 132644-132655 (2022)- [j8]Sajad Mehrizi, Symeon Chatzinotas:
Bayesian Poisson Factorization With Side Information for User Interest Prediction in Hierarchical Edge-Caching Systems. IEEE Open J. Commun. Soc. 3: 508-517 (2022) - 2021
- [b1]Sajad Mehrizi:
Probabilistic Content Popularity Learning in Proactive Caching Systems. University of Luxembourg, Luxembourg City, Luxembourg, 2021 - [j7]Sajad Mehrizi, Thang X. Vu, Symeon Chatzinotas, Björn E. Ottersten:
Trend-Aware Proactive Caching via Tensor Train Decomposition: A Bayesian Viewpoint. IEEE Open J. Commun. Soc. 2: 975-989 (2021) - 2020
- [j6]Sajad Mehrizi, Saikat Chatterjee, Symeon Chatzinotas, Björn E. Ottersten:
Online Spatiotemporal Popularity Learning via Variational Bayes for Cooperative Caching. IEEE Trans. Commun. 68(11): 7068-7082 (2020) - [c5]Sajad Mehrizi, Symeon Chatzinotas, Björn E. Ottersten:
Content Request Prediction with Temporal Trend for Proactive Caching. PIMRC 2020: 1-7
2010 – 2019
- 2019
- [j5]Sajad Mehrizi, Anestis Tsakmalis, Symeon Chatzinotas, Björn E. Ottersten:
A Bayesian Poisson-Gaussian Process Model for Popularity Learning in Edge-Caching Networks. IEEE Access 7: 92341-92354 (2019) - [c4]Sajad Mehrizi, Anestis Tsakmalis, Symeon Chatzinotas, Björn E. Ottersten:
Content Popularity Estimation in Edge-Caching Networks from Bayesian Inference Perspective. CCNC 2019: 1-6 - [c3]Sajad Mehrizi, Anestis Tsakmalis, Shahram ShahbazPanahi, Symeon Chatzinotas, Björn E. Ottersten:
Popularity Tracking for Proactive Content Caching with Dynamic Factor Analysis. ICCC 2019: 875-880 - [c2]Sajad Mehrizi, Anestis Tsakmalis, Symeon Chatzinotas, Björn E. Ottersten:
A Feature-Based Bayesian Method for Content Popularity Prediction in Edge-Caching Networks. WCNC 2019: 1-6 - 2017
- [j4]Sajad Mehrizi, Sara Khosravi, Mahmoud Ahmadian:
An Efficient Procedure for Bilayer-Expurgated LDPC Codes Design in Cooperative Relay Channels. IEEE Commun. Lett. 21(10): 2114-2117 (2017) - [j3]Sajad Mehrizi, Behrad Mahboobi:
Cooperative MIMO relay beamforming in overloaded DS/CDMA multicast networks. IET Commun. 11(3): 344-354 (2017) - 2016
- [j2]Mohammad Amin Maleki Sadr, Behrad Mahboobi, Sajad Mehrizi, Mahmoud Ahmadian-Attari, Mehrdad Ardebilipour:
Stochastic Robust Collaborative Beamforming: Non-Regenerative Relay. IEEE Trans. Commun. 64(3): 947-958 (2016) - 2015
- [j1]Behrad Mahboobi, Sajad Mehrizi, Mehrdad Ardebilipour:
Multicast Relay Beamforming in CDMA Networks: Nonregenerative Approach. IEEE Commun. Lett. 19(8): 1418-1421 (2015) - 2014
- [c1]Mohammad Amin Maleki, Sajad Mehrizi, Mahmoud Ahmadian:
Distributed robust beamforming in multi-user relay network. WCNC 2014: 904-907
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 2025-01-09 13:04 CET 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:
