Demo Data from SIGIR 2026 / reviewers in the wild / expert
Ehsan Yazdian
dblp:56/8141
· DBLP profile ↗
5ranked-venue papers
4as first author
0since 2021 · last 2018
0000-0002-0425-4732ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 first-authorSystems, architecture and hardware · 1Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-authorTheory of computation · 1 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
1 paper |
Information theory · 50% Algorithms and data structures · 25% Mathematical optimization · 25% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Mathematical optimization › statistical estimation
covariance estimation |
0.2 | 1 | 2016 | Eigenvalue Estimation of the Exponentially Windowed Sample Covariance Matrices · IEEE Trans. Inf. Theory 2016 |
Algorithms and data structures › numerical linear algebra › eigenvalue computation
eigenvalue approximation |
0.2 | 1 | 2016 | Eigenvalue Estimation of the Exponentially Windowed Sample Covariance Matrices · IEEE Trans. Inf. Theory 2016 |
Information theory › probability theory
random matrix theory |
0.2 | 1 | 2016 | Eigenvalue Estimation of the Exponentially Windowed Sample Covariance Matrices · IEEE Trans. Inf. Theory 2016 |
Information theory › probability theory › random matrix theory
wishart matrices |
0.2 | 1 | 2016 | Eigenvalue Estimation of the Exponentially Windowed Sample Covariance Matrices · IEEE Trans. Inf. Theory 2016 |
Methods — techniques the papers use, named apart from their topics
residue theorem · 0.2random matrix theory · 0.2complex integration · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2018 | Hardware Implementation of Iterative Method With Adaptive Thresholding for Random Sampling Recovery of Sparse Signals
Mohammad Fardad, Sayed Masoud Sayedi, Ehsan Yazdian |
IEEE Trans. Very Large Scale Integr. Syst. | 3 |
| 2016 | Eigenvalue Estimation of the Exponentially Windowed Sample Covariance MatricesabstractIn this paper, we consider an exponentially windowed sample covariance matrix (EWSCM) and propose an improved estimator for its eigenvalues. We use new advances in random matrix theory, which describe the limiting spectral distribution of the large dimensional doubly correlated Wishart matrices to find the support and distribution of the eigenvalues of the EWSCM. We then employ the complex integration and residue theorem to design an estimator for the eigenvalues, which satisfies the cluster separability condition, assuming that the eigenvalue multiplicities are known. We show that the proposed estimator is consistent in the asymptotic regime and has good performance in finite sample size situations. Simulation results show that the proposed estimator outperforms the traditional estimator, significantly. Ehsan Yazdian, Saeed Gazor, Mohammad Hasan Bastani, Mohsen Sharifitabar |
IEEE Trans. Inf. Theory | 1 |
| 2012 | Spectral distribution of the exponentially windowed sample covariance matrixabstractIn this paper, we investigate the effect of applying an exponential window on the limiting spectral distribution (l.s.d.) of the exponentially windowed sample covariance matrix (SCM) of complex array data. We use recent advances in random matrix theory which describe the distribution of eigenvalues of the doubly correlated Wishart matrices. We derive an explicit expression for the l.s.d. of the noise-only data. Simulations are performed to support our theoretical claims. Ehsan Yazdian, Mohammad Hasan Bastani, Saeed Gazor |
ICASSP | 1 |
| 2012 | Source enumeration in large arrays using moments of eigenvalues and relatively few samplesabstractThis study presents a method based on minimum description length criterion to enumerate the incident waves impinging on a large array using a relatively small number of samples. The proposed scheme exploits the statistical properties of eigenvalues of the sample covariance matrix (SCM) of Gaussian processes. The authors use a number of moments of noise eigenvalues of the SCM in order to separate noise and signal subspaces more accurately. In particular, the authors assume a Marcenko–Pastur probability density function (pdf) for the eigenvalues of SCM associated with the noise subspace. We also use an enhanced noise variance estimator to reduce the bias leakage between the subspaces. Numerical simulations demonstrate that the proposed method estimates the true number of signals for large arrays and a relatively small number of snapshots. In particular, the proposed method requires less number of samples to achieve the same correct enumeration probability compared to the state-of-the-art methods. The authors evaluated the assumed pdf in order to justify the limitation and the behaviour of the proposed method for small number of snapshots and array sizes. Ehsan Yazdian, Saeed Gazor, Mohammad Hasan Bastani |
IET Signal Process. | 1 |
| 2006 | Adaptive Modulation Technique for cooperative diversity in Wireless Fading ChannelsabstractIn recent years, cooperative diversity techniques have gained increased attention as a new way to combat degrading effects of fading. Cooperation among two or more single antenna users generates a virtual diverse multiple-antenna transmission system in the wireless network. In this paper, we investigate the application of adaptive modulation concept to the performance of cooperative techniques. We consider the adaptation of rate and power allocation with M-QAM modulation, and study the performance of amplify & forward scenarios in Rayleigh fading channels. We compare these systems with their comparable adaptive non-cooperative scenario and evaluate the energy saving achieved through cooperation Ehsan Yazdian, Mohammad Reza Pakravan |
PIMRC | 1 |