He is a Fellow of the Indian National Academy of Engineering, an Associate of the Indian Academy of Sciences, and a recipient of the Swarnajayanti Fellowship from the Department of Science and Technology, and the 2004 Global Indus Technovator Award from the India Business Club at the Massachusetts Institute of Technology .He is also a recipient of the Institute of Electrical and Electronics Engineers Inc , Fortescue Fellowship and Institute of Electrical and Electronics Engineers Inc , Baker Prize Paper Award .In the second part of the talk, we consider an important variant of the search problem: data-driven function optimization.
Large mobile operators are seeing a decline in voice and SMS revenues but data revenues continue to grow strongly.
These trends are driven by large-scale rollouts of high-speed 4G networks, increasing availability of affordable smartphones, tablets and other mobile devices, and growing consumer preference for video applications.
For questions, more information, or to buy discounted tickets, please click the button below.
Abstract: Network management and configuration is an essential attribute of any wireless network with reliable self-tuning capabilities.
In the first part of the talk, we consider the problem of reliably and quickly searching for a parameter of interest in a large signal space in face of measurement noise.
This problem naturally arises in many practical communications systems such as the directional link establishment and maintenance (beam alignment) as well as spectrum sensing for cognitive radios.Watson Research Center , Yorktown Heights, New York .Kumar is co - author of the textbook `Optical Networks : A Practical Perspective' published in February 1998 .Our work aims to provide fundamental limits on the overhead associated with network reconfiguration in general.Our approach relies on fundamental notions in information theory and statistics to quantify the networking overhead and utilizes recent data analytic and machine learning algorithms to develop practical learning/optimization algorithms.We show that, despite the unreliability of observations, by carefully constructing the redundancy, inspired by Shannon's channel coding theorem, the overhead can be kept minimal (and in some settings to grow only logarithmically with the resolution of the search).