Search alternatives:
coding algorithm » cosine algorithm (Expand Search), colony algorithm (Expand Search), scheduling algorithm (Expand Search)
g algorithm » _ algorithms (Expand Search), rd algorithm (Expand Search)
element g » elements _ (Expand Search), clement k (Expand Search)
search » research (Expand Search)
coding algorithm » cosine algorithm (Expand Search), colony algorithm (Expand Search), scheduling algorithm (Expand Search)
g algorithm » _ algorithms (Expand Search), rd algorithm (Expand Search)
element g » elements _ (Expand Search), clement k (Expand Search)
search » research (Expand Search)
-
1
-
2
CNN and HEVC Video Coding Features for Static Video Summarization
Published 2022Get full text
article -
3
-
4
-
5
-
6
-
7
-
8
Automatic Video Summarization Using HEVC and CNN Features
Published 2022Get full text
doctoralThesis -
9
A Parallel Neural Networks Algorithm for the Clique Partitioning Problem
Published 2002“…Given a graph G = (V, E), a clique is a complete subgraph in G. …”
Get full text
Get full text
article -
10
-
11
Brain Source Localization in the Presence of Leadfield Perturbations
Published 2015Get full text
doctoralThesis -
12
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
-
13
-
14
Assessment of static pile design methods and non-linear analysis of pile driving
Published 2006“…The pile/soil interaction system is described by a mass/spring/dashpot system where the properties of each component are derived from rigorous analytical solutions or finite element analysis. The outcome of this research is an algorithm that can be used to predict pile displacement and driving stresses. …”
Get full text
Get full text
Get full text
masterThesis -
15
-
16
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 -
17
-
18
A hybrid approach for XML similarity
Published 2007“…Owing to an unparalleled increasing use of the XML standard, developing efficient techniques for comparing XML-based documents becomes essential in information retrieval (IR) research. Various algorithms for comparing hierarchically structured data, e.g. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
19
Utilization of AI to Predict Shear Strength Parameters of Soil Based on Their Physical Properties
Published 2025Get full text
doctoralThesis -
20