Search results
Results: 150
Number of items: 150
-
Antunes, L., Souto, A., & Vitányi, P. M. B. (2013). On Logical Depth and the Running Time of Shortest Programs. (v1 ed.) ArXiv. https://doi.org/10.48550/arXiv.1310.6976 -
Vitányi, P. M. B. (2013). Conditional Kolmogorov complexity and universal probability. Theoretical Computer Science, 501, 93-100. https://doi.org/10.1016/j.tcs.2013.07.009
-
de Rooij, S., & Vitányi, P. M. B. (2012). Approximating rate-distortion graphs of individual data: Experiments in lossy compression and denoising. IEEE Transactions on Computers, 61(3), 395-407. https://doi.org/10.1109/TC.2011.25
-
Vitányi, P. M. B. (2012). Tolstoy's mathematics in 'War and Peace'. Mathematical Intelligencer, 35(1), 71-75. https://doi.org/10.1007/s00283-012-9342-8
-
Vitányi, P. M. B. (2012). Conditional Kolmogorov Complexity and Universal Probability. ArXiv. https://arxiv.org/abs/1206.0983v1
-
Hsu, A. S., Chater, N., & Vitányi, P. M. B. (2011). The probabilistic analysis of language acquisition: Theoretical, computational, and experimental analysis. Cognition, 120(3), 380-390. https://doi.org/10.1016/j.cognition.2011.02.013
-
Vitányi, P. M. B. (2011). Compression-based similarity. In First International Conference on Data Compression, Communication and Processing: CCP 2011 : Palinuro, Cilento Coast, Italy, 21-24 June 2011 : proceedings (pp. 111-118). IEEE. https://doi.org/10.1109/CCP.2011.50
-
Vitányi, P. M. B. (2011). Information distance in multiples. IEEE Transactions on Information Theory, 57(4), 2451-2456. https://doi.org/10.1109/TIT.2011.2110130
-
Cilibrasi, R. L., & Vitányi, P. M. B. (2011). A Fast Quartet tree heuristic for hierarchical clustering. Pattern Recognition, 44(3), 662-677. https://doi.org/10.1016/j.patcog.2010.08.033
-
Terwijn, S. A., Torenvliet, L., & Vitányi, P. M. B. (2011). Nonapproximability of the normalized information distance. Journal of Computer and System Sciences, 77(4), 738-742. https://doi.org/10.1016/j.jcss.2010.06.018
Page 2 of 15