Zobrazeno 1 - 10
of 24
pro vyhledávání: '"Navid Tafaghodi Khajavi"'
Publikováno v:
International Journal of Information and Communication Technology Research, Vol 3, Iss 4, Pp 27-35 (2011)
Cognitive radio technology has been proposed as a key solution for the problem of inefficient usage of spectrum bands. Spectrum sensing is one of the most important issues in each cognitive radio system. Classically-used spectrum sensing techniques r
Externí odkaz:
https://doaj.org/article/57ecc793bc934d6fbf4bcd861e7d458f
Autor:
Navid Tafaghodi Khajavi, Anthony Kuh
Publikováno v:
GlobalSIP
The tree model can be computed efficiently using the Chow-Liu algorithm to minimize the Kullback-Leibler (KL) divergence. This paper goes beyond tree approximations by systematically forming a cascade of linear transformations where each linear trans
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::efd8c9da42fe7141cf0271283b3e57de
https://doi.org/10.1109/globalsip45357.2019.8969543
https://doi.org/10.1109/globalsip45357.2019.8969543
Autor:
Anthony Kuh, Navid Tafaghodi Khajavi
Publikováno v:
APSIPA
We are looking at the statistical model approximation for jointly Gaussian random vectors. To do so, we are using a cascade of linear transformations that go beyond tree approximations. Here, we propose an algorithm which incorporates the Cholesky fa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::12379b387e64b99f7c5c99883365a0b8
https://doi.org/10.1109/apsipaasc47483.2019.9023154
https://doi.org/10.1109/apsipaasc47483.2019.9023154
Autor:
Anthony Kuh, Navid Tafaghodi Khajavi
Publikováno v:
APSIPA Transactions on Signal and Information Processing. 7
Graphical models are increasingly being used in many complex engineering problems to model the dynamics between states of the graph. These graphs are often very large and approximation models are needed to reduce the computational complexity. This pa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4d91ddc0f82ba7b343a4974b4691815c
https://doi.org/10.1017/atsip.2018.20
https://doi.org/10.1017/atsip.2018.20
Autor:
Navid Tafaghodi Khajavi, Anthony Kuh
Publikováno v:
INNS Conference on Big Data
This paper looks at graphical models and discusses the quality of tree approximations by ex- amining information measures and formulating the problem as a detection problem. One of the widely used algorithms for tree-structured approximation and mode
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::034883a3ea5689c4e0c2ea386f30f8d2
https://doi.org/10.1016/j.procs.2015.07.302
https://doi.org/10.1016/j.procs.2015.07.302
Autor:
Navid Tafaghodi Khajavi
Publikováno v:
ICASSP
We consider the problem of learning underlying tree structure from noisy, mixed data obtained from a linear model. To achieve this, we use the expectation maximization algorithm combined with Chow-Liu minimum spanning tree algorithm. This algorithm i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1b511abba671be67e482bd7c373bb652
Autor:
Anthony Kuh, Navid Tafaghodi Khajavi
Publikováno v:
APSIPA
We conduct a study of graphical models and discuss the quality of model selection approximation by formulating the problem as a detection problem and examine the area under the curve (AUC). We are specifically looking at the model selection problem f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6c5b33865933653f40fd4f6fb0f44352
https://doi.org/10.1109/apsipa.2016.7820837
https://doi.org/10.1109/apsipa.2016.7820837
Autor:
Anthony Kuh, Navid Tafaghodi Khajavi
Publikováno v:
Allerton
We conduct a study of graphical models and discuss the quality of model selection approximation by formulating the problem as a detection problem and examining the area under the curve (AUC). We are specifically looking at the model selection problem
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7bf745ddaa87a03d0154d847fd7ee713
http://arxiv.org/abs/1608.07015
http://arxiv.org/abs/1608.07015
Autor:
Navid Tafaghodi Khajavi, Anthony Kuh
We consider the problem of quantifying the quality of a model selection problem for a graphical model. We discuss this by formulating the problem as a detection problem. Model selection problems usually minimize a distance between the original distri
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8f196370288bf78172abf9099587cd19
Autor:
Navid Tafaghodi Khajavi, Anthony Kuh
Publikováno v:
ITA
This paper looks at graphical models and discusses the quality of tree approximations by formulating the problem as a detection problem. One of the widely used algorithms for tree-structured approximation and modeling is the Chow-Liu algorithm. While
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3b65686ddcc8666f0fc1f5a4d1adbc81
https://doi.org/10.1109/ita.2016.7888151
https://doi.org/10.1109/ita.2016.7888151