Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

EFFICIENT PARALLEL ALGORITHMS FOR PATTERN RECOGNITION∗

From MaRDI portal
Publication:4819983
Jump to:navigation, search

DOI10.1080/10637199408915408zbMATH Open1049.68880OpenAlexW2059358660MaRDI QIDQ4819983FDOQ4819983


Authors: Sajal K. Das, Paul S. Fisher, Hua Zhang Edit this on Wikidata


Publication date: 6 October 2004

Published in: Parallel Algorithms and Applications (Search for Journal in Brave)

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





Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Parallel algorithms in computer science (68W10)


Cites Work

  • Fast Pattern Matching in Strings
  • Efficient string matching with k mismatches
  • Title not available (Why is that?)
  • Data structures and algorithms for approximate string matching
  • Title not available (Why is that?)
  • Long-term memory modules






This page was built for publication: EFFICIENT PARALLEL ALGORITHMS FOR PATTERN RECOGNITION∗

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4819983)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4819983&oldid=19139662"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 8 February 2024, at 01:38. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki