Results 41 to 50 of about 22,781,989 (354)
Time complexity of concurrent programs [PDF]
International Workshop on Formal Aspects of Component Software, 2015 We study the problem of automatically computing the time complexity of concurrent object-oriented programs. To determine this complexity we use intermediate abstract descriptions that record relevant information for the time analysis cost of statements ...
Elena Giachino +3 more
semanticscholar +1 more source
A Comprehensive Evaluation of Graph Kernels for Unattributed Graphs
Entropy, 2018 Graph kernels are of vital importance in the field of graph comparison and classification. However, how to compare and evaluate graph kernels and how to choose an optimal kernel for a practical classification problem remain open problems.
Yi Zhang, Lulu Wang, Liandong Wang
doaj +1 more source
D2Former: A Fully Complex Dual-Path Dual-Decoder Conformer Network using Joint Complex Masking and Complex Spectral Mapping for Monaural Speech Enhancement [PDF]
arXiv, 2023 Monaural speech enhancement has been widely studied using real networks in the time-frequency (TF) domain. However, the input and the target are naturally complex-valued in the TF domain, a fully complex network is highly desirable for effectively learning the feature representation and modelling the sequence in the complex domain.
arxiv
Time complexity and gate complexity
, 2010 We formulate and investigate the simplest version of time-optimal quantum computation theory (t-QCT), where the computation time is defined by the physical one and the Hamiltonian contains only one- and two-qubit interactions.
D. J. Tannor +5 more
core +1 more source
On Finding All Reducts of Consistent Decision Tables
Cybernetics and Information Technologies, 2015 The problem of finding reducts plays an important role in processing information on decision tables. The objective of the attribute reduction problem is to reject a redundant attribute in order to find a core attribute for data processing.
Janos Demetrovics +2 more
doaj +1 more source
A Multi-Phase Method for Euclidean Traveling Salesman Problems
Axioms, 2022 The Traveling Salesman Problem (TSP) aims to find the shortest tour for a salesman who starts and ends in the same city and visits the remaining n−1 cities exactly once.
Víctor Hugo Pacheco-Valencia +3 more
doaj +1 more source
Computational Complexity of Modified Blowfish Cryptographic Algorithm on Video Data
Algorithms, 2022 Background: The technological revolution has allowed users to exchange data and information in various fields, and this is one of the most prevalent uses of computer technologies.
Abidemi Emmanuel Adeniyi +3 more
doaj +1 more source
Branch Less, Cut More and Schedule Jobs with Release and Delivery Times on Uniform Machines
Mathematics, 2021 We consider the problem of scheduling n jobs with identical processing times and given release as well as delivery times on m uniform machines. The goal is to minimize the makespan, i.e., the maximum full completion time of any job.
Nodari Vakhania, Frank Werner
doaj +1 more source
Space-Time Complexity in Hamiltonian Dynamics
, 2003 New notions of the complexity function C(epsilon;t,s) and entropy function S(epsilon;t,s) are introduced to describe systems with nonzero or zero Lyapunov exponents or systems that exhibit strong intermittent behavior with ``flights'', trappings, weak ...
Brudno A. A. +7 more
core +1 more source
Real-Time Single Image and Video Super-Resolution Using an Efficient Sub-Pixel Convolutional Neural Network [PDF]
Computer Vision and Pattern Recognition, 2016 Recently, several models based on deep neural networks have achieved great success in terms of both reconstruction accuracy and computational performance for single image super-resolution. In these methods, the low resolution (LR) input image is upscaled
Wenzhe Shi +7 more
semanticscholar +1 more source