We give a new algorithm for the genotype phasing problem. Our solution is based on a hidden Markov model for haplotypes. The model has a uniform structure, unlike most solutions pr...
Pasi Rastas, Mikko Koivisto, Heikki Mannila, Esko ...
Correspondence algorithms typically struggle with shapes that display part-based variation. We present a probabilistic approach that matches shapes using independent part transfor...
— Recent large scale experiments have shown that the Normalized Information Distance, an algorithmic information measure, is among the best similarity metrics for melody classiï¬...
Abstract--In this paper, we propose a maximum-entropy expectation-maximization (MEEM) algorithm. We use the proposed algorithm for density estimation. The maximum-entropy constrain...
We propose a novel technique for semi-supervised image annotation which introduces a harmonic regularizer based on the graph Laplacian of the data into the probabilistic semantic ...
Yuanlong Shao, Yuan Zhou, Xiaofei He, Deng Cai, Hu...