Search Results - parallel using ((modified algorithm) OR (matching algorithm))*
Search alternatives:
- matching »
-
1
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 -
2
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 -
3
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 -
4
Speeding up index construction with GPU for DNA data sequences
Published 2011“…Graphic processor unit (GPU) is used to parallelize a segment of an indexing algorithm. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
5
Multithreaded Scalable Matching Algorithm For Intrusion Detection Systems
Published 2010“…Therefore, the performance of the existing algorithms needs to be improved both in sequential and parallel to enhance the speed of the detection engine used in SNORT-NIDS. …”
Get full text
Get full text
Thesis -
6
Parallel implementation of genomic sequences classification using modified gabor wavelet transform on multicore systems
Published 2012“…Single Program Multiple Data (SPMD) parallel paradigm will be used in the parallel implementation. …”
Get full text
Get full text
Proceeding Paper -
7
Parallel algorithms for numerical simulations of EHD ion-drag micropump on distributed parallel computing systems
Published 2014“…To implement the parallel algorithms a distributed parallel computing laboratory using easily available low cost computers is setup. …”
Get full text
Get full text
Thesis -
8
Simulated kalman filter (SKF) based image template matching for distance measurement by using stereo vision system
Published 2018“…SKF is compared with conventional algorithms for image template matching which are performance index value (PIM) and correlation by using DC components of image (TMC) and by using power of images (TMP) methods. …”
Get full text
Get full text
Thesis -
9
Effect Of The Addition Of Wastepaper To Concrete Mix
Published 2009“…Therefore, the performance of the existing algorithms needs to be improved both in sequential and parallel to enhance the speed of the detection engine used in SNORT-NIDS. …”
Get full text
Get full text
Thesis -
10
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 -
11
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 -
12
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 -
13
Parallel Implementation of Two Level Barotropic Models Applied to the Weather Prediction Problem
Published 2004“…To process the data collected from British Atmospheric Data Centre (BADC), the sequential programs in row and columnwise fashions are developed and implemented. Then the parallel algorithms are constructed and run using the Beowulf Cluster machine. …”
Get full text
Get full text
Thesis -
14
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 -
15
-
16
Guided genetic algorithm for solving unrelated parallel machine scheduling problem with additional resources
Published 2022“…Results show that the GGA outperforms the simple genetic algorithm (SGA), but it still didn't match the results in the literature. …”
Get full text
Get full text
Get full text
Article -
17
-
18
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 -
19
Parallel Diagonally Implicit Runge-Kutta Methods For Solving Ordinary Differential Equations
Published 2009“…Three large scales of stiff ODEs are used to measure the parallel performances of the new embedded methods. …”
Get full text
Get full text
Thesis -
20
