2005 - IEEE Fellow For contributions to adaptive sensor signal processing.
Vikram Krishnamurthy mainly focuses on Mathematical optimization, Markov process, Markov chain, Algorithm and Markov model. His work deals with themes such as Expectation–maximization algorithm, Scheduling, Automatic repeat request and Fading, which intersect with Mathematical optimization. His Markov process study which covers Optimal control that intersects with Retransmission.
The Markov chain study combines topics in areas such as Particle filter, Estimator, Maximum a posteriori estimation and Hidden Markov model. His Algorithm research incorporates elements of Code division multiple access and Stochastic approximation. His Markov model research is multidisciplinary, incorporating elements of White noise, Artificial intelligence and Pattern recognition.
His primary areas of investigation include Mathematical optimization, Algorithm, Markov process, Markov chain and Artificial intelligence. His Mathematical optimization study integrates concerns from other disciplines, such as Stochastic approximation, Stochastic process, Communication channel, Markov decision process and Applied mathematics. Vikram Krishnamurthy has researched Communication channel in several fields, including Transmission and Computer network.
Vikram Krishnamurthy has included themes like Kalman filter, Code division multiple access, Hidden Markov model and Expectation–maximization algorithm in his Algorithm study. Markov process is often connected to Control theory in his work. His studies deal with areas such as Radar, Machine learning, Computer vision and Pattern recognition as well as Artificial intelligence.
Vikram Krishnamurthy focuses on Mathematical optimization, Markov decision process, Algorithm, Artificial intelligence and Partially observable Markov decision process. His Mathematical optimization research integrates issues from State, Bounded function, Bayesian probability, Markov chain and Sequence. Vikram Krishnamurthy does research in Markov chain, focusing on Markov property specifically.
His Markov decision process study combines topics from a wide range of disciplines, such as Linear programming, Scheduling, Optimal control and Estimator. His Algorithm research is multidisciplinary, relying on both Kernel, Weak convergence, Covariance, Waveform and Hidden Markov model. His Probability distribution course of study focuses on Sampling distribution and Markov process.
His primary areas of study are Algorithm, Friendship paradox, Markov chain, Mathematical optimization and Artificial intelligence. The concepts of his Algorithm study are interwoven with issues in Posterior probability, Filter, Stochastic process, Covariance and Sequence. He combines subjects such as Stochastic volatility, Convergence, Markov decision process, Applied mathematics and Hidden Markov model with his study of Markov chain.
His biological study focuses on Stochastic optimization. His research on Stochastic optimization also deals with topics like
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Particle filters for state estimation of jump Markov linear systems
A. Doucet;N.J. Gordon;V. Krishnamurthy.
IEEE Transactions on Signal Processing (2001)
Performance analysis of a dynamic programming track before detect algorithm
L.A. Johnston;V. Krishnamurthy.
IEEE Transactions on Aerospace and Electronic Systems (2002)
On-line estimation of hidden Markov model parameters based on the Kullback-Leibler information measure
V. Krishnamurthy;J.B. Moore.
IEEE Transactions on Signal Processing (1993)
Algorithms for optimal scheduling and management of hidden Markov model sensors
V. Krishnamurthy.
IEEE Transactions on Signal Processing (2002)
Optimal Joint Session Admission Control in Integrated WLAN and CDMA Cellular Networks with Vertical Handoff
F. Yu;V. Krishnamurthy.
IEEE Transactions on Mobile Computing (2007)
Decentralized dynamic spectrum access for cognitive radios: cooperative design of a non-cooperative game
M. Maskery;V. Krishnamurthy;Qing Zhao.
IEEE Transactions on Communications (2009)
Expectation maximization algorithms for MAP estimation of jump Markov linear systems
A. Logothetis;V. Krishnamurthy.
IEEE Transactions on Signal Processing (1999)
An improvement to the interacting multiple model (IMM) algorithm
L.A. Johnston;V. Krishnamurthy.
IEEE Transactions on Signal Processing (2001)
Stochastic sampling algorithms for state estimation of jump Markov linear systems
A. Doucet;A. Logothetis;V. Krishnamurthy.
IEEE Transactions on Automatic Control (2000)
Structured Threshold Policies for Dynamic Sensor Scheduling—A Partially Observed Markov Decision Process Approach
V. Krishnamurthy;D.V. Djonin.
IEEE Transactions on Signal Processing (2007)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
University of Connecticut
University of Adelaide
Royal Institute of Technology
Australian National University
University of Melbourne
University of Oxford
University of Melbourne
Princeton University
Curtin University
Shenzhen University
Technical University of Berlin
Cornell University
University of Waterloo
Qualcomm (United Kingdom)
Gaziantep University
Royal Institution of Great Britain
Harvard University
Cornell University
United States Department of Agriculture
Université de Caen Normandie
Norwegian University of Science and Technology
University of Helsinki
Scripps Research Institute
University of Montreal
Duke University
University College London