Results 311 to 320 of about 23,418,736 (380)
Some of the next articles are maybe not open access.
Big-O Time Complexity Analysis Of Algorithm
Signal and Image Processing, 2022Time complexity describes the amount of time taken by the computer to run a code by counting the number of operations performed in an algorithm. Algorithms with optimistic logic tend to have less time complexity.
Swapnil Phalke, Y. Vaidya, S. Metkar
semanticscholar +1 more source
Time Complexity of In-Memory Matrix-Vector Multiplication
IEEE Transactions on Circuits and Systems - II - Express Briefs, 2021Matrix-vector multiplication (MVM) is the core operation of many important algorithms. Crosspoint resistive memory array enables naturally calculating MVM in one operation, thus representing a highly promising computing accelerator for various ...
Zhong Sun, Ru Huang
semanticscholar +1 more source
SSRN Electronic Journal, 2023
Abstract A large literature shows that people’s valuation of delayed financial rewards violates exponential discounting, exhibiting a hyperbolic pattern: high short-run impatience that strongly decreases in the length of the delay. We test the hypothesis that the hyperbolic pattern in measured discount rates over money reflects mistakes ...
Benjamin Enke +2 more
openaire +2 more sources
Abstract A large literature shows that people’s valuation of delayed financial rewards violates exponential discounting, exhibiting a hyperbolic pattern: high short-run impatience that strongly decreases in the length of the delay. We test the hypothesis that the hyperbolic pattern in measured discount rates over money reflects mistakes ...
Benjamin Enke +2 more
openaire +2 more sources
Annales Universitatis Scientiarum Budapestinensis de Rolando Eötvös Nominatae. Sectio computatorica, 2021
Tibor Gregorics
openaire +2 more sources
Tibor Gregorics
openaire +2 more sources
The Time Complexity Analysis of Neural Network Model Configurations
2020 International Conference on Mathematics and Computers in Science and Engineering (MACISE), 2020The neural network algorithms, such as the deep-learning approach, have been widely applied in dealing with the computer vision problems. The more sophisticated the neural network model is designed; the more computing resources and processing time will ...
Rich C. Lee, Ing-Yi Chen
semanticscholar +1 more source
Span programs and quantum time complexity
International Symposium on Mathematical Foundations of Computer Science, 2020Span programs are an important model of quantum computation due to their tight correspondence with quantum query complexity. For any decision problem $f$, the minimum complexity of a span program for $f$ is equal, up to a constant factor, to the quantum ...
A. Cornelissen +3 more
semanticscholar +1 more source
Accelerating Diffusion Models with Parallel Sampling: Inference at Sub-Linear Time Complexity
Neural Information Processing SystemsDiffusion models have become a leading method for generative modeling of both image and scientific data. As these models are costly to train and \emph{evaluate}, reducing the inference cost for diffusion models remains a major goal.
Haoxuan Chen +3 more
semanticscholar +1 more source
Technique for Mitigating Time Complexity
Machine Learning for Human IntelligenceOrdered data may be handled rapidly, however unstructured data may require additional time to get results. Sorting is employed for data organization. This is a fundamental requirement for most applications, and this step enhances performance.
Faheem Naveed +2 more
semanticscholar +1 more source
Challenging the Time Complexity of Exact Subgraph Isomorphism for Huge and Dense Graphs with VF3
IEEE Transactions on Pattern Analysis and Machine Intelligence, 2018Graph matching is essential in several fields that use structured information, such as biology, chemistry, social networks, knowledge management, document analysis and others.
Vincenzo Carletti +3 more
semanticscholar +1 more source