Author:
Khakhutskyy Valeriy,Schwarzfischer Michael,Hubig Nina,Plant Claudia,Marr Carsten,Rieger Michael A.,Schroeder Timm,Theis Fabian J.
Publisher
Springer International Publishing
Reference29 articles.
1. Arnaudon, M., Barbaresco, F., Yang, L.: Medians and means in riemannian geometry: Existence, uniqueness and computation. In: Nielsen, F., Bhatia, R. (eds.) Matrix Information Geometry, pp. 169–197. Springer, Heidelberg (2013)
2. Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and the hardness of approximation problems. Journal of ACM 45, 501–555 (1998)
3. LNAI;T. Asai,2003
4. Bille, P.: A survey on tree edit distance and related problems. Theoretical Computer Science 337(1-3), 217–239 (2005)
5. Bishop, C.: Pattern recognition and machine learning. Information science and statistics. Springer (2006)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献