Martina Cardone

Also published under:M. Cardone

Affiliation

University of Minnesota, Minneapolis, MN, USA

Topic

Random Vector,Error Probability,Gaussian Noise,Proof Of Theorem,Lower Bound,Minimum Mean Square Error,Additive Noise,Almost Surely,Arbitrary Topology,Blocking Probability,Contact Matrix,Convergence Rate,Fault-tolerant,Forward Error Correction,Mean Square Error,Network Path,Number Of Tests,Outage Probability,Over Space,Random Variables,Sample Matrix,Upper Bound,Arbitrary Distribution,Asymptotic Distribution,Coil Design,Computation Time,Continuous Distribution,Decoding,Delay-sensitive Applications,Design Method,Equal Probability,Exhaustive Search,Exponential Family,Feed-forward Network,Feedforward Neural Network Model,Gaussian Random Vector,Information Streams,Interesting Future Direction,Intersection Over Union,Link Capacity,Loss Of Generality,ML-based Methods,Machine Learning,Matrix M,Multipath Environment,Multiple Paths,Neurons In Layer,Pitch Size,Search Algorithm,Secure Communication,

Biography

Martina Cardone received the B.S. (Telecommunications Engineering) and M.S. (Telecommunications Engineering) degrees summa cum laude from the Politecnico di Torino, Italy, in 2009 and 2011, respectively and the M.S. degree in Telecommunications Engineering from Telecom ParisTech, Paris, France, in 2011, as part of a double degree program. Since October 2011, she is a Ph.D. student at Eurecom, France. Her current research focuses on multi-user information theory and its applications to wireless cooperative channels.