Search Results - (( java implication based algorithm ) OR ( basic complex ((tree algorithm) OR (graph algorithm)) ))

Accelerating graph algorithms with priority queue processor by Heng Sun, Ch'ng, Eik Wee, Chew, Shaikh-Husin, Nasir, Hani, Mohamed Khalil

“…Many graph algorithms are organized as simple elaborations of basic graph searching algorithms. …”
Get full text
Get full text

Visualizing Phylogenetic Trees: Algorithms And Visual Comparison Techniques by Wan Zainon, Wan Mohd Nazmee

Get full text
Get full text

An algorithm for the selection of planting lining technique towards optimizing land area: an algorithm for planting lining technique selection by Md Badarudin, Ismadi, Md Sultan, Abu Bakar, Sulaiman, Md. Nasir, Mamat, Ali, Tengku Muda Mohamed, Mahmud

“…The algorithm is designed based on two basic works in which to calculate number of trees and divide an area into blocks. …”
Get full text
Get full text

Network analysis on safety culture and worker‘s behaviour : A forest of all minimum spanning trees by Djauhari, Maman A., Sharif, Shamshuritawati, Djauhari, Hariza

Get full text
Get full text
Get full text

Petri Net Algorithm for controlling and monitoring system by Mohamad Shaiful, Osman

Get full text

AnkPlex: algorithmic structure for refinement of near-native ankyrin-protein docking by Wisitponchai, Tanchanok, Shoombuatong, Watshara, Lee, Vannajan Sanghiran, Kitidee, Kuntida, Tayapiwatana, Chatchai

“…Subsequently, a re-scoring rank was generated by AnkPlex using a combination of a decision tree algorithm and logistic regression. AnkPlex achieved superior efficiency with ≥1 near-native complexes in the 10 top-rankings for nine X-ray complexes compared to ZDOCK, which only obtained six X-ray complexes. …”
Get full text
Get full text

A proposed algorithm of random vector in measuring similarity for network topology of Bursa Malaysia by Lim, San Yee

“…The calculation process of RV coefficient among all pairs of stocks can be shortened and eased as the proposed algorithm consists of time complexity of order of O(n2). …”
Get full text
Get full text
Get full text
Get full text

Unconstraint assignment problem : a molecular computing approach by Zuwairie, Ibrahim, Yusei, Tsuboi, Osamu, Ono, Marzuki, Khalid

“…On the other hand, for the computational phase, itis discovered that the complexity of the unconstraint assignment problem can be reduced to a path problem of a graph, and thepossibility to solve the unconstraint assignment problem by DNA computing approach is shown in detail.…”
Get full text
Get full text

The implications for ahybrid detection technique against malicious sqlattacks on web applications by Bahjat Arif, Sarajaldeen Akram, Wani, Sharyar

Get full text
Get full text
Get full text

Recovery of tree community composition across different types of anthropogenic disturbances and characterization of their effect using Landsat time series in Bornean tropical monta... by Keiko Ioki, Daniel James, Phua, Mui How, Satoshi Tsuyuki, Nobuo Imai

“…We also investigated the use of metrics from spectral trajectories of a Landsat time series (LTS) change detection algorithm (LandTrendr) to identify characteristics of disturbance events and their linkage to the recovery of tree community composition, with field validation. …”
Get full text
Get full text
Get full text
Get full text
Get full text

Digital Quran With Storage Optimization Through Duplication Handling And Compressed Sparse Matrix Method by Ashraf Saleh Mohammad Alomoush

Deep learning-based breast cancer detection and classification using histopathology images / Ghulam Murtaza by Ghulam , Murtaza

“…BreakHis is a large and complex dataset (i.e., four subtypes of each benign and malignant BrTs) that publicly available. …”
Get full text
Get full text
Get full text