Name
Papers
Collaborators
JOAKIM JALDEN
40
44
Citations 
PageRank 
Referers 
243
21.59
519
Referees 
References 
615
437
Search Limit
100615
Title
Citations
PageRank
Year
A geometrically converging dual method for distributed optimization over time-varying graphs.20.352021
Model-Based Adaptive Modulation and Coding with Latent Thompson Sampling00.342021
Wireless link adaptation with outdated CSI — a hybrid data-driven and model-based approach00.342020
Bayesian Link Adaptation under a BLER Target10.382020
On the Q-linear convergence of Distributed Generalized ADMM under non-strongly convex function components40.372019
Constrained Thompson Sampling for Wireless Link Optimization.00.342019
Optimal UAV Base Station Trajectories Using Flow-Level Models for Reinforcement Learning30.382019
Clock Synchronization Over Networks: Identifiability of the Sawtooth Model00.342019
Cell Detection On Image-Based Immunoassays00.342018
Perspectives in Signal Processing for Communications and Networking: Spotlight on the IEEE Signal Processing Society Technical Committees [In the Spotlight].00.342018
Panda: A Dual Linearly Converging Method For Distributed Optimization Over Time-Varying Undirected Graphs30.412018
Cell Detection by Functional Inverse Diffusion and Non-Negative Group Sparsity - Part II: Proximal Optimization and Performance Evaluation.00.342018
Cell Detection by Functional Inverse Diffusion and Nonnegative Group Sparsity - Part I: Modeling and Inverse Problems.00.342018
A general method for the design of tree networks under communication constraints00.342015
Global linking of cell tracks using the viterbi algorithm.251.002015
Bayesian Design of Tandem Networks for Distributed Detection With Multi-Bit Sensor Decisions.00.342014
MIMO Detection by Lagrangian Dual Maximum-Likelihood Relaxation: Reinterpreting Regularized Lattice Decoding170.642014
Sparse Conjoint Analysis Through Maximum Likelihood Estimation80.582013
Rate-Reliability-Complexity Tradeoff For Ml And Lattice Decoding Of Full-Rate Codes10.352013
Sphere Decoding Complexity Exponent for Decoding Full-Rate Codes Over the Quasi-Static MIMO Channel220.782012
A batch algorithm using iterative application of the Viterbi algorithm to track cells and construct cell lineages201.442012
Maximum likelihood based sparse and distributed conjoint analysis20.432012
Robust binary least squares: Relaxations and algorithms00.342011
Vanishing the gap to exact lattice search at a subexponential complexity: LR-aided regularized decoding.00.342011
Achieving a Vanishing SNR Gap to Exact Lattice Decoding at a Subexponential Complexity160.732011
Lattice Reduction.00.342011
Gaussian mixture modeling for source localization40.462011
Semidefinite Relaxations of Robust Binary Least Squares Under Ellipsoidal Uncertainty Sets30.412011
Fundamental rate-reliability-complexity limits in outage limited MIMO communications10.392010
Linear Prediction Of Discrete-Time 1/F Processes10.372010
DMT Optimality of LR-Aided Linear Decoders for a General Class of Channels, Lattice Designs, and System Models501.632010
Vector perturbation precoding for receivers with limited dynamic range30.412009
Achieving a Continuous Diversity-Complexity Tradeoff in Wireless MIMO Systems via Pre-Equalized Sphere-Decoding50.462009
Tail behavior of sphere-decoding complexity in random lattices40.452009
Performance Assessment of MIMO-BICM Demodulators based on System Capacity40.532009
The Equivalence of Semidefinite Relaxation MIMO Detectors for Higher-Order QAM311.662009
Soft sphere decoder for an iterative receiver in time-varying MIMO channels00.342008
Soft MIMO Detection at Fixed Complexity20.622007
Channel Dependent Termination of the Semidefinite Relaxation Detector10.392006
REDUCING THE AVERAGE COMPLEXITY OF ML DETECTION USING SEMIDEFINITE RELAXATION101.222005