Results 81 to 90 of about 12,220 (210)
Efficient Tensor Completion Algorithms for Highly Oscillatory Operators
ABSTRACT We address the problem of recovering highly oscillatory operators, represented as n×n$$ n\times n $$ matrices with a fixed set of observed entries. Given that these matrices can be well compressed by butterfly matrix decomposition of L=𝒪(logn) levels requiring only O(nlogn)$$ O\left(n\log n\right) $$ degrees of freedom, we propose a novel ...
Navjot Singh +3 more
wiley +1 more source
Abstract Active learning (AL) has emerged as a pedagogical response to diverse educational challenges across multiple disciplines. This scoping review maps the terrain of AL implementation patterns, examining AL practices in Business Education, Information and Communication Technology (ICT) Engineering, Mathematics, and Statistics from 2015 until the ...
Dubravka Novkovic +2 more
wiley +1 more source
Performance of static vs dynamic OpenMP-based ordered PageRank algorithm for link analysis. Unordered PageRank is the standard method of calculating PageRank (as given in the original PageRank paper by Larry Page et al.
Subhajit Sahu
core +1 more source
HYBRID MPI/OPEN-MP ACCELERATION APPROACH FOR HIGH-ORDER SCHEMES FOR CFD
The paper presents a hybrid MPI+ OpenMP (Message Passing Interface/Open Multi-Processor) algorithm used for parallel programs based on the high-order compact method.
MICHAL SACZEK +3 more
doaj +1 more source
Effect of adjusting threads with OpenMP-based Louvain algorithm for community detection. Louvain is an algorithm for detecting communities in graphs. Community detection helps us understand the natural divisions in a network in an unsupervised manner. It
Subhajit Sahu
core +1 more source
Running scientific codes on amazon EC2: a performance analysis of five high-end instances
Amazon Web Services (AWS) is a well-known public Infrastructure-as-a-Service (IaaS) provider whose Elastic Computing Cloud (EC2) o ering includes some instances, known as cluster instances, aimed at High-Performance Computing (HPC) applications.
Roberto R. Expósito +4 more
doaj
Effect of using different values of tolerance with barrier-free iterations in OpenMP-based ordered PageRank algorithm for link analysis. Unordered PageRank is the standard approach of PageRank computation (as described in the original paper by Larry Page
Subhajit Sahu
core +1 more source
An OpenMP-based tool for finding longest common subsequence in bioinformatics
Objective Finding the longest common subsequence (LCS) among sequences is NP-hard. This is an important problem in bioinformatics for DNA sequence alignment and pattern discovery.
Rayhan Shikder +3 more
doaj +1 more source
Comparison of barrier vs barrier-free iterations with fixed iterations in OpenMP-based PageRank algorithm for link analysis. Unordered PageRank is the standard approach of PageRank computation (as described in the original paper by Larry Page et al. (1)),
Subhajit Sahu
core +1 more source
Adaptive energy minimization of OpenMP parallel applications on many-core systems
Energy minimization of parallel applications is an emerging challenge for current and future generations of many-core computing systems. In this paper, we propose a novel and scalable energy minimization approach that suitably applies DVFS in the ...
Yang, Sheng +4 more
core +1 more source

