Intelligent Rapidly-Exploring Random Tree Star Algorithm حسب Ahmed, Khidir Galal Eldin Khidir

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

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

Efficient O(n) BIST algorithms for DDNPS faults in dual portmemories حسب Amin, A.A.

"…New fault models for both the memory array and the address decoders are proposed and efficient O(n) test algorithms are presented. The new fault models account for the simultaneous dual access property of the device. …"
احصل على النص الكامل
احصل على النص الكامل

A systolic algorithm for VLSI design of a 1/N rate Viterbi decoder حسب Sait, Sadiq M.

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

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)

New Hardware Algorithms and Designs for Montgomery Modular Inverse Computation in Galois Fields GF(p) and GF(2n) حسب Gutub, Adnan

"…We suggest a new correction phase for a previously proposed almost Montgomery inverse algorithm to calculate the inversion in hardware. It is also presented how to obtain a fast hardware algorithm to compute the inverse by multi-bit shifting method. …"
احصل على النص الكامل
احصل على النص الكامل

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

An improved kernelization algorithm for r-Set Packing حسب Abu-Khzam, Faisal N.

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

A kernelization algorithm for d-Hitting Set حسب Abu-Khzam, Faisal N.

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

An exact algorithm for connected red–blue dominating set حسب Abu-Khzam, Faisal N.

"…Combining exhaustive enumeration when |B| is small with the Weighted Steiner Tree approach when |B| is large, solves the problem in O⁎(n1.4143). In this paper we present a first non-trivial exact algorithm whose running time is in O⁎(n1.3645). …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

Distributed dimension reduction algorithms for widely dispersed data حسب Abu-Khzam, F.N.

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

A direct algorithm for the parameterized face cover problem حسب Abu-Khzam, Faisal N.

"…The main contribution of this paper is a direct and relatively simple O(5kn) face cover branching algorithm. A direct O(n2) face cover kernelization algorithm is also presented.…"
احصل على النص الكامل
احصل على النص الكامل

A deterministic heuristic algorithm for optimal multiprocessor scheduling. (c1995) حسب Moujabber, Bassam N.

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

Approximation and heuristic algorithms for computing backbones in asymmetric ad-hoc networks حسب Abu-Khzam, Faisal N.

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

Linear-time algorithms for problems on planar graphs with fixed disk dimension حسب Abu-Khzam, Faisal N.

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

The buffered work-pool approach for search-tree based optimization algorithms حسب Abu-Khzam, Faisal N.

"…Recent advances in algorithm design have shown a growing interest in seeking exact solutions to many hard problems. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

Topics in graph algorithms حسب Abu-Khzam, Faisal Nabih

"…Being fixed-parameter tractable, we develop an algorithm that solves it in time O(5k + n2) where k is the input parameter. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

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

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