Search Results - (( parallel extraction method algorithm ) OR ( problem application system algorithm ))
Search alternatives:
- parallel extraction »
- problem application »
- extraction method »
- method algorithm »
- system algorithm »
-
1
Voting algorithms for large scale fault-tolerant systems
Published 2011“…To solve this problem and gain benefits of this algorithm, we employed parallel algorithm technique and by using optimal number of processors, we could propose optimal algorithms known as Parallel Average Voting and Parallel Weighted Average Voting which both have optimal time complexity and less calculation cost. …”
Get full text
Get full text
Thesis -
2
Automated plant recognition system based on multi-objective parallel genetic algorithm and neural network
Published 2014“…The problem with the existing plant recognition system is the lack of method to find the best structure for their classifiers. …”
Get full text
Get full text
Thesis -
3
Simulated kalman filter (SKF) based image template matching for distance measurement by using stereo vision system
Published 2018“…In addition, to ensure the robustness of SKF algorithm, the algorithm is tested under vision problems, occlusion and illumination-invariant. …”
Get full text
Get full text
Thesis -
4
Design and implementation of multimedia digital matrix system
Published 2005“…The hybrid-reset algorithm is successfully solved the most well known problem of channel synchronization in data oversampling method. …”
Get full text
Get full text
Conference or Workshop Item -
5
-
6
Image classification using two dimensional wavelet coefficients with parallel computing
Published 2020“…This research algorithm demonstrated a very promising result with Support Vector Machines, this algorithm produces a 90% of accuracies whereas the decision tree algorithm gets 100% accuracies. …”
Get full text
Get full text
Final Year Project / Dissertation / Thesis -
7
An efficient indexing and retrieval of iris biometrics data using hybrid transform and firefly based K-means algorithm title
Published 2019“…The enhanced method combines three transformation methods for analyzing the iris image and extracting its local features. …”
Get full text
Get full text
Thesis -
8
Robust partitioning and indexing for iris biometric database based on local features
Published 2018“…The proposed method combines three transformation methods DCT, DWT and SVD to analyse iris images and extract their local features. …”
Get full text
Get full text
Get full text
Article -
9
Combining deep and handcrafted image features for MRI brain scan classification
Published 2019“…In parallel, handcrafted features are extracted using the modified gray level co-occurrence matrix (MGLCM) method. …”
Get full text
Get full text
Get full text
Article -
10
-
11
-
12
Magnetic resonance imaging sense reconstruction system using FPGA / Muhammad Faisal Siddiqui
Published 2016“…Parallel imaging is a robust method for accelerating the data acquisition in Magnetic Resonance Imaging (MRI). …”
Get full text
Get full text
Get full text
Thesis -
13
A new multi-frames watermarking technique for tamper detection and recovery
Published 2017“…The sequential multi-frames watermarking process could be speed up by two methods, first method was designed a speedy watermarking scheme algorithm (ROI-DR) in a single frame of medical image, and the second method was developed a new multi-frames watermarking scheme by adding parallelism component into sequential multi-frames watermarking process. …”
Get full text
Get full text
Thesis -
14
Mapreduce algorithm for weather dataset
Published 2017“…The temperature, humidity and visibility attributes from the dataset has been extracted by the MapReduce Algorithm into structure data. …”
Get full text
Get full text
Thesis -
15
-
16
Ant colony optimization algorithm for dynamic scheduling of jobs in computational grid
Published 2012“…In computational grid, job scheduling is one of the main factors affecting grid computing performance. Job scheduling problem is classified as an NP-hard problem.Such a problem can be solved only by using approximate algorithms such as heuristic and meta-heuristic algorithms.Among different optimization algorithms for job scheduling, ant colony system algorithm is a popular meta-heuristic algorithm which has the ability to solve different types of NP-hard problems.However, ant colony system algorithm has a deficiency in its heuristic function which affects the algorithm behavior in terms of finding the shortest connection between edges.This research focuses on a new heuristic function where information about recent ants’ discoveries has been considered.The new heuristic function has been integrated into the classical ant colony system algorithm.Furthermore, the enhanced algorithm has been implemented to solve the travelling salesman problem as well as in scheduling of jobs in computational grid.A simulator with dynamic environment feature to mimic real life application has been development to validate the proposed enhanced ant colony system algorithm. …”
Get full text
Get full text
Monograph -
17
Twofold Integer Programming Model for Improving Rough Set Classification Accuracy in Data Mining.
Published 2005“…The accuracy for rules and classification resulted from the TIP method are compared with other methods such as Standard Integer Programming (SIP) and Decision Related Integer Programming (DRIP) from Rough Set, Genetic Algorithm (GA), Johnson reducer, HoltelR method, Multiple Regression (MR), Neural Network (NN), Induction of Decision Tree Algorithm (ID3) and Base Learning Algorithm (C4.5); all other classifiers that are mostly used in the classification tasks. …”
Get full text
Get full text
Thesis -
18
Heuristic factors in ant system algorithm for course timetabling problem
Published 2009Get full text
Get full text
Conference or Workshop Item -
19
-
20
Ant colony optimization in dynamic environments
Published 2010“…In order to achieve this objective, six ant algorithms namely Ant System (AS), Ant Colony System (ACS), Best-Worst Ant System (BWAS), Elitist Ant System (EAS), Max-Min Ant System (MMAS) and Rank-Based Ant System (RBAS) were implemented to solve a dynamic optimization problem in the form of the dynamic Traveling Salesman Problem (TSP). …”
Get full text
Get full text
Get full text
Thesis
