Výsledky vyhledávání - Parallel and Time Complexity

Barcode Recognition Using Sequential and Parallel Approach Autor Kusur, Chidanand S., Shirdhonkar, M. S.

“… for the detection and recognition of barcodes from the videos of racks of books. The proposed system showed that, the parallel approach is time efficient in comparison…”
Získat plný text

TOP: Trajectory Optimization via Parallel Optimization Towards Constant Time Complexity Autor Yu, Jiajun, Chen, Nanhe, Liu, Guodong, Xu, Chao, Gao, Fei, Cao, Yanjun

“… The proposed framework reduces the time complexity to <inline-formula><tex-math notation="LaTeX">O(1)</tex-math></inline-formula> per iteration with respect to the number of segments, compared…”
Získat plný text

On parallel time in population protocols Autor Czumaj, Artur, Lingas, Andrzej

“…The parallel time of a population protocol is defined as the average number of required interactions in which an agent in the protocol participates, i.e…”
Získat plný text

Defining Asymptotic Parallel Time Complexity of Data-dependent Algorithms Autor Fritzsche, Paula, Rexachs, Dolores, Luque, Emilio

“… As a consequence, the end-users of these systems have a vested interest in defining the asymptotic time complexity of parallel algorithms to predict their performance on a particular parallel computer…”
Získat plný text

Imperative Process Algebra and Models of Parallel Computation Autor Middelburg, Cornelis A.

“…Studies of issues related to computability and computational complexity involve the use of a model of computation…”
Získat plný text

Bandwidth enhancement in delta sigma modulator transmitter using low complexity time-interleaved parallel delta sigma modulator Autor Majd, Nasser Erfani, Ghafoorifard, Hassan, Mohammadi, Abbas

“… In this research, the bandwidth of DSM-transmitter is increased four times by using low complexity four-branch time-interleaved parallel DSM without the need for increasing clock speed…”
Získat plný text

Time Complexity of Training DNNs With Parallel Computing for Wireless Communications Autor Cong, Pengyu, Yang, Chenyang, Han, Shengqian, Han, Shuangfeng, Wang, Xiaoyun

“… While DNNs have demonstrated the ability to reduce the time complexity of inference, their training often incurs a high computational cost…”
Získat plný text

A parallel multi-unit resource deadlock detection algorithm with O ( log 2 ( min ( m , n ) ) ) overall run-time complexity Autor Xiao, Xiang, Lee, Jaehwan John

“… To address the application deadlock problem in current and future MPSoCs, this article proposes a parallel multi-unit resource deadlock detection algorithm, incorporating four contributions: (1…”
Získat plný text

A complexity analysis of parallel scheduling unit-time jobs with in-tree precedence constraints while minimizing the mean flow time Autor Wang, Tianyu, Bellenguez-Morineau, Odile

“…This paper deals with a particular scheduling problem. We consider unit-time jobs and in-tree precedence constraints while minimizing the mean flow time…”
Získat plný text

Low Complexity Parallel Carrier Frequency Offset Estimation Based on Time-Tagged QPSK Partitioning for Coherent Free-Space Optical Communication Autor Zhang, Siqi, Wang, Liqian, Liu, Kunfeng, Ding, Shuang

“…) communication, we propose a parallel carrier frequency offset estimation (FOE) scheme based on time-tagged QPSK partitioning (TTQP…”
Získat plný text

The Complexity of Parallel Machine Scheduling of Unit-Processing-Time Jobs under Level-Order Precedence Constraints Autor Wang, Tianyu, Bellenguez-Morineau, Odile

“…In this paper, we prove that parallel machine scheduling problems where jobs have unit processing time and level-order precedence constraints are NP-complete, while minimizing the makespan or the total completion time…”
Získat plný text

PS-GS: Group-Wise Parallel Rendering with Stage-Wise Complexity Reductions for Real-Time 3D Gaussian Splatting Autor Jo, Joongho, Park, Jongsun

“…) in both rendering speed and image quality. Despite its advantages, running 3D-GS on mobile or edge devices in real-time remains challenging due to large computational complexity…”
Získat plný text

Dense SDM (12-Core \times 3-Mode) Transmission Over 527 km With 33.2-ns Mode-Dispersion Employing Low-Complexity Parallel MIMO Frequency-Domain Equalization Autor Shibahara, Kohki, Doohwan Lee, Kobayashi, Takayuki, Mizuno, Takayuki, Takara, Hidehiko, Sano, Akihide, Kawakami, Hiroto, Miyamoto, Yutaka, Ono, Hirotaka, Oguma, Manabu, Abe, Yoshiteru, Matsui, Takashi, Fukumoto, Ryohei, Amma, Yoshimichi, Hosokawa, Tsukasa, Matsuo, Shoichiro, Saitoh, Kunimasa, Yamada, Makoto, Morioka, Toshio

“…). We first discuss the advantages of parallel MIMO FDE technique in long-haul SDM transmission systems in terms of the computational complexity, and then, compare the complexity required for parallel…”
Získat plný text

QTMS: A quadratic time complexity topology-aware process mapping method for large-scale parallel applications on shared HPC system Autor Yan, Baicheng, Xiao, Limin, Qin, Guangjun, Yang, Zhang, Dong, Bin, Yu, Haonan, Wu, Hongyu

“…•A quadratic time complexity topology-aware process mapping method is proposed.•The method is effective for process mapping on shared HPC systems…”
Získat plný text

Stimulus complexity and prospective timing: Clues for a parallel process model of time perception Autor Aubry, Florent, Guillaume, Nicolas, Mogicato, Giovanni, Bergeret, Laure, Celsis, Pierre

“…Whereas many studies have considered the role of attention in prospective timing, fewer have established relations between movement complexity and prospective timing…”
Získat plný text

Complexity of interval minmax regret scheduling on parallel identical machines with total completion time criterion Autor Drwal, Maciej, Rischke, Roman

“…We consider the problem of scheduling jobs on parallel identical machines, where only interval bounds of processing times of jobs are known…”
Získat plný text

Tight Time Complexities in Parallel Stochastic Optimization with Arbitrary Computation Dynamics Autor Tyurin, Alexander

“…In distributed stochastic optimization, where parallel and asynchronous methods are employed, we establish optimal time complexities under virtually any computation behavior of workers/devices/CPUs…”
Získat plný text

m -ary Balanced Codes With Parallel Decoding Autor Pelusi, Danilo, Elmougy, Samir, Tallini, Luca G., Bose, Bella

“… In fact, the decoding time complexity is O(1) digit operations. These schemes are a generalization to the m-ary alphabet of Knuth's complementation method with parallel decoding. Let ( n w…”
Získat plný text

Multivariate CNN-LSTM Model for Multiple Parallel Financial Time-Series Prediction Autor Widiputra, Harya, Mailangkay, Adele, Gautama, Elliana

“… in assessing the global economic and financial situation, making it a critical topic to monitor over time…”
Získat plný text

Optimal Time Complexities of Parallel Stochastic Optimization Methods Under a Fixed Computation Model Autor Tyurin, Alexander, Richtárik, Peter

“… While the minimax complexities are well known for sequential optimization methods, the theory of parallel optimization methods is less explored…”
Získat plný text