Complexity of computing distances between geometric trees

Aasa Feragen

doi:10.1007/978-3-642-34166-3_10

Complexity of computing distances between geometric trees

Aasa Feragen

Datalogisk Institut

Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › peer review

7 Citationer (Scopus)

Originalsprog	Engelsk
Titel	Structural, Syntactic, and Statistical Pattern Recognition : Joint IAPR International Workshop, SSPR&SPR 2012, Hiroshima, Japan, November 7-9, 2012. Proceedings
Redaktører	Georgy Gimel'farb, Edwin Hancock, Atsushi Imiya, Arjan Kuijper, Mineichi Kudo, Shinichiro Omachi, Terry Windeatt, Keiji Yamada
Antal sider	9
Forlag	Springer
Publikationsdato	2012
Sider	89-97
ISBN (Trykt)	978-3-642-34165-6
ISBN (Elektronisk)	978-3-642-34166-3
DOI	https://doi.org/10.1007/978-3-642-34166-3_10
Status	Udgivet - 2012
Begivenhed	Joint IAPR International Workshops on Structural and Syntactic Pattern Recognition (SSPR 2012) and Statistical Techniques in Pattern Recognition (SPR 2012) - Miyajima-Itsukushima, Hiroshima, Japan Varighed: 7 nov. 2012 → 9 nov. 2012

Konference

Konference	Joint IAPR International Workshops on Structural and Syntactic Pattern Recognition (SSPR 2012) and Statistical Techniques in Pattern Recognition (SPR 2012)
Land/Område	Japan
By	Miyajima-Itsukushima, Hiroshima
Periode	07/11/2012 → 09/11/2012

Navn	Lecture notes in computer science
Vol/bind	7626
ISSN	0302-9743

Adgang til dokumentet

10.1007/978-3-642-34166-3_10

Citationsformater

Feragen, A. (2012). Complexity of computing distances between geometric trees. I G. Gimel'farb, E. Hancock, A. Imiya, A. Kuijper, M. Kudo, S. Omachi, T. Windeatt, & K. Yamada (red.), Structural, Syntactic, and Statistical Pattern Recognition : Joint IAPR International Workshop, SSPR&SPR 2012, Hiroshima, Japan, November 7-9, 2012. Proceedings (s. 89-97). Springer. https://doi.org/10.1007/978-3-642-34166-3_10

Complexity of computing distances between geometric trees. / Feragen, Aasa.
Structural, Syntactic, and Statistical Pattern Recognition : Joint IAPR International Workshop, SSPR&SPR 2012, Hiroshima, Japan, November 7-9, 2012. Proceedings. red. / Georgy Gimel'farb; Edwin Hancock; Atsushi Imiya; Arjan Kuijper; Mineichi Kudo; Shinichiro Omachi; Terry Windeatt; Keiji Yamada. Springer, 2012. s. 89-97 (Lecture notes in computer science, Bind 7626).

Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › peer review

Feragen, A 2012, Complexity of computing distances between geometric trees. i G Gimel'farb, E Hancock, A Imiya, A Kuijper, M Kudo, S Omachi, T Windeatt & K Yamada (red), 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, bind 7626, s. 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. https://doi.org/10.1007/978-3-642-34166-3_10

Feragen A. Complexity of computing distances between geometric trees. I Gimel'farb G, Hancock E, Imiya A, Kuijper A, Kudo M, Omachi S, Windeatt T, Yamada K, red., Structural, Syntactic, and Statistical Pattern Recognition : Joint IAPR International Workshop, SSPR&SPR 2012, Hiroshima, Japan, November 7-9, 2012. Proceedings. Springer. 2012. s. 89-97. (Lecture notes in computer science, Bind 7626). doi: 10.1007/978-3-642-34166-3_10

Feragen, Aasa. / Complexity of computing distances between geometric trees. Structural, Syntactic, and Statistical Pattern Recognition : Joint IAPR International Workshop, SSPR&SPR 2012, Hiroshima, Japan, November 7-9, 2012. Proceedings. red. / Georgy Gimel'farb ; Edwin Hancock ; Atsushi Imiya ; Arjan Kuijper ; Mineichi Kudo ; Shinichiro Omachi ; Terry Windeatt ; Keiji Yamada. Springer, 2012. s. 89-97 (Lecture notes in computer science, Bind 7626).

@inproceedings{c32e96e17a364861b7f36d162e2ba325,

title = "Complexity of computing distances between geometric trees",

author = "Aasa Feragen",

year = "2012",

doi = "10.1007/978-3-642-34166-3_10",

language = "English",

isbn = "978-3-642-34165-6",

series = "Lecture notes in computer science",

publisher = "Springer",

pages = "89--97",

editor = "Georgy Gimel'farb and Edwin Hancock and Atsushi Imiya and Arjan Kuijper and Mineichi Kudo and Shinichiro Omachi and Terry Windeatt and Keiji Yamada",

booktitle = "Structural, Syntactic, and Statistical Pattern Recognition",

address = "Switzerland",

note = "Joint IAPR International Workshops on Structural and Syntactic Pattern Recognition (SSPR 2012) and Statistical Techniques in Pattern Recognition (SPR 2012) ; Conference date: 07-11-2012 Through 09-11-2012",

}

TY - GEN

T1 - Complexity of computing distances between geometric trees

AU - Feragen, Aasa

PY - 2012

Y1 - 2012

U2 - 10.1007/978-3-642-34166-3_10

DO - 10.1007/978-3-642-34166-3_10

M3 - Article in proceedings

SN - 978-3-642-34165-6

T3 - Lecture notes in computer science

SP - 89

EP - 97

BT - Structural, Syntactic, and Statistical Pattern Recognition

A2 - Gimel'farb, Georgy

A2 - Hancock, Edwin

A2 - Imiya, Atsushi

A2 - Kuijper, Arjan

A2 - Kudo, Mineichi

A2 - Omachi, Shinichiro

A2 - Windeatt, Terry

A2 - Yamada, Keiji

PB - Springer

T2 - Joint IAPR International Workshops on Structural and Syntactic Pattern Recognition (SSPR 2012) and Statistical Techniques in Pattern Recognition (SPR 2012)

Y2 - 7 November 2012 through 9 November 2012

ER -