Search Results - (( development a sparse algorithm ) OR ( java application optimized algorithm ))

Refine Results
  1. 1
  2. 2
  3. 3

    Performance evaluation of real-time multiprocessor scheduling algorithms by Alhussian, H., Zakaria, N., Abdulkadir, S.J., Fageeri, S.O.

    Published 2016
    “…These results suggests that optimal algorithms may turn to be non-optimal when practically implemented, unlike USG which reveals far less scheduling overhead and hence could be practically implemented in real-world applications. …”
    Get full text
    Get full text
    Conference or Workshop Item
  4. 4

    Route Optimization System by Zulkifli, Abdul Hayy

    Published 2005
    “…After much research into the many algorithms available, and considering some, including Genetic Algorithm (GA), the author selected Dijkstra's Algorithm (DA). …”
    Get full text
    Get full text
    Final Year Project
  5. 5

    Proximal linearized method for sparse equity portfolio optimization with minimum transaction cost by Sim, Hong Seng, Ling, Wendy Shin Yie, Leong, Wah June, Chen, Chuei Yee

    Published 2023
    “…In this paper, we propose a sparse equity portfolio optimization model that aims at minimizing transaction cost by avoiding small investments while promoting diversification to help mitigate the volatility in the portfolio. …”
    Get full text
    Get full text
    Get full text
    Article
  6. 6
  7. 7
  8. 8

    Blind Source Separation Using Two-Dimensional Nonnegative Matrix Factorization In Biomedical Field by Toh, Cheng Chuan

    Published 2018
    “…Blind Source Separation (BSS) refers to the statistical technique of separating a mixture of underlying source signals.BSS denotes as a phenomena and separation on mixed heart-lung sound is one of its example.The challenge of this research is to separate the separate lung sound and heart sound from mixed heart-lung sound.A clear lung sound for diagnosis purpose able to be obtained after separating the mixed heart-lung sound.In biomedical field,lung information is precious due to it has been provided for respiratory diagnosis.However,the interference of heart sound towards lung sound will generate ambiguity and it will lead to drop down the accuracy of diagnosis.Thus,a clean lung sound is needed to increases the accuracy of diagnosis.One of the ways for non-invasive respiratory diagnosis for obtaining lung information is through extracting lung sound from mixed heart-lung sound by using Two-Dimensional Nonnegative Matrix Factorization (NMF2D) algorithm.This method is based on cocktail party effect in which it refers to human brain able to selectively listen to target among a cacophony of conversations and background noise and this considered as a difficult task to machine.Therefore, duplication on cocktail party effect into machine is used to separate the mixed heart-lung sound.This research presents a novel approach NMF2D algorithm in which a suitable model for signal mixture that accommodated the reverberations and nonlinearity of the signals.The objectives of this research are focusing on investigating the useful signal analysis algorithms,defining a new technique of signal separability,designing and developing novel methods for BSS. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  9. 9

    Identification of the continuous-time Hammerstein models with sparse measurement data using improved marine predators algorithm by Mohd Zaidi, Mohd Tumari, Mohd Ashraf, Ahmad, Zaharuddin, Mohamed

    Published 2024
    “…Subsequently, we applied RAMPA-TCF to identify the parameters of one numerical example and a twin-rotor system (TRS) under various sparse measurement data cases. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  10. 10

    Taylor-Bird Swarm Optimization-Based Deep Belief Network For Medical Data Classification by Mohammed, Alhassan Afnan

    Published 2022
    “…However, finding the most appropriate deep learning algorithm for a medical classification problem along with its optimal parameters becomes a difficult task. …”
    Get full text
    Get full text
    Thesis
  11. 11

    Image denoising using combined higher order non-convex total variation with overlapping group sparsity by Adam, Tarmizi, Paramesran, Raveendran

    Published 2019
    “…In this paper, we address this problem by proposing a combined non-convex higher order total variation with overlapping group sparse regularizer. …”
    Get full text
    Get full text
    Article
  12. 12

    Multi-Hop Selective Constructive Interference Flooding Protocol For Wireless Sensor Networks by Alhalabi, Huda A. H.

    Published 2019
    “…The first step of the proposed protocol involves the development of an energy efficient clustering algorithm which is appropriate for WSN with a sparse density topology. …”
    Get full text
    Get full text
    Thesis
  13. 13
  14. 14
  15. 15

    Hardware development of autonomous mobile robot based on actuating lidar by Mohd Romlay, Muhammad Rabani, Mohd Ibrahim, Azhar, Toha, Siti Fauziah, Rashid, Muhammad Mahbubur, Ahmad, Muhammad Syahmi

    Published 2022
    “…As opposed to a point cloud generated from high-end LiDAR sensors where many algorithms have been developed for object detection, sparse LiDAR point clouds still possess large room for improvement. …”
    Get full text
    Get full text
    Get full text
    Article
  16. 16
  17. 17

    Speech compression using compressive sensing on a multicore system by Gunawan, Teddy Surya, Khalifa, Othman Omran, Shafie, Amir Akramin, Ambikairajah, Eliathamby

    Published 2011
    “…In this paper, a novel algorithm for speech coding utilizing CS principle is developed. …”
    Get full text
    Get full text
    Proceeding Paper
  18. 18

    Semi-supervised learning for feature selection and classification of data / Ganesh Krishnasamy by Ganesh , Krishnasamy

    Published 2019
    “…An efficient iterative algorithm is developed to optimize the objective function of the proposed algorithm since it is non-smooth and difficult to solve. …”
    Get full text
    Get full text
    Get full text
    Thesis
  19. 19

    Prime-based method for interactive mining of frequent patterns by Nadimi-Shahraki, Mohammad-Hossein

    Published 2010
    “…Thus far, a few efficient interactive mining algorithms have been proposed. …”
    Get full text
    Get full text
    Thesis
  20. 20

    Counting roots of the Polynomial systems by using mixed volume of the Newton polytopes / Nur Suhailah Norazhar, Nur Ain Sofiya Zainuri and Nor Suhada Mohd Rosdi by Norazhar, Nur Suhailah, Zainuri, Nur Ain Sofiya, Mohd Rosdi, Nor Suhada

    Published 2024
    “…Since the study dealing with the sparse polynomial systems with two variables, to derive the sparse matrices, the developed Maple program, “multires.mpl” is used. …”
    Get full text
    Get full text
    Student Project