A Fast and Robust Gas Recognition Algorithm Based on Hybrid Convolutional and Recurrent Neural Network حسب Xiaofang Pan (1895950)

CNN and HEVC Video Coding Features for Static Video Summarization حسب Issa, Obada

احصل على النص الكامل

Novel algorithms for accurate DNA base-calling حسب Mohammed, Omniyah Gul

احصل على النص الكامل

Predicting Patient ICU Readmission Using Recurrent Neural Networks With Long Short-Term Memory حسب Nadia Rasheed (22997257)

Deep Learning-Based Coding Strategy for Improved Cochlear Implant Speech Perception in Noisy Environments حسب Billel Essaid (22047578)

Competitive learning/reflected residual vector quantization for coding angiogram images حسب Mourn, W.A.H.

احصل على النص الكامل
احصل على النص الكامل

Automatic Video Summarization Using HEVC and CNN Features حسب Issa, Obada

احصل على النص الكامل

A Data-Driven Decision-Making Framework for Fleet Management in the Government Sector of Dubai حسب ALGHANEM, HANI SUBHI MOHD

"…The proposed framework comprises key elements: Important Decisions derived from interviews with transportation leaders, Knowledge Management enhanced by AI algorithms, Data Mining/Analysis utilizing historical data, the Fleet Management System employing Oracle ERP, and a Data-Driven Decision Support Framework that leans towards the extended framework approach. …"
احصل على النص الكامل

Adaptive bias simulated evolution algorithm for placement حسب Youssef, H.

"…In this work, we propose an adaptive bias scheme which adjusts automatically to the quality of solution and makes the algorithm independent of the problem class or instance, as well as any user defined value. …"
احصل على النص الكامل
احصل على النص الكامل

Brain Source Localization in the Presence of Leadfield Perturbations حسب Momin, Rabiya Nakhat

احصل على النص الكامل

Improved Jaya Synergistic Swarm Optimization Algorithm to Optimize Task Scheduling Problems in Cloud Computing حسب Abualigah, Laith

"…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. …"
احصل على النص الكامل

Properties of Unique Degree Sequences of 3-Uniform Hypergraphs حسب Tarsissi, Lama

"…The existence of this hypergraph makes us conjecture an extended generating algorithm for the sequences of Deza et al. to include a much wider class of unique 3-uniform hypergraphs. …"
احصل على النص الكامل

MAESTRO: Orchestrating Computational Offloading to Multiple FemtoClouds in Various Communication Environments حسب Hend Gedawy (23275984)

"…These requirements have motivated the emergence of fog and edge computing to complement the low-privacy and high-latency cloud. The intention behind Fog computing is to place computational servers closer to the user, typically within the city’s vicinity, to reduce latency. …"

Nonlinear analysis of shell structures using image processing and machine learning حسب M.S. Nashed (16392961)

Personalization in Real-Time Physical Activity Coaching Using Mobile Applications: A Scoping Review حسب Francisco Monteiro-Guerra (16864122)

Localizing-ground Transmitters Using Airborne Antenna Array حسب Daffalla, Mirghani Moutaman

احصل على النص الكامل

A novel technique for fast multiplication حسب Sait, Sadiq M.

"…The algorithms is modeled in a hardware description language and its VLSI chip implemented. …"
احصل على النص الكامل
احصل على النص الكامل

Face Recognition in Uncontrolled Indoor Environment حسب Abuqaaud, Kamal Adel

احصل على النص الكامل

The maximum common subgraph problem حسب Abu-Khzam, Faisal N.

"…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.…"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

A new approach and faster exact methods for the maximum common subgraph problem حسب Abu-Khzam, Faisal N.

"…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. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل