 | Up a level |
Ferrer, M.; Valveny, E.; Serratosa, F.; Riesen, Kaspar; Bunke, Horst (2010). Generalized median graph computation by means of graph embedding in vector spaces. Pattern recognition, 43(4), pp. 1642-1655. Oxford: Pergamon 10.1016/j.patcog.2009.10.013
Ferrer, M.; Valveny, E.; Serratosa, F.; Bunke, H. (2009). Graph-based k-means clustering: a comparison of the set median versus the generalized median graph. In: Jiang, Xiaoyi; Petkov, Nicolai (eds.) Computer Analysis of Images and Patterns 13th International Conference, CAIP 2009, Münster, Germany, September 2-4, 2009. Proceedings. Lecture Notes in Computer Science: Vol. 5702 (pp. 342-350). Heidelberg: Springer Verlag 10.1007/978-3-642-03767-2_42
Ferrer, M.; Karatzas, D.; Valveny, E.; Bunke, H. (2009). A recursive embedding approach to median graph computation. In: Torsello, Andrea; Escolano, Francisco; Brun, Luc (eds.) Graph-Based Representations in Pattern Recognition 7th IAPR-TC-15 International Workshop, GbRPR 2009, Venice, Italy, May 26-28, 2009. Proceedings. Lecture Notes in Computer Science: Vol. 5534 (pp. 113-123). Heidelberg: Springer Verlag 10.1007/978-3-642-02124-4_12
Ferrer, M.; Valveny, E.; Serratosa, F.; Riesen, K.; Bunke, Horst (2008). An approximate algorithm for median graph computation using graph embedding. In: Proceedings of the 19th International Conference on Pattern Recognition, 8-11 December 2008, Tampa, FL (pp. 1-4). New York: Institute of Electrical and Electronics Engineers IEEE 10.1109/ICPR.2008.4761354
