Search Results - parallel computing ((matching algorithm) OR (modified algorithm))*
Search alternatives:
- matching »
-
1
MINIMIZATION OF RESOURCE UTILIZATION FOR A REAL-TIME DEPTH-MAP COMPUTATIONAL MODULE ON FPGA
Published 2011“…The issue is normally resolved by modifying the algorithm. However, the issue can also be addressed by implementing hardware architectures without the need to modify the depth-map algorithm. …”
Get full text
Get full text
Thesis -
2
Resource Minimization in a Real-time Depth-map Processing System on FPGA
Published 2011“…Depth-map algorithm allows camera system to estimate depth. It is a computational intensive algorithm, but can be implemented with high speed on hardware due to the parallelism property. …”
Get full text
Get full text
Conference or Workshop Item -
3
-
4
GPU-based odd and even hybrid string matching algorithm
Published 2016“…String matching is considered as one of the fundamental problems in computer science.Many computer applications provide the string matching utility for their users, and how fast one or more occurrences of a given pattern can be found in a text plays a prominent role in their user satisfaction.Although numerous algorithms and methods are available to solve the string matching problem, the remarkable increase in the amount of data which is produced and stored by modern computational devices demands researchers to find much more efficient ways for dealing with this issue.In this research, the Odd and Even (OE) hybrid string matching algorithm is redesigned to be executed on the Graphics Processing Unit (GPU), which can be utilized to reduce the burden of compute-intensive operations from the Central Processing Unit (CPU).In fact, capabilities of the GPU as a massively parallel processor are employed to enhance the performance of the existing hybrid string matching algorithms.Different types of data are used to evaluate the impact of parallelization and implementation of both algorithms on the GPU. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
5
Multithreaded Scalable Matching Algorithm For Intrusion Detection Systems
Published 2010“…Hence, this thesis defines a new algorithm called the Distributed Packet Header Matching algorithm (DPHM), and a New Network Intrusion Detection Systems (NNIDS) platform using hybrid technology in order to increase the overall performance of SNORT-NIDS.…”
Get full text
Get full text
Thesis -
6
Speeding up index construction with GPU for DNA data sequences
Published 2011Get full text
Get full text
Get full text
Conference or Workshop Item -
7
Parallel algorithms for numerical simulations of EHD ion-drag micropump on distributed parallel computing systems
Published 2014“…The DPA-EHD is further modified by utilizing the pipelining parallelism to reduce the computing iterations and named as data parallel and pipelining algorithm (DPPA-EHD). …”
Get full text
Get full text
Thesis -
8
Parallel implementation of genomic sequences classification using modified gabor wavelet transform on multicore systems
Published 2012“…This paper presents the parallel implementation of the gene and exon identification of DNA sequences using the previously developed modified Gabor wavelet transform on multicore systems. …”
Get full text
Get full text
Proceeding Paper -
9
Parallel computation of maass cusp forms using mathematica
Published 2013“…Our parallel programme comprises of two important parts namely the pullback algorithm and also the Maass cusp form algorithm. …”
Get full text
Get full text
Thesis -
10
-
11
A genetic similarity algorithm for searching the Gene Ontology terms and annotating anonymous protein sequences
Published 2008“…The genetic similarity algorithm combines semantic similarity measure algorithm with parallel genetic algorithm. …”
Get full text
Get full text
Get full text
Article -
12
Simulated kalman filter (SKF) based image template matching for distance measurement by using stereo vision system
Published 2018“…By implementing optimization algorithm in image template matching, it is expected that the computation time can be reduced. …”
Get full text
Get full text
Thesis -
13
Parallel batch self-organizing map on graphics processing unit using CUDA
Published 2018“…The most computationally expensive parts of its training algorithm (such as steps to compute distance between each data vector and neuron, and determining the Best Matching Unit based on minimum distance) are identified and mapped on GPU to be processed in parallel. …”
Get full text
Get full text
Article -
14
Parallel batch self-organizing map on graphics processing unit using CUDA
Published 2018“…The most computationally expensive parts of its training algorithm (such as steps to compute distance between each data vector and neuron, and determining the Best Matching Unit based on minimum distance) are identified and mapped on GPU to be processed in parallel. …”
Get full text
Get full text
Article -
15
-
16
Effect Of The Addition Of Wastepaper To Concrete Mix
Published 2009“…Hence, this thesis defines a new algorithm called the Distributed Packet Header Matching algorithm (DPHM), and a New Network Intrusion Detection Systems (NNIDS) platform using hybrid technology in order to increase the overall performance of SNORT-NIDS.…”
Get full text
Get full text
Thesis -
17
Hybrid Machine Translation Using Malay-English Language Parallel Text Extraction From Comparable Text
Published 2024“…We improve the bleu score from 13.40% to 15.41% using 315,194 parallel texts. In the second problem, we propose an algorithm to extract parallel sentences and parallel fragments/subsentences from comparable texts. …”
Get full text
Get full text
Thesis -
18
The development of semantic meta-database: an ontology based semantic integration of biological databases
Published 2007“…The tool comprises two intelligent algorithms. The first algorithm combines parallel genetic algorithm with the split-and-merge algorithm. …”
Get full text
Get full text
Monograph -
19
-
20
Parallel multiple tabu search for multiobjective Urban Transit Scheduling Problem
Published 2020“…A set covering model was then adopted to minimize the number of buses and drivers simultaneously. A parallel tabu search algorithm was proposed to solve the problem by modifying the initialization process and incorporating intensification and diversification approaches to guide the search effectively from the different feasible domain in finding optimal solutions with lesser computational effort. …”
Get full text
Get full text
Article
