Back to Search
Start Over
Complexity of computing distances between geometric trees
- Source :
- Feragen , A 2012 , Complexity of computing distances between geometric trees . in G Gimel'farb , E Hancock , A Imiya , A Kuijper , M Kudo , S Omachi , T Windeatt & K Yamada (eds) , Structural, Syntactic, and Statistical Pattern Recognition : Joint IAPR International Workshop, SSPR &SPR 2012, Hiroshima, Japan, November 7-9, 2012. Proceedings . Springer , Lecture notes in computer science , vol. 7626 , pp. 89-97 , Joint IAPR International Workshops on Structural and Syntactic Pattern Recognition (SSPR 2012) and Statistical Techniques in Pattern Recognition (SPR 2012) , Miyajima-Itsukushima, Hiroshima , Japan , 07/11/2012 .
- Publication Year :
- 2012
Details
- Database :
- OAIster
- Journal :
- Feragen , A 2012 , Complexity of computing distances between geometric trees . in G Gimel'farb , E Hancock , A Imiya , A Kuijper , M Kudo , S Omachi , T Windeatt & K Yamada (eds) , Structural, Syntactic, and Statistical Pattern Recognition : Joint IAPR International Workshop, SSPR &SPR 2012, Hiroshima, Japan, November 7-9, 2012. Proceedings . Springer , Lecture notes in computer science , vol. 7626 , pp. 89-97 , Joint IAPR International Workshops on Structural and Syntactic Pattern Recognition (SSPR 2012) and Statistical Techniques in Pattern Recognition (SPR 2012) , Miyajima-Itsukushima, Hiroshima , Japan , 07/11/2012 .
- Notes :
- English
- Publication Type :
- Electronic Resource
- Accession number :
- edsoai.ocn889797534
- Document Type :
- Electronic Resource