Parallel Quick-Skip Search Hybrid Algorithm For The Exact String Matching Problem.

Masalah padanan rententan merupakan mercu tanda dalam kebanyakan bidang sains komputer kerana peranan yang dimainkannya dalam pelbagai aplikasi komputer. The string matching problem occupies a corner stone in many computer science fields because of the fundamental role it plays in various compute...

وصف كامل

محفوظ في:

التفاصيل البيبلوغرافية
المؤلف الرئيسي:	Naser, Mustafa Abdulsahib
التنسيق:	أطروحة
اللغة:	English
منشور في:	2010
الموضوعات:	QA75.5-76.95 Electronic computers Computer science
الوصول للمادة أونلاين:	http://eprints.usm.my/24575/1/PARALLEL_QUICK_SKIP_SEARCH_HYBRID_ALGORITHM_FOR_THE_EXACT_STRING_MATCHING_PROBLEM.pdf
الوسوم:	إضافة وسم لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!

id	my-usm-ep.24575
record_format	uketd_dc
spelling	my-usm-ep.245752013-07-13T09:43:59Z Parallel Quick-Skip Search Hybrid Algorithm For The Exact String Matching Problem. 2010-01 Naser, Mustafa Abdulsahib QA75.5-76.95 Electronic computers. Computer science Masalah padanan rententan merupakan mercu tanda dalam kebanyakan bidang sains komputer kerana peranan yang dimainkannya dalam pelbagai aplikasi komputer. The string matching problem occupies a corner stone in many computer science fields because of the fundamental role it plays in various computer applications. 2010-01 Thesis http://eprints.usm.my/24575/ http://eprints.usm.my/24575/1/PARALLEL_QUICK_SKIP_SEARCH_HYBRID_ALGORITHM_FOR_THE_EXACT_STRING_MATCHING_PROBLEM.pdf application/pdf en public masters USM School of Computer Sciences
institution	Universiti Sains Malaysia
collection	USM Institutional Repository
language	English
topic	QA75.5-76.95 Electronic computers Computer science
spellingShingle	QA75.5-76.95 Electronic computers Computer science Naser, Mustafa Abdulsahib Parallel Quick-Skip Search Hybrid Algorithm For The Exact String Matching Problem.
description	Masalah padanan rententan merupakan mercu tanda dalam kebanyakan bidang sains komputer kerana peranan yang dimainkannya dalam pelbagai aplikasi komputer. The string matching problem occupies a corner stone in many computer science fields because of the fundamental role it plays in various computer applications.
format	Thesis
qualification_level	Master's degree
author	Naser, Mustafa Abdulsahib
author_facet	Naser, Mustafa Abdulsahib
author_sort	Naser, Mustafa Abdulsahib
title	Parallel Quick-Skip Search Hybrid Algorithm For The Exact String Matching Problem.
title_short	Parallel Quick-Skip Search Hybrid Algorithm For The Exact String Matching Problem.
title_full	Parallel Quick-Skip Search Hybrid Algorithm For The Exact String Matching Problem.
title_fullStr	Parallel Quick-Skip Search Hybrid Algorithm For The Exact String Matching Problem.
title_full_unstemmed	Parallel Quick-Skip Search Hybrid Algorithm For The Exact String Matching Problem.
title_sort	parallel quick-skip search hybrid algorithm for the exact string matching problem.
granting_institution	USM
granting_department	School of Computer Sciences
publishDate	2010
url	http://eprints.usm.my/24575/1/PARALLEL_QUICK_SKIP_SEARCH_HYBRID_ALGORITHM_FOR_THE_EXACT_STRING_MATCHING_PROBLEM.pdf
_version_	1747819902870224896

Parallel Quick-Skip Search Hybrid Algorithm For The Exact String Matching Problem.

مواد مشابهة