Scholars Central

Search Scholars Central

Articles, journals and conferences in one search. An exact title, DOI or ISSN is listed first.

Advanced searchHide advanced search

In the search box: "exact phrase" · -leave out · OR · prefix* · title: author: journal:

Years

26–50 of 652 articles for Algorithm computation complexity

Then save them, add them to a collection or cite them together.
  1. Research article · 13 Jul 2015

    VLSI Implementation and Area Efficient Cordic based Integer DCT Architectures for HEVC

    International Journal of Innovative Research in Science, Engineering and Technology · Volume 4, Issue 5

    traditional operations. The Experimental result shows that the proposed Dct algorithm has not only reduces the computational complexity. Significantly, it also keeps the better transformation quality of the efficient…

  2. Conference abstract · 21 Sep 2015

    Efficient power allocations for multicarrier systems

    rate if greedy power allocation is considered. The problem of the greedy algorithm is its associated computation complexity bottleneck which prevents its use in many recent wireless applications. The focus…

  3. Research article · Jul 2014

    SVPWM for two Legged Three Phase Multilevel Inverters – a Simplified Approach on 16 Bit Microcontroller Platform

    International Journal of Innovative Research in Science, Engineering and Technology · Volume 3, Issue 5

    extended to any n-level inverter configuration without any computational complexity. The validation of the algorithm through simulations in MATLAB/SIMULINK and experimental in PIC24HJ128GP310 microcontroller has been…

  4. Research article · Jan 2014

    Computing List of Ordered Pairs from Disjoint Closed Interval to compute a most Probable Delay Path:NPHard in polynomial time

    International Journal of Innovative Research in Computer and Communication Engineering · Volume 2, Issue 1

    Hard problem in polynomial time with the help of approximation algorithm. Second case, otherwise the computational complexity of the problem remains non-polynomial. Normally, the network operator needs to find ... this…

For authors and organisers

Publish, present and keep up with your field

Find the right journal for your paper and submit your manuscript.

Photo: Pexels