Jüri Lember

According to our database, Jüri Lember authored at least 10 papers between 2003 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2024

Equal Requests are Asymptotically Hardest for Data Recovery.

Jüri Lember, Ago-Erik Riet

Proceedings of the IEEE International Symposium on Information Theory, 2024

2021

Regenerativity of Viterbi process for pairwise Markov models.

Jüri Lember, Joonas Sova

CoRR, 2021

2020

MAP segmentation in Bayesian hidden Markov models: a case study.

Alexey A. Koloydenko, Kristi Kuljus, Jüri Lember

CoRR, 2020

2019

An evolutionary model that satisfies detailed balance.

Jüri Lember, Chris Watkins

CoRR, 2019

2015

New bounds for permutation codes in Ulam metric.

Faruk Göloglu, Jüri Lember, Ago-Erik Riet, Vitaly Skachek

Proceedings of the IEEE International Symposium on Information Theory, 2015

2014

Bridging Viterbi and posterior decoding: a generalized risk approach to hidden path inference based on hidden Markov models.

Jüri Lember, Alexey A. Koloydenko

J. Mach. Learn. Res., 2014

2013

On the accuracy of the Viterbi alignment.

Kristi Kuljus, Jüri Lember

CoRR, 2013

2010

A constructive proof of the existence of Viterbi processes.

Jüri Lember, Alexey A. Koloydenko

IEEE Trans. Inf. Theory, 2010

A generalized risk-based approach to segmentation based on hidden Markov models

Jüri Lember, Alexey A. Koloydenko

CoRR, 2010

2003

On minimizing sequences for k-centres.

Jüri Lember

J. Approx. Theory, 2003