Výsledky vyhledávání - "Linear complexity algorithms"

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

“…A resource allocation model that has within its scope a number of computer and communication network architectures was introduced by Tassiulas and Ephremides…”
Získat plný text

Linear-complexity algorithms for QoS support in input-queued switches with no speedup Autor Kam, A.C., Kai-Yeung Siu

“…We present several fast, practical linear-complexity scheduling algorithms that enable provision of various quality-of-service (QoS) guarantees in an…”
Získat plný text

A modification of the Dewilde–van der Veen method for inversion of finite structured matrices Autor Eidelman, Y., Gohberg, I.

“…We study a class of block structured matrices R={ R ij } i, j=1 N with a property that the solution of the corresponding system Rx= y of linear algebraic…”
Získat plný text

Out-of-band quasiseparable matrices Autor Eidelman, Y., Gohberg, I.

“…We study structured matrices which consist of a band part and quasiseparable parts below and upper the band. We extend algorithms known for quasiseparable…”
Získat plný text

Linear complexity algorithms for hierarchical routing Autor Hachtel, G.D., Morrison, C.R.

“…A hierarchical procedure for net routing on l*m*n grid-graphs, where l is the number of layers, m is the number of rows, and n is the number of columns, is…”
Získat plný text

Linear complexity algorithms for maximum advance deflection routing in some networks Autor Mneimneh, S., Quessette, F.

“… We examine two settings: non capacitated networks and capacitated networks. We present linear complexity algorithms for maximum advance deflection routing in networks with topological…”
Získat plný text

Structural and computational properties of possibly singular semiseparable matrices Autor Fasino, D., Gemignani, L.

“…A classical result of structured numerical linear algebra states that the inverse of a nonsingular semiseparable matrix is a tridiagonal matrix. Such a…”
Získat plný text

Linear complexity algorithms for bandwidth reservations and delay guarantees in input-queued switches with no speedup Autor Kam, A.C., Kai-Yeung Siu

“…We present several fast, practical linear-complexity scheduling algorithms that enable provision of various quality-of-service (QoS) guarantees in an…”
Získat plný text

3D Urban UAV Relay Placement: Linear Complexity Algorithm and Analysis Autor 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…”
Získat plný text

Multiple Kernel Clustering With Compressed Subspace Alignment Autor Zhou, Sihang, Ou, Qiyuan, Liu, Xinwang, Wang, Siqi, Liu, Luyan, Wang, Siwei, Zhu, En, Yin, Jianping, Xu, Xin

“…Multiple kernel clustering (MKC) has recently achieved remarkable progress in fusing multisource information to boost the clustering performance. However, the…”
Získat plný text

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

“…We present a new algorithm for solving the common problem of flow trapped in closed depressions within digital elevation models, as encountered in many…”
Získat plný text

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

“…We present a new algorithm for solving the common problem of flow trapped in closed depressions within digital elevation models, as encountered in many…”
Získat plný text

A linear complexity algorithm for the automatic generation of convex multiple input multiple output instructions Autor Galuzzi, Carlo, Bertels, Koen, Vassiliadis✝, Stamatis

“… This search turns into an exponential complexity of the solution. In this paper we propose an efficient linear complexity algorithm for the automatic generation of convex…”
Získat plný text

Inversion formulas and linear complexity algorithm for diagonal plus semiseparable matrices Autor Eidelman, Y., Gohberg, I.

“…Matrices represented as a sum of diagonal and semiseparable ones are considered here. These matrices belong to the class of structured matrices which arises in…”
Získat plný text

Generalized Rybicki Press algorithm Autor Ambikasaran, Sivaram

“… Linear complexity banded algorithms for solving linear systems and computing determinants on the larger matrix enable linear complexity algorithms for the initial semi…”
Získat plný text

Accelerating Flexible Manifold Embedding for Scalable Semi-Supervised Learning Autor Qiu, Suo, Nie, Feiping, Xu, Xiangmin, Qing, Chunmei, Xu, Dong

“… To this end, we build upon our previous work flexible manifold embedding (FME) <xref ref-type="bibr" rid="ref1">[1] and propose two novel linear-complexity algorithms called fast flexible manifold embedding…”
Získat plný text

Linear complexity algorithm for semiseparable matrices Autor Koltracht, Israel

Získat plný text

An Almost Exact Linear Complexity Algorithm of the Shortest Transformation of Chain-Cycle Graphs Autor K Yu Gorbunov, Lyubetsky, V A

“…A "genome structure" is a labeled directed graph with vertices of degree 1 or 2. A set of operations over such graphs is fixed, and each of the operations has…”
Získat plný text

The Spiral Search: A Linear Complexity Algorithm for the Generation of Convex MIMO Instruction-Set Extensions Autor Galuzzi, C., Bertels, K., Vassiliadis, S.

“… In this paper we propose a linear complexity algorithm for the generation of convex multiple input multiple output (MIMO…”
Získat plný text

A linear complexity algorithm for the Bernstein basis Autor Delgado, J., Pena, J.M.

“…In this paper we obtain a new corner cutting algorithm for the evaluation of polynomials represented in the Bernstein-Bezier form. This algorithm has linear…”
Získat plný text