Jüri Lember

14 papers B 2Journal 12
YearRankTypeTitle / Venue / Authors
2025 J jnl
Branch-and-bound method for calculating Viterbi path in triplet Markov models.
CoRR
Oskar Soop, Jüri Lember
2024 B conf
Equal Requests are Asymptotically Hardest for Data Recovery.
ISIT
Jüri Lember, Ago-Erik Riet
2024 J jnl
Equal Requests are Asymptotically Hardest for Data Recovery.
CoRR
Jüri Lember, Ago-Erik Riet
2021 J jnl
Regenerativity of Viterbi process for pairwise Markov models.
CoRR
Jüri Lember, Joonas Sova
2020 J jnl
MAP segmentation in Bayesian hidden Markov models: a case study.
CoRR
Alexey A. Koloydenko, Kristi Kuljus, Jüri Lember
2019 J jnl
An evolutionary model that satisfies detailed balance.
CoRR
Jüri Lember, Chris Watkins
2015 J jnl
New Bounds for Permutation Codes in Ulam Metric.
CoRR
Faruk Göloglu, Jüri Lember, Ago-Erik Riet, Vitaly Skachek
2015 B conf
New bounds for permutation codes in Ulam metric.
ISIT
Faruk Göloglu, Jüri Lember, Ago-Erik Riet, Vitaly Skachek
2014 J jnl
Bridging Viterbi and posterior decoding: a generalized risk approach to hidden path inference based on hidden Markov models.
J. Mach. Learn. Res.
Jüri Lember, Alexey A. Koloydenko
2013 J jnl
On the accuracy of the Viterbi alignment.
CoRR
Kristi Kuljus, Jüri Lember
2010 J jnl
A constructive proof of the existence of Viterbi processes.
IEEE Trans. Inf. Theory
Jüri Lember, Alexey A. Koloydenko
2010 J jnl
A generalized risk-based approach to segmentation based on hidden Markov models
CoRR
Jüri Lember, Alexey A. Koloydenko
2008 J jnl
A constructive proof of the existence of Viterbi processes
CoRR
Jüri Lember, Alexey A. Koloydenko
2003 J jnl
On minimizing sequences for k-centres.
J. Approx. Theory
Jüri Lember