Emre telatar biography for kids
•
Emre Telatar
Biography
I. Emre Telatar received the degree in electrical engineering from the Middle East Technical University, Ankara, Turkey, in He received the S.M. and Ph.D. degrees in electrical engineering and computer science from the Massachusetts Institute of Technology, Cambridge, in and respectively. In , he joined the Communications Analysis Research Department at AT&T Bell Laboratories (later Lucent Technologies), Murray Hill, NJ. He has been at the EPFL since Emre Telatar was the recipient of the IEEE Information Theory Society Paper Award in He was a schema co-chair for the IEEE International Symposium on kunskap Theory in , and associate editor for Shannon Theory for the IEEE Information Theory Transactions from to He was awarded the EPFL Agepoly teaching prize in Emre Telatar's research interests are in communication and information theories.CONTACT
Secretariat Yvonne Huskie Building INR Station 14 CH Lausanne Tel. 41•
This is a page with all possible (non-custom) blocks
Used to be "Covid updates"
Awards
Aaron D. Wyner Distinguished Service Award
The Aaron D. Wyner Distinguished Service Award honors an individual who has shown outstanding leadership in, and provided long-standing, exceptional service to, the Information Theory community.
Claude E. Shannon Award
The Claude E. Shannon Award is the highest honor from the IEEE Information Theory Society. The award has been instituted to honor consistent and profound contributions to the field of information theory.
Goldsmith Lecturer
The Goldsmith Lecturer Program was established with a generous gift of Dr. Andrea Goldsmith in The Goldsmith Lecture will be delivered by an early-career woman researcher at one of the ITSoc’s Schools of Information Theory, held for the benefit of students and postdoctoral researchers.
Information Theory Society Paper Award
The Information Theory Society Paper Award is given annually f
•
Topic: Factor Graph Transforms
Abstract: Transforms of functions play an important role in many applications, be it for analysis purposes or for computational complexity reasons. For example, the Fourier Transform of a time function immediately tells us if that function is bandlimited or not. Or, Fast-Fourier-Transform-based techniques can be used to efficiently compute the convolution of two discrete-time functions.
Given that factor graphs represent multivariate functions, it is not surprising that transforms play also an important role for factor graphs. In this presentation, we first present an example of a factor graph transform that helps in the analysis of the partition function of a factor graph. (Many important quantities, in particular w.r.t. the capacity of some channels, can be expressed as the partition function of a factor graph, and so a good understanding of this object and its approximations is a worthwhile endeavor.)
Afterwards, we present an example of a fa