A faster strongly polynomial minimum cost flow algorithm
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Bisimulation through probabilistic testing
Information and Computation
Deciding bisimilarity and similarity for probabilistic processes
Journal of Computer and System Sciences
The Metric Analogue of Weak Bisimulation for Probabilistic Processes
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Empirical Evaluation of Dissimilarity Measures for Color and Texture
ICCV '99 Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2
Metrics for labelled Markov processes
Theoretical Computer Science - Logic, semantics and theory of programming
Metrics for finite Markov decision processes
UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
A behavioural pseudometric for probabilistic transition systems
Theoretical Computer Science - Automata, languages and programming
A new Mallows distance based metric for comparing clusterings
ICML '05 Proceedings of the 22nd international conference on Machine learning
Approximating and computing behavioural distances in probabilistic transition systems
Theoretical Computer Science
Recursively defined metric spaces without contraction
Theoretical Computer Science
Characterising Testing Preorders for Finite Probabilistic Processes
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Video Shots Comparison using the Mallows Distance
DEXA '07 Proceedings of the 18th International Conference on Database and Expert Systems Applications
Metrics for Action-labelled Quantitative Transition Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Approximating a behavioural pseudometric without discount for probabilistic systems
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
An accessible approach to behavioural pseudometrics
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
A Kantorovich-Monadic Powerdomain for Information Hiding, with Probability and Nondeterminism
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
A pseudometric in supervisory control of probabilistic discrete event systems
Discrete Event Dynamic Systems
| Hi-index | 0.00 |
In contrast to its wealth of applications in mathematics, the Kantorovich metric started to be noticed in computer science only in recent years. We give a brief survey of its applications in probabilistic concurrency, image retrieval, data mining, and bioinformatics. This paper highlights the usefulness of the Kantorovich metric as a general mathematical tool for solving various kinds of problems in rather unrelated domains.