Background Subtraction With Real-Time Semantic Segmentation
IEEE Access, 2019 Accurate and fast foreground (FG) object extraction is very important for object tracking and recognition in video surveillance. Although many background subtraction (BGS) methods have been proposed in the recent past, it is still regarded as a tough ...
Dongdong Zeng +4 more
doaj +1 more source
A Tool for Programming Embarrassingly Task Parallel Applications on CoW and NoW [PDF]
arXiv, 2013 Embarrassingly parallel problems can be split in parts that are characterized by a really low (or sometime absent) exchange of information during their computation in parallel. As a consequence they can be effectively computed in parallel exploiting commodity hardware, hence without particularly sophisticated interconnection networks.
arxiv
Computing connected components on parallel computers [PDF]
, 1979 D. S. Hirschberg +2 more
openalex +1 more source
Intelligent Modelling of the Real Dynamic Viscosity of Rubber Blends Using Parallel Computing. [PDF]
Polymers (Basel), 2023 Kopal I +5 more
europepmc +1 more source
GPU cards as a low cost solution for efficient and fast classification of high dimensional gene expression datasets [PDF]
, 2010 The days when bioinformatics tools will be so reliable to become a standard aid in routine clinical diagnostics are getting very close. However, it is important to remember that the more complex and advanced bioinformatics tools become, the more ...
Benso, Alfredo +4 more
core
Genomics‐led approach to drug testing in models of undifferentiated pleomorphic sarcoma
Molecular Oncology, EarlyView.GA text Genomic data from undifferentiated pleomorphic sarcoma patients and preclinical models were used to inform a targeted drug screen. Selected compounds were tested in 2D and 3D cultures of UPS cell lines. A combination of trametinib and infigratinib was synergistic in the majority of UPS cell lines tested, which was further confirmed in an ex ...
Piotr J. Manasterski +19 more
wiley +1 more source
Asynchronous Parallel Computing Algorithm implemented in 1D Heat Equation with CUDA [PDF]
arXiv, 2015 In this note, we present the stability as well as performance analysis of asynchronous parallel computing algorithm implemented in 1D heat equation with CUDA. The primary objective of this note lies in dissemination of asynchronous parallel computing algorithm by providing CUDA code for fast and easy implementation. We show that the simulations carried
arxiv
Efficient Straggler Replication in Large-Scale Parallel Computing
ACM Transactions on Modeling and Performance Evaluation of Computing Systems, 2015 In a cloud computing job with many parallel tasks, the tasks on the slowest machines (straggling tasks) become the bottleneck in the job completion. Computing frameworks such as MapReduce and Spark tackle this by replicating the straggling tasks and ...
Da Wang, Gauri Joshi, G. Wornell
semanticscholar +1 more source
Key theories and technologies and implementation mechanism of parallel computing for ternary optical computer. [PDF]
PLoS One, 2023 Zhang S +5 more
europepmc +1 more source
Efficiency of universal parallel computers [PDF]
Acta Informatica, 1983 We consider parallel computers (PC's) with fixed communication network and bounded degree. We deal with the following question: How efficiently can one PC, a so-called universal PC, simulate each PC with n processors? This question is asked in [1] where a universal PC with O(n) processors and time loss O(log(n)) is constructed.
openaire +4 more sources