Efficient BSP/CGM algorithms for text retreval

dc.contributor.author	Γαβαλάς, Δαμιανός	el
dc.contributor.author	Κωνσταντόπουλος, Χαράλαμπος	el
dc.contributor.author	Μάμαλης, Βασίλης	el
dc.contributor.author	Πάντζιου, Γραμματή Ε.	el
dc.date.accessioned	2015-05-27T22:57:07Z
dc.date.available	2015-05-27T22:57:07Z
dc.date.issued	2015-05-28
dc.identifier.uri	http://hdl.handle.net/11400/11315
dc.rights	Αναφορά Δημιουργού-Μη Εμπορική Χρήση-Όχι Παράγωγα Έργα 3.0 Ηνωμένες Πολιτείες	*
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/3.0/us/	*
dc.source	http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.98.7198	en
dc.subject	μοντέλο BSP
dc.subject	μοντέλο CGM
dc.subject	παράλληλοι αλγόριθμοι
dc.subject	ανάκτηση κειμένου
dc.subject	ομαδοποίηση εγγράφων
dc.subject	BSP model
dc.subject	CGM model
dc.subject	Parallel algorithms
dc.subject	text retrieval
dc.subject	Document clustering
dc.title	Efficient BSP/CGM algorithms for text retreval	en
heal.type	conferenceItem
heal.classification	Πληροφορική
heal.classification	Μαθηματικά
heal.classification	Computer science
heal.classification	Mathematics
heal.classificationURI	N/A-Πληροφορική
heal.classificationURI	N/A-Μαθηματικά
heal.classificationURI	http://skos.um.es/unescothes/C00750
heal.classificationURI	http://skos.um.es/unescothes/C02437
heal.keywordURI	http://id.loc.gov/authorities/subjects/sh98003394
heal.keywordURI	http://id.loc.gov/authorities/subjects/sh2007004888
heal.identifier.secondary	DOI: 10.1.1.98.7198
heal.language	en
heal.access	free
heal.recordProvider	Τεχνολογικό Εκπαιδευτικό Ίδρυμα Αθήνας. Σχολή Τεχνολογικών Εφαρμογών. Τμήμα Μηχανικών Πληροφορικής Τ.Ε.	el
heal.publicationDate	2005
heal.bibliographicCitation	Gavalas, D., Pantziou, G., Konstantopoulos, C. and Mamalis, B. (2005) Efficient BSP/CGM Algorithms for Text Retreval. Proceedings of the 17th IASTED International Conference on Parallel and Distributed Computing and Systems (PDCS’2005). pp.301-306.	en
heal.abstract	In this paper we present efficient, scalable and portable parallel algorithms written in the Coarse-Grained Multicomputer (CGM) and the Bulk Synchronous Parallel (BSP) models for the off-line clustering, the on-line retrieval and the update phases of the text retrieval problem based on the vector space model and using clustering to organize and handle a dynamic document collection. To the best of our knowledge, our parallel retrieval algorithms are the first ones analyzed under specific parallel models, which capture within a few parameters the characteristics of the parallel machine.	en
heal.fullTextAvailability	true
heal.conferenceName	Proceedings of the 17th IASTED International Conference on Parallel and Distributed Computing and Systems (PDCS’2005)	en
heal.conferenceItemType	full paper