Kandel, Abraham

Bunke, Horst; Dickinson, Peter; Kraetzl, Miro; Neuhaus, Michael; Stettler, Marc (2008). Matching of hypergraphs - algorithms, applications, and experiments. In: Bunke, Horst; Kandel, Abraham; Last, Mark (eds.) Applied Pattern Recognition. Studies in computational intelligence: Vol. 91 (pp. 131-154). Heidelberg: Springer Verlag 10.1007/978-3-540-76831-9_6

Bunke, Horst; Kandel, Abraham; Last, Mark (eds.) (2008). Applied Pattern Recognition. Studies in computational intelligence: Vol. 91. Heidelberg: Springer Verlag

Kandel, Abraham; Bunke, Horst; Last, Mark (eds.) (2007). Applied Graph Theory in Computer Vision and Pattern Recognition. Studies in Computational Intelligence: Vol. 52. Heidelberg: Springer Verlag 10.1007/978-3-540-68020-8

Schenker, Adam; Bunke, Horst; Last, Mark; Kandel, Abraham (2007). Clustering of web documents using graph matching. In: Kandel, Abraham; Bunke, Horst; Last, Mark (eds.) Applied Graph Theory in Computer Vision and Pattern Recognition. Studies in Computational Intelligence: Vol. 18 (pp. 475-496). Heidelberg: Springer Verlag 10.1142/S0218001404003241

Bunke, Horst; Dickinson, Peter; Humm, Andreas; Irniger, Christophe; Kraetzl, Miro (2007). Graph sequence visualisation and its application to computer network monitoring and abnormal event detection. In: Kandel, Abraham; Bunke, Horst; Last, Mark (eds.) Applied Graph Theory in Computer Vision and Pattern Recognition. Studies in Computational Intelligence: Vol. 52 (pp. 227-245). Heidelberg: Springer Verlag 10.1007/978-3-540-68020-8_9

Ding, Zouhua; Bunke, Horst; Kipersztok, Oscar; Schneider, Mit; Kandel, Abraham (2006). Fuzzy timed Petri net -- analysis and implementation. Mathematical and computer modelling, 43(3-4), pp. 385-400. Oxford: Pergamon 10.1016/j.mcm.2005.11.005

Reynolds, Zane; Bunke, Horst; Last, Mark; Kandel, Abraham (2006). Comparing representative selection strategies for dissimilarity representations. International journal of intelligent systems, 21(10), pp. 1093-1109. New York, N.Y.: John Wiley & Sons 10.1002/int.20180

Schenker, Adam; Bunke, Horst; Last, Mark; Kandel, Abraham (2006). Polynomial Time Complexity Graph Distance Computation for Web Content Mining. In: Basu, Mitra; Ho, Kam Tin (eds.) Data Complexity in Pattern Recognition. Advanced Information and Knowledge Processing (pp. 197-215). Heidelberg: Springer Verlag