Search Results - (( parallel application tree algorithm ) OR ( java application reoptimize algorithm ))

Search alternatives:

  • Showing 1 - 6 results of 6
Refine Results
  1. 1
    Speeding up index construction with GPU for DNA data sequences

    Speeding up index construction with GPU for DNA data sequences by Rahmaddiansyah, , Abdul Rashid, Nur’aini

    Published 2011
    “…The advancement of technology in scientific community has produced terabytes of biological data.This datum includes DNA sequences.String matching algorithm which is traditionally used to match DNA sequences now takes much longer time to execute because of the large size of DNA data and also the small number of alphabets.To overcome this problem, the indexing methods such as suffix arrays or suffix trees have been introduced.In this study we used suffix arrays as indexing algorithm because it is more applicable, not complex and used less space compared to suffix trees.The parallel method is then introduced to speed up the index construction process. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  2. 2
    Image classification using two dimensional wavelet coefficients with parallel computing

    Image classification using two dimensional wavelet coefficients with parallel computing by Ong, Yew Fai

    Published 2020
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
    Save to List
    Saved in:
  3. 3
    Multi-criteria divisible load scheduling in binary tree network

    Multi-criteria divisible load scheduling in binary tree network by Ghanbari, Shamsollah

    Published 2016
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  4. 4
    Energy-aware task scheduling for streaming applications on NoC-based MPSoCs

    Energy-aware task scheduling for streaming applications on NoC-based MPSoCs by Abd Ishak, Suhaimi Abd Ishak, Wu, Hui, Tariq, Umair Ullah

    Published 2024
    “…Our approach is supported by a set of novel techniques, which include constructing an initial schedule based on a list scheduling where the priority of each task is its approximate successor-tree-consistent deadline such that the workload across all the processors is balanced, a retiming heuristic to transform intraperiod dependencies into inter-period dependencies for enhancing parallelism, assigning an optimal discrete frequency for each task and each message using a Non-Linear Programming (NLP)-based algorithm and an Integer-Linear Programming (ILP)-based algorithm, and an incremental approach to reduce the memory usage of the retimed schedule in case of memory size violations. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  5. 5
    Algorithm optimization and low cost bit-serial architecture design for integer-pixel and sub-pixel motion estimation in H.264/AVC / Mohammad Reza Hosseiny Fatemi

    Algorithm optimization and low cost bit-serial architecture design for integer-pixel and sub-pixel motion estimation in H.264/AVC / Mohammad Reza Hosseiny Fatemi by Hosseiny Fatemi, Mohammad Reza

    Published 2012
    “…The second design uses a 2-D bit-serial adder tree connected to a reconfigurable reference buffer making it suitable for hardware parallelism. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  6. 6
    A 'snowflake' geometrical representation for optimised degree six 3-modified chordal ring networks

    A 'snowflake' geometrical representation for optimised degree six 3-modified chordal ring networks by Chien, Stephen Lim Een, Raja Maamor Shah, Raja Noor Farah Azura, Othman, Mohamed

    Published 2016
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:

Search Tools: