1999 - IEEE Fellow For contributions to universal methods of prediction and data compression.
In the subject of Artificial intelligence, Neri Merhav integrates adjacent scientific disciplines such as Class (philosophy) and Probabilistic logic. His research combines Artificial intelligence and Class (philosophy). His research links Statistics with Probabilistic logic. With his scientific publications, his incorporates both Statistics and Random variable. His Operating system study typically links adjacent topics like Redundancy (engineering) and Encoder. He integrates Redundancy (engineering) with Operating system in his study. While working in this field, he studies both Encoder and Data compression. He integrates many fields in his works, including Data compression and Rate–distortion theory. Neri Merhav performs multidisciplinary study in Algorithm and Asymptotically optimal algorithm in his work.
Neri Merhav connects Algorithm with Programming language in his research. He connects Programming language with Algorithm in his study. Neri Merhav brings together Statistics and Markov chain to produce work in his papers. His Artificial intelligence study frequently links to adjacent areas such as Image (mathematics). Discrete mathematics and Combinatorics are two areas of study in which Neri Merhav engages in interdisciplinary work. He incorporates Combinatorics and Discrete mathematics in his research. In his research, he undertakes multidisciplinary study on Decoding methods and Block code. In his work, he performs multidisciplinary research in Block code and Decoding methods. Neri Merhav performs multidisciplinary study in the fields of Theoretical computer science and Artificial intelligence via his papers.
In the subject of Programming language, Neri Merhav integrates adjacent academic fields such as Erasure, Message passing and Set (abstract data type). Many of his studies on Set (abstract data type) apply to Programming language as well. Neri Merhav combines topics linked to Upper and lower bounds and Multiplicative function with his work on Mathematical analysis. He integrates several fields in his works, including Upper and lower bounds and Algorithm. As part of his studies on Algorithm, Neri Merhav often connects relevant areas like Estimation theory. His study in Mathematical analysis extends to Multiplicative function with its themes. Statistics is closely attributed to Threshold model in his study. Neri Merhav integrates many fields, such as Theoretical computer science and Cryptography, in his works. He conducts interdisciplinary study in the fields of Cryptography and Theoretical computer science through his works.
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.
Hidden Markov processes
Y. Ephraim;N. Merhav.
IEEE Transactions on Information Theory (2002)
On information rates for mismatched decoders
N. Merhav;G. Kaplan;A. Lapidoth;S. Shamai Shitz.
international symposium on information theory (1993)
Universal prediction
N. Merhav;M. Feder.
IEEE Transactions on Information Theory (1998)
Universal prediction of individual sequences
M. Feder;N. Merhav;M. Gutman.
IEEE Transactions on Information Theory (1992)
Relations between entropy and error probability
M. Feder;N. Merhav.
international symposium on information theory (1993)
Fast algorithms for DCT-domain image downsampling and for inverse motion compensation
N. Merhav;V. Bhaskaran.
IEEE Transactions on Circuits and Systems for Video Technology (1997)
When is the generalized likelihood ratio test optimal
O. Zeitouni;J. Ziv;N. Merhav.
international symposium on information theory (1991)
A measure of relative entropy between individual sequences with application to universal classification
J. Ziv;N. Merhav.
international symposium on information theory (1993)
A competitive minimax approach to robust estimation of random parameters
Y.C. Eldar;N. Merhav.
IEEE Transactions on Signal Processing (2004)
Guessing subject to distortion
E. Arikan;N. Merhav.
IEEE Transactions on Information Theory (1998)
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:
Stanford University
Tel Aviv University
Technion – Israel Institute of Technology
University of the Republic
University of Siena
Technion – Israel Institute of Technology
Purdue University West Lafayette
MIT
Weizmann Institute of Science
ETH Zurich
Wilfrid Laurier University
Nankai University
Sojo University
Tianjin University
Seoul National University
South China University of Technology
University of Cambridge
Spanish National Research Council
University of Antwerp
University of California, Irvine
University of Helsinki
Icahn School of Medicine at Mount Sinai
Vanderbilt University
McMaster Children's Hospital
University of Amsterdam
The University of Texas Health Science Center at San Antonio