Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Parallel processing applications of string search algorithims an a transputer based network
Download
068563.pdf
Date
1997
Author
Tiryaki, Rüştü Murat
Metadata
Show full item record
Item Usage Stats
79
views
0
downloads
Cite This
URI
https://hdl.handle.net/11511/11187
Collections
Graduate School of Natural and Applied Sciences, Thesis
Suggestions
OpenMETU
Core
PARALLEL COMPUTING IN STATISTICAL METHODS
Oltulu, Orçun; Gökalp Yavuz, Fulya; Department of Statistics (2022-8-17)
Cost-efficient data collection and storage methods enable scientists, companies, and even regular computer users to reach high-dimensional data sets faster and cheaper. Even though personal computers are getting more powerful and efficient, some algorithms, tasks, and problems still require too much computational power and time to run on a personal computer. For a few decades, parallelization in statistical computing had an increasing trend, and researchers put significant effort into converting or adjustin...
Parallel computing in linear mixed models
Gökalp Yavuz, Fulya (Springer Science and Business Media LLC, 2020-09-01)
In this study, we propose a parallel programming method for linear mixed models (LMM) generated from big data. A commonly used algorithm, expectation maximization (EM), is preferred for its use of maximum likelihood estimations, as the estimations are stable and simple. However, EM has a high computation cost. In our proposed method, we use a divide and recombine to split the data into smaller subsets, running the algorithm steps in parallel on multiple local cores and combining the results. The proposed me...
Parallelization of K-Means and DBSCAN clustering algorithms on a HPC cluster
Durrani, Hunain; Coşar, Ahmet; Department of Computer Engineering (2013)
The amount of information that must be processed daily by computer systems has reached huge quantities. It is impossible, or would be prohibitively expensive, to build such a powerful supercomputer that could process such large data in the required time limits. Cluster computing has emerged to address this problem by connecting hundreds of small computers using ultra-fast switches so that their combined computational power and parallel processing techniques make it possible to quickly solve many difficult p...
Parallelization of noise subspace-based doa estimation algorithms on cpu and gpu
Eray, Hamza; Temizel, Alptekin; Department of Modeling and Simulation (2021-2-11)
Direction-of-Arrival (DOA) estimation is known as an active research area, and it is studied under array signal processing. The algorithms in this area are widely used in various applications such as sonar, search-and-rescue, navigation, and geolocation. However, achieving a real-time system performance is sometimes a challenging task for these algorithms. In this thesis, four noise subspace-based DOA estimation algorithms (PHD, MUSIC, EV, and MN) were considered and implemented in MATLAB, C/C++, and CUDA. ...
Parallel computing in statistics
Aybaş, Adnan İhsan; Akman, İbrahim; Department of Computer Engineering (1990)
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
R. M. Tiryaki, “Parallel processing applications of string search algorithims an a transputer based network,” Middle East Technical University, 1997.