بدائل البحث:
coding algorithm » cosine algorithm (توسيع البحث), colony algorithm (توسيع البحث), scheduling algorithm (توسيع البحث)
maya algorithm » jaya algorithm (توسيع البحث)
complementing » implementing (توسيع البحث), complementary (توسيع البحث), complement (توسيع البحث)
coding algorithm » cosine algorithm (توسيع البحث), colony algorithm (توسيع البحث), scheduling algorithm (توسيع البحث)
maya algorithm » jaya algorithm (توسيع البحث)
complementing » implementing (توسيع البحث), complementary (توسيع البحث), complement (توسيع البحث)
-
1
-
2
CNN and HEVC Video Coding Features for Static Video Summarization
منشور في 2022احصل على النص الكامل
article -
3
-
4
-
5
-
6
-
7
Automatic Video Summarization Using HEVC and CNN Features
منشور في 2022احصل على النص الكامل
doctoralThesis -
8
Improved Jaya Synergistic Swarm Optimization Algorithm to Optimize Task Scheduling Problems in Cloud Computing
منشور في 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. …"
احصل على النص الكامل
-
9
MAESTRO: Orchestrating Computational Offloading to Multiple FemtoClouds in Various Communication Environments
منشور في 2022"…For MAESTRO, we build an integrated architecture that includes two new scheduling algorithms for assigning computing workloads to FemtoClouds. …"
-
10
-
11
Multi-Modal Emotion Aware System Based on Fusion of Speech and Brain Information
منشور في 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. …"
احصل على النص الكامل
احصل على النص الكامل
-
12
Machine Learning Techniques for Pharmaceutical Bioinformatics
منشور في 2018"…A predictive model is developed to predict drug indication as well as to predict new DDIs using multiple machine learning algorithms. This dissertation presents a case study of predicted anti-cancer activity for 38 drugs. …"
احصل على النص الكامل
-
13
Face Recognition in Uncontrolled Indoor Environment
منشور في 2013احصل على النص الكامل
doctoralThesis -
14
Oversampling techniques for imbalanced data in regression
منشور في 2024"…For tabular data, we also present the Auto-Inflater neural network, utilizing an exponential loss function for Autoencoders. …"
-
15
A novel technique for fast multiplication
منشور في 1995"…The algorithms is modeled in a hardware description language and its VLSI chip implemented. …"
احصل على النص الكامل
احصل على النص الكامل
article -
16
The maximum common subgraph problem
منشور في 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.…"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
conferenceObject -
17
Localizing-ground Transmitters Using Airborne Antenna Array
منشور في 2020احصل على النص الكامل
doctoralThesis -
18
Developing an online hate classifier for multiple social media platforms
منشور في 2020"…We then experiment with several classification algorithms (Logistic Regression, Naïve Bayes, Support Vector Machines, XGBoost, and Neural Networks) and feature representations (Bag-of-Words, TF-IDF, Word2Vec, BERT, and their combination). …"
-
19
Detecting and Predicting Archaeological Sites Using Remote Sensing and Machine Learning—Application to the Saruq Al-Hadid Site, Dubai, UAE
منشور في 2023"…., dry and bare soil. SAR data were complemented with very high-resolution Worldview-3 multispectral images (0.31 m panchromatic, 1.24 m VNIR) to obtain a visual assessment of the study area and its land cover features. …"
احصل على النص الكامل
-
20
A new approach and faster exact methods for the maximum common subgraph problem
منشور في 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. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
conferenceObject