Search Results - (( java implementation path algorithm ) OR ( pattern using sparse algorithm ))
Search alternatives:
- java implementation »
- implementation path »
- sparse algorithm »
- path algorithm »
- pattern using »
- using sparse »
-
1
Prime-based method for interactive mining of frequent patterns
Published 2010“…Since rerunning the mining algorithms from scratch can be very time consuming, researchers have introduced interactive mining to find proper patterns by using the current mining model with various minsup. …”
Get full text
Get full text
Thesis -
2
Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer
Published 2017“…The development tools used in developing this project is NetBeans by using Java for the implementation of the coding. The methodology that used for developing this system is the Dijkstra’s algorithm. …”
Get full text
Get full text
Thesis -
3
An improved plant identification system by Fuzzy c-means bag of visual words model and sparse coding
Published 2020“…Moreover, sparse coding has been commonly used in recent years for the purposes of retrieving and identifying images. …”
Get full text
Get full text
Get full text
Article -
4
Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization
Published 2019“…BST inserts the nodes in the way that the Dijkstra’s can find the empty parking in fastest way. Dijkstra’s algorithm initials the paths to finding the shortest path while ACO optimizes the paths. …”
Get full text
Get full text
Thesis -
5
Path planning for unmanned aerial vehicle (UAV) using rotated accelerated method in static outdoor environment
Published 2021“…In this study, a fast iterative method known as Rotated Successive Over-Relaxation (RSOR) is introduced. The algorithm is implemented in a self-developed 2D Java tool, UAV Planner. …”
Get full text
Get full text
Get full text
Get full text
Article -
6
Smart appointment organizer for mobile application / Mohd Syafiq Adam
Published 2009“…The main component of this prototype is the use of Dijkstra algorithm to compute the shortest path from source of appointment to the 6 points of destinations within UiTM Shah Alam. …”
Get full text
Get full text
Thesis -
7
-
8
Partitional clustering algorithms for highly similar and sparseness y-short tandem repeat data / Ali Seman
Published 2013“…In some cases, they are quite distant and sparseness. This uniqueness of Y-STR data has become problematic in partitioning the data using the existing partitional clustering algorithms. …”
Get full text
Get full text
Thesis -
9
A Multi-Criteria Recommendation Technique for Personalized Tourism Experiences
Published 2025“…Using ResNet, the algorithm can learn more complex and nuanced patterns in the data, leading to more accurate recommendations. …”
Get full text
Get full text
Get full text
Thesis -
10
Effect of masking techniques on computational complexity reduction of scale invariant feature transform
Published 2015“…The Scale Invariant Feature Transform (SIFT) is algorithm use in feature detection and description, it is famous and has dominated the research community. …”
Get full text
Get full text
Thesis -
11
Kernerlized Correlation Filters Parameters Optimization For Enhanced Visual Tracking
Published 2017“…In this research, the tracking is proposed by using the overlap ratio (OR) and centre location error (CLE). …”
Get full text
Get full text
Monograph -
12
Evolutionary cost-cognizant regression test case prioritization for object-oriented programs
Published 2019“…Therefore, this study proposed a cost-cognizant TCP approach for object-oriented software that uses path-based integration testing to identify the possible execution path extracted from the Java System Dependence Graph (JSDG) model of the source code using forward slicing technique. …”
Get full text
Get full text
Thesis
