Vahid Tarokh

From MaRDI portal
Person:553727

Available identifiers

zbMath Open tarokh.vahidMaRDI QIDQ553727

List of research outcomes





PublicationDate of PublicationType
Bayesian quickest change detection for unnormalized and score-based models2024-10-17Paper
Identifying latent stochastic differential equations2024-09-12Paper
Quickest change detection for unnormalized statistical models2024-07-22Paper
Region selection in Markov random fields: Gaussian case2023-06-05Paper
https://portal.mardi4nfdi.de/entity/Q50532812022-12-06Paper
Large deviations of convex polyominoes2022-10-04Paper
Near Field Resonator Isolation System: Theory to Implementation2021-08-26Paper
On Statistical Efficiency in Learning2021-07-22Paper
Convergence Rate of Empirical Spectral Distribution of Random Matrices From Linear Codes2021-02-24Paper
Bayesian Model Comparison with the Hyvärinen Score: Computation and Consistency2020-01-15Paper
Distributed Online Convex Optimization with Improved Dynamic Regret2019-11-12Paper
Asymptotically Optimal Prediction for Time-Varying Data Generating Processes2019-07-19Paper
Estimation of the Evolutionary Spectra With Application to Stationarity Test2019-03-06Paper
Analysis of Multistate Autoregressive Models2019-02-12Paper
Corrections to “Asymptotic Achievability of the Cramér–Rao Bound for Noisy Compressive Sampling” [Mar 09 1233-1236]2019-02-08Paper
On Sequential Elimination Algorithms for Best-Arm Identification in Multi-Armed Bandits2019-02-08Paper
Multiple Change Point Analysis: Fast Implementation and Strong Consistency2019-02-08Paper
SLANTS: Sequential Adaptive Nonlinear Modeling of Time Series2019-02-08Paper
Prediction in Online Convex Optimization for Parametrizable Objective Functions2019-01-31Paper
Bridging AIC and BIC: A New Criterion for Autoregression2018-09-14Paper
Convergence of Limited Communications Gradient Methods2018-09-14Paper
Asymptotically Pseudo-Independent Matrices2018-09-02Paper
A Coding Theory Approach to Noisy Compressive Sensing Using Low Density Frames2018-07-18Paper
Asymptotic Achievability of the CramÉr–Rao Bound for Noisy Compressive Sampling2018-07-09Paper
SPARLS: The Sparse RLS Algorithm2018-07-09Paper
Symmetric Pseudo-Random Matrices2018-07-09Paper
Pseudo-Wigner Matrices2018-07-09Paper
An Adaptive Greedy Algorithm With Application to Nonlinear Communications2018-07-09Paper
On Bounds and Algorithms for Frequency Synchronization for Collaborative Communication Systems2018-06-27Paper
A Frame Construction and a Universal Distortion Bound for Sparse Representations2018-06-27Paper
Collaborative beamforming for distributed wireless ad hoc sensor networks2017-09-20Paper
Differential space time block codes using nonconstant modulus constellations2017-09-08Paper
On the Spectral Norms of Pseudo-Wigner and Related Matrices2017-08-14Paper
Rate of Channel Hardening of Antenna Selection Diversity Schemes and Its Implication on Scheduling2017-08-08Paper
GADIA: A Greedy Asynchronous Distributed Interference Avoidance Algorithm2017-07-27Paper
Shannon-Theoretic Limits on Noisy Compressive Sampling2017-07-27Paper
Cognitive Networks Achieve Throughput Scaling of a Homogeneous Network2017-07-12Paper
Spectral Distribution of Random Matrices From Binary Linear Block Codes2017-07-12Paper
Achievable Rate Regions and Performance Comparison of Half Duplex Bi-Directional Relaying Protocols2017-07-12Paper
Bounds on the Capacity of Discrete Memoryless Channels Corrupted by Synchronization and Substitution Errors2017-07-12Paper
Beam Selection Gain Versus Antenna Selection Gain2017-07-12Paper
Spectral Distribution of Product of Pseudorandom Matrices Formed From Binary Block Codes2017-06-08Paper
Analysis of the Impact of Nonlinearity on the Capacity of Communication Channels2017-06-08Paper
A Note on the Concentration of Spectral Measure of Wigner's Matrices2017-04-19Paper
Complementary Lattice Arrays for Coded Aperture Imaging2015-06-06Paper
The Number of Independent Sets in Hexagonal Graphs2015-05-26Paper
Adaptive algorithms for sparse system identification2011-07-27Paper
Performance Bounds for Bidirectional Coded Cooperation Protocols2009-02-24Paper
A new construction of 16-QAM golay complementary sequences2008-12-21Paper
Achievable rates in cognitive radio channels2008-12-21Paper
Variable-Rate Two-Phase Collaborative Communication Protocols for Wireless Networks2008-12-21Paper
Space–Time Diversity Enhancements Using Collaborative Communications2008-12-21Paper
On compound channels with side information at the transmitter2008-12-21Paper
Correction to “A New Construction of 16-QAM Golay Complementary Sequences”2008-12-21Paper
Multiple-Antenna Channel Hardening and Its Implications for Rate Feedback and Scheduling2008-12-21Paper
Energy reduction in VLSI computation modules: an information-theoretic approach2005-06-01Paper
Existence and construction of noncoherent unitary space-time codes2005-05-11Paper
https://portal.mardi4nfdi.de/entity/Q44608152004-03-29Paper
Space-time codes for wireless optical communications2002-08-12Paper
Multiple transmit antenna differential detection from generalized orthogonal designs2002-08-04Paper
A construction of OFDM 16-QAM sequences having low peak powers2002-08-04Paper
A simple encodable/decodable OFDM QPSK code with low peak-to-mean envelope power ratio2002-08-04Paper
Space-time codes for high data rate wireless communication: Performance criteria in the presence of channel estimation errors, mobility, and multiple paths2002-05-14Paper
Multiple description trellis-coded quantization2001-09-04Paper
On the existence and construction of good codes with low peak-to-average power ratios2001-03-19Paper
Correction to "Space-time block codes from orthogonal designs"2000-09-07Paper
Space-time block codes from orthogonal designs1999-11-21Paper
Combined array processing and space-time coding1999-11-21Paper
Universal bound on the performance of lattice codes1999-11-21Paper
Design of successively refinable trellis-coded quantizers1999-11-21Paper
Space-time codes for high data rate wireless communication: performance criterion and code construction1999-04-25Paper
Existence of optimal prefix codes for infinite source alphabets1998-06-08Paper
Trellis complexity versus the coding gain of lattices. I1998-03-10Paper
Trellis complexity versus the coding gain of lattices. II1998-03-10Paper
Upper bounds on trellis complexity of lattices1998-03-05Paper
On the Trellis Complexity of the Densest Lattice Packings in $\mathbb{R}^n $1996-12-01Paper
A Constraint on the Existence of Simple Torsion-Free Lie Modules1996-01-30Paper

Research outcomes over time

This page was built for person: Vahid Tarokh