Suchergebnisse - Linear complexity algorithm

R-estimation in linear models: algorithms, complexity, challenges: R-estimation in linear models: algorithms, complexity von Antoch, Jaromír, Černý, Michal, Miura, Ryozo

“… The main objective of this paper is to discuss selected computational aspects of robust estimation in the linear model with the emphasis on R -estimators …”
Volltext

L Algorithm—A Linear Computational Complexity Graph Searching Algorithm for Path Planning von Niewola, Adam, Podsedkowski, Leszek

“… ) ensures the linear computational complexity of the L* algorithm because the nodes in the current bucket can be processed in any sequence and it is not necessary to sort the bucket …”
Volltext

3D Urban UAV Relay Placement: Linear Complexity Algorithm and Analysis von Chen, Junting, Mitra, Urbashi, Gesbert, David

“… Optimal unmanned aerial vehicle (UAV) placement in a 3-dimensional (3D) space to build a connection between a base station (BS) and a ground user is studied …”
Volltext

Linear time complexity sorting algorithms for electromagnetic transient simulation of MMC-HVdc system von Xu, Jianzhong, Xu, Yiliang, Zhao, Yuchen, Zhao, Chengyong, Ding, Hui, Zhang, Yi

“… ). This study proposes linear time complexity sorting algorithms for nearest level control-based BE and TR MMC models to further accelerate the EMT simulation of the equivalent MMC-HVdc models …”
Volltext

Algorithm–A Linear Computational Complexity Graph Searching Algorithm for Path Planning von Niewola, Adam, Podsedkowski, Leszek

“… (buckets) ensures the linear computational complexity of the [L.sup.*] algorithm because the nodes in the current bucket can be processed in any sequence and it is not necessary to sort the bucket …”
Volltext

A versatile, linear complexity algorithm for flow routing in topographies with depressions von Cordonnier, Guillaume, Bovy, Benoît, Braun, Jean

“… Although this represents many operations, a linear time complexity can be reached for the whole computation, making it very efficient …”
Volltext

Short-HotStuff: Two-Chain BFT Algorithm With Linear Complexity and Optimistic Responsiveness von Zhu, Fei, You, Lin, Wang, Jixiang, Li, Lei

“… HotStuff is a pipelined Byzantine Fault Tolerance (BFT) algorithm that has the good properties of both linear communication complexity and optimistic responsiveness …”
Volltext

R-estimation in linear models: algorithms, complexity, challenges von Antoch, Jaromír, Černý, Michal, Miura, Ryozo

“… The main objective of this paper is to discuss selected computational aspects of robust estimation in the linear model with the emphasis on R-estimators …”
Volltext

Complexity of large-update interior point algorithm for P ∗ ( κ ) linear complementarity problems von Cho, G.M., Kim, M.K., Lee, Y.H.

“… ) linear complementarity problems (LCPs). We extend Bai et al.’s primal–dual interior point algorithm for linear optimization (LO) problems to P ∗ ( κ …”
Volltext

A Versatile, Linear Complexity Algorithm for Flow Routing in Topographies with Depressions von Cordonnier, Guillaume, Bovy, Benoît, Braun, Jean

“… Although this represents 5 many operations, a linear time-complexity can be reached for the whole computation, making it very efficient …”
Volltext

Features gradient-based signals selection algorithm of linear complexity for convolutional neural networks von Omae, Yuto, Sakai, Yusuke, Takahashi, Hirotaka

“… In this study, we proposed a features gradient-based signals selection algorithm (FG-SSA), which can be used for finding and removing non-important signals …”
Volltext

Polynomial worst-case iteration complexity of quasi-Newton primal-dual interior point algorithms for linear programming: Worst-case complexity for quasi-Newton IPMs von Gondzio, Jacek, Sobral, Francisco N. C.

“… In this work, we show that a simplified quasi-Newton primal-dual interior point algorithm for linear programming, which alternates between Newton and quasi-Newton iterations, enjoys polynomial worst …”
Volltext

Time complexity analysis of quantum algorithms via linear representations for nonlinear ordinary and partial differential equations von Jin, Shi, Liu, Nana, Yu, Yue

“… We compare the quantum linear systems algorithms based methods and the quantum simulation methods arising from different numerical approximations, including the finite difference discretisations …”
Volltext

Linear complexity algorithms for maximum throughput in radio networks and input queued switches von Tassiulas, L.

“… We propose a class of maximum throughput scheduling policies for the model introduced by Tassiulas and Ephremides that have linear complexity and can lead to practical implementations …”
Volltext

Democratic instance selection: A linear complexity instance selection algorithm based on classifier ensemble concepts von García-Osorio, César, de Haro-García, Aida, García-Pedrajas, Nicolás

“… Although current algorithms are useful for fairly large datasets, scaling problems are found when the number of instances is in the hundreds of thousands or millions …”
Volltext

An Efficient point-in-convex 3D polyhedron test using a projective algorithm with sub-linear expected complexity von Skala, Vaclav

“… We propose a novel algorithm for determining whether a given point lies within a convex polyhedron, achieving a sub-linear computational expected complexity of , where N represents the number …”
Volltext

Independent Roman Domination: The Complexity and Linear-Time Algorithm for Trees von Duan, Zhixing, Jiang, Huiqin, Liu, Xinyue, Wu, Pu, Shao, Zehui

“… Then, we research the difference in complexity between the decision problem of RDF and IRDF. Finally, we propose a linear-time algorithm for computing the minimum weight of an independent Roman dominating function in trees …”
Volltext

Fast adaptive PARAFAC decomposition algorithm with linear complexity von Viet-Dung Nguyen, Abed-Meraim, Karim, Nguyen Linh-Trung

“… We present a fast adaptive PARAFAC decomposition algorithm with low computational complexity …”
Volltext

A Low-Complexity Linear Precoding Algorithm Based on Jacobi Method for Massive MIMO Systems von Minango, Juan, de Almeida, Celso

“… To avoid the matrix inversion, in this paper, we propose a novel low-complexity linear precoding algorithm based on Jacobi method (JM …”
Volltext

Linear Time Complexity Algorithms for Time Domain Simulations of the Structural Mechanical Behaviour of Submarine Power Cables in Offshore Wind Power Applications von Schutt, Clemens, Otto, Christoph, Kosleck, Sascha, Mutschler, Patrick, Sander, Manuela, Quick, Henrich

“… A part of modern submarine power cables is freely suspended in the water column and subject to hydrodynamic loads. It is thus important to carry out time …”
Volltext