Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Efficient parallel algorithms for hierarchical clustering on arrays with reconfigurable optical buses

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

DOI10.1006/JPDC.2000.1644zbMath0966.68215OpenAlexW2132215016MaRDI QIDQ5926353

Chin-Hsiung Wu, Shi-jinn Horng, Horng-Ren Tsai

Publication date: 28 February 2001

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jpdc.2000.1644


zbMATH Keywords

clusteringcomputer visionimage processing


Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Pattern recognition, speech recognition (68T10) Parallel algorithms in computer science (68W10)


Related Items (1)

SCALABLE AND OPTIMAL SPEED-UP PARALLEL ALGORITHMS FOR TEMPLATE MATCHING ON ARRAYS WITH RECONFIGURABLE OPTICAL BUSES







This page was built for publication: Efficient parallel algorithms for hierarchical clustering on arrays with reconfigurable optical buses

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5926353&oldid=12060966"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 00:20.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki