Search alternatives:
coding algorithm » cosine algorithm (Expand Search), colony algorithm (Expand Search), scheduling algorithm (Expand Search)
each algorithm » search algorithm (Expand Search), jaya algorithm (Expand Search)
coding algorithm » cosine algorithm (Expand Search), colony algorithm (Expand Search), scheduling algorithm (Expand Search)
each algorithm » search algorithm (Expand Search), jaya algorithm (Expand Search)
-
1
-
2
CNN and HEVC Video Coding Features for Static Video Summarization
Published 2022Get full text
article -
3
-
4
-
5
-
6
-
7
Automatic Video Summarization Using HEVC and CNN Features
Published 2022Get full text
doctoralThesis -
8
MAESTRO: Orchestrating Computational Offloading to Multiple FemtoClouds in Various Communication Environments
Published 2022“…Each of our scheduling algorithms is designed to allow the system to operate more efficiently given poor or strong network infrastructures. …”
-
9
Improved Jaya Synergistic Swarm Optimization Algorithm to Optimize Task Scheduling Problems in Cloud Computing
Published 2024“…The Jaya algorithm's ability to exploit the current best solutions is complemented by the SSO's collaborative search strategy, resulting in a synergistic optimization framework. …”
Get full text
-
10
-
11
Utilization of AI to Predict Shear Strength Parameters of Soil Based on Their Physical Properties
Published 2025Get full text
doctoralThesis -
12
A novel technique for fast multiplication
Published 1995“…The algorithms is modeled in a hardware description language and its VLSI chip implemented. …”
Get full text
Get full text
article -
13
-
14
Multi-Modal Emotion Aware System Based on Fusion of Speech and Brain Information
Published 2019“…Further, EEG is utilized as inner channel complementing speech for more authoritative recognition, by extracting multiple features belonging to time, frequency, and time–frequency. …”
Get full text
Get full text
-
15
The maximum common subgraph problem
Published 2017“…This is made possible by exploiting an efficient decomposition of a graph into a minimum vertex cover and the maximum independent set in its complement. The result is an algorithm whose run time is bounded by a function exponential in the order of the smaller cover rather than in the order of the smaller graph.…”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
16
Localizing-ground Transmitters Using Airborne Antenna Array
Published 2020Get full text
doctoralThesis -
17
The Generalization of Bidirectional Dual Active Bridge DC/DC Converter Modulation Schemes: State-of-the-Art Analysis under Triple Phase Shift Control
Published 2023“…The article aims to highlight six TPS switching modes and their complements with operational constraints. Unlike previous studies that regarded TPS as a complex scheme, this paper simplifies the analysis of each mode and aims to standardize the understanding of TPS modulation for dual active bridge (DAB) converters. …”
-
18
Machine Learning Techniques for Pharmaceutical Bioinformatics
Published 2018“…This set of attributes imposes how each drug performs its action inside a human body. …”
Get full text
-
19
A new approach and faster exact methods for the maximum common subgraph problem
Published 2017“…This structure contains a large number of naturally-ordered cliques that are present in the association graph’s complement. A detailed analysis shows that the proposed algorithm requires O((m+1)n) time, which is a superior worst-case bound to those known for previously-analyzed algorithms in the setting of the MCS problem. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
20