default search action
Navid Tafaghodi Khajavi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2011
- [j1]Navid Tafaghodi Khajavi, Siavash Sadeghi Ivrigh, Seyed Mohammad Sajad Sadough
:
A Novel Framework for Spectrum Sensing in Cognitive Radio Networks. IEICE Trans. Commun. 94-B(9): 2600-2609 (2011)
Conference and Workshop Papers
- 2019
- [c10]Navid Tafaghodi Khajavi, Anthony Kuh:
Decomposition of Covariance Matrix Using Cascade of Trees. APSIPA 2019: 779-783 - [c9]Navid Tafaghodi Khajavi, Anthony Kuh:
Covariance Matrix Decomposition Using Cascade of Linear Tree Transformations. GlobalSIP 2019: 1-5 - 2017
- [c8]Navid Tafaghodi Khajavi:
Latent tree approximation in linear model. ICASSP 2017: 5940-5944 - 2016
- [c7]Navid Tafaghodi Khajavi, Anthony Kuh:
The goodness of covariance selection problem from AUC bounds. Allerton 2016: 1252-1258 - [c6]Navid Tafaghodi Khajavi, Anthony Kuh:
The covariance selection quality for graphs with junction trees through AUC bounds. APSIPA 2016: 1-6 - [c5]Navid Tafaghodi Khajavi, Anthony Kuh:
The quality of tree approximation from AUC bounds. ITA 2016: 1-7 - 2015
- [c4]Navid Tafaghodi Khajavi, Anthony Kuh:
Formulation of the Tree Approximation Problem as a Detection Problem and Relation between the AUC and Information Theory Divergences. INNS Conference on Big Data 2015: 257-264 - 2014
- [c3]Navid Tafaghodi Khajavi, Anthony Kuh, Narayana P. Santhanam:
Spatial correlations for solar PV generation and its tree approximation analysis. APSIPA 2014: 1-5 - 2013
- [c2]Navid Tafaghodi Khajavi, Anthony Kuh:
First order Markov chain approximation of microgrid renewable generators covariance matrix. ISIT 2013: 1207-1211 - 2010
- [c1]Ardalan Alizadeh, Seyed Mohammad Sajad Sadough
Optimal beamforming in cognitive two-way relay networks. PIMRC 2010: 2331-2335
Informal and Other Publications
- 2018
- [i4]Navid Tafaghodi Khajavi, Anthony Kuh:
Model Approximation Using Cascade of Tree Decompositions. CoRR abs/1808.03504 (2018) - 2017
- [i3]Navid Tafaghodi Khajavi:
Latent Tree Approximation in Linear Model. CoRR abs/1710.01838 (2017) - 2016
- [i2]Navid Tafaghodi Khajavi, Anthony Kuh:
The Quality of the Covariance Selection Through Detection Problem and AUC Bounds. CoRR abs/1605.05776 (2016) - [i1]Navid Tafaghodi Khajavi, Anthony Kuh:
The Goodness of Covariance Selection Problem from AUC Bounds. CoRR abs/1608.07015 (2016)
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-04-25 05:53 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: