A geometrically converging dual method for distributed optimization over time-varying graphs. | 2 | 0.35 | 2021 |
Model-Based Adaptive Modulation and Coding with Latent Thompson Sampling | 0 | 0.34 | 2021 |
Wireless link adaptation with outdated CSI — a hybrid data-driven and model-based approach | 0 | 0.34 | 2020 |
Bayesian Link Adaptation under a BLER Target | 1 | 0.38 | 2020 |
On the Q-linear convergence of Distributed Generalized ADMM under non-strongly convex function components | 4 | 0.37 | 2019 |
Constrained Thompson Sampling for Wireless Link Optimization. | 0 | 0.34 | 2019 |
Optimal UAV Base Station Trajectories Using Flow-Level Models for Reinforcement Learning | 3 | 0.38 | 2019 |
Clock Synchronization Over Networks: Identifiability of the Sawtooth Model | 0 | 0.34 | 2019 |
Cell Detection On Image-Based Immunoassays | 0 | 0.34 | 2018 |
Perspectives in Signal Processing for Communications and Networking: Spotlight on the IEEE Signal Processing Society Technical Committees [In the Spotlight]. | 0 | 0.34 | 2018 |
Panda: A Dual Linearly Converging Method For Distributed Optimization Over Time-Varying Undirected Graphs | 3 | 0.41 | 2018 |
Cell Detection by Functional Inverse Diffusion and Non-Negative Group Sparsity - Part II: Proximal Optimization and Performance Evaluation. | 0 | 0.34 | 2018 |
Cell Detection by Functional Inverse Diffusion and Nonnegative Group Sparsity - Part I: Modeling and Inverse Problems. | 0 | 0.34 | 2018 |
A general method for the design of tree networks under communication constraints | 0 | 0.34 | 2015 |
Global linking of cell tracks using the viterbi algorithm. | 25 | 1.00 | 2015 |
Bayesian Design of Tandem Networks for Distributed Detection With Multi-Bit Sensor Decisions. | 0 | 0.34 | 2014 |
MIMO Detection by Lagrangian Dual Maximum-Likelihood Relaxation: Reinterpreting Regularized Lattice Decoding | 17 | 0.64 | 2014 |
Sparse Conjoint Analysis Through Maximum Likelihood Estimation | 8 | 0.58 | 2013 |
Rate-Reliability-Complexity Tradeoff For Ml And Lattice Decoding Of Full-Rate Codes | 1 | 0.35 | 2013 |
Sphere Decoding Complexity Exponent for Decoding Full-Rate Codes Over the Quasi-Static MIMO Channel | 22 | 0.78 | 2012 |
A batch algorithm using iterative application of the Viterbi algorithm to track cells and construct cell lineages | 20 | 1.44 | 2012 |
Maximum likelihood based sparse and distributed conjoint analysis | 2 | 0.43 | 2012 |
Robust binary least squares: Relaxations and algorithms | 0 | 0.34 | 2011 |
Vanishing the gap to exact lattice search at a subexponential complexity: LR-aided regularized decoding. | 0 | 0.34 | 2011 |
Achieving a Vanishing SNR Gap to Exact Lattice Decoding at a Subexponential Complexity | 16 | 0.73 | 2011 |
Lattice Reduction. | 0 | 0.34 | 2011 |
Gaussian mixture modeling for source localization | 4 | 0.46 | 2011 |
Semidefinite Relaxations of Robust Binary Least Squares Under Ellipsoidal Uncertainty Sets | 3 | 0.41 | 2011 |
Fundamental rate-reliability-complexity limits in outage limited MIMO communications | 1 | 0.39 | 2010 |
Linear Prediction Of Discrete-Time 1/F Processes | 1 | 0.37 | 2010 |
DMT Optimality of LR-Aided Linear Decoders for a General Class of Channels, Lattice Designs, and System Models | 50 | 1.63 | 2010 |
Vector perturbation precoding for receivers with limited dynamic range | 3 | 0.41 | 2009 |
Achieving a Continuous Diversity-Complexity Tradeoff in Wireless MIMO Systems via Pre-Equalized Sphere-Decoding | 5 | 0.46 | 2009 |
Tail behavior of sphere-decoding complexity in random lattices | 4 | 0.45 | 2009 |
Performance Assessment of MIMO-BICM Demodulators based on System Capacity | 4 | 0.53 | 2009 |
The Equivalence of Semidefinite Relaxation MIMO Detectors for Higher-Order QAM | 31 | 1.66 | 2009 |
Soft sphere decoder for an iterative receiver in time-varying MIMO channels | 0 | 0.34 | 2008 |
Soft MIMO Detection at Fixed Complexity | 2 | 0.62 | 2007 |
Channel Dependent Termination of the Semidefinite Relaxation Detector | 1 | 0.39 | 2006 |
REDUCING THE AVERAGE COMPLEXITY OF ML DETECTION USING SEMIDEFINITE RELAXATION | 10 | 1.22 | 2005 |