On-Line Analysis And Validation Of Partially Occluded Images: Implementation And Practice

DOI10.1080/00207160214652zbMath1008.00513OpenAlexW2060174213MaRDI QIDQ4792959

No author found.

Publication date: 2 April 2003

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160214652

zbMATH Keywords

Australasian workshopCombinational algorithmsHunter Valley (Australia)

Mathematics Subject Classification ID

Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to combinatorics (05-06) Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

Cites Work

• Unnamed Item
• Quasiperiodicity and string covering
• On-line construction of suffix trees
• Optimal parallel analysis and decomposition of partially occluded strings
• Efficient string matching

This page was built for publication: On-Line Analysis And Validation Of Partially Occluded Images: Implementation And Practice