Výsledky vyhledávání - "Complexity of Algorithms"

A Fast Algorithm to Solve Delay Vandermonde Systems in Phased-Array Digital Receivers Autor Perera, Sirani M., Madanayake, Arjuna, Ogle, Austin, Silverio, Daniel, Huang, Jacky Qi

“…Phased-array multibeam RF beamformers require calibration of receivers used in an array of elements before the signals can be applied to an analog beamforming…”
Získat plný text

Hamiltonian problems in directed graphs with simple row patterns Autor Rusu, Irena

“…We define a row pattern of a matrix as a model (or a condition) to be satisfied by each row of the matrix, independently of the other rows. When applied to…”
Získat plný text

Approximation algorithms for solving the heterogeneous rooted tree/path cover problems Autor Pan, Pengxiang, Lichen, Junran, Yang, Ping, Li, Jianping

“…In this paper, we consider the heterogeneous rooted tree cover (HRTC) problem, which further generalizes the rooted tree cover problem. Specifically, given a…”
Získat plný text

A deterministic algorithm for the discrete logarithm problem in a semigroup Autor Tinani, Simran, Rosenthal, Joachim

“…The discrete logarithm problem (DLP) in a finite group is the basis for many protocols in cryptography. The best general algorithms which solve this problem…”
Získat plný text

A Parametric Kernel Function Generating the best Known Iteration Bound for Large-Update Methods for CQSDO Autor Loubna, Guerra, Mohamed, Achache

“…In this paper, we propose a large-update primal-dual interior point algorithm for convex quadratic semidefiniteoptimization (CQSDO) based on a new parametric…”
Získat plný text

Aplicação e comparação de métodos numéricos na solução de sistemas de equações lineares em problemas de treliças espaciais Autor Luiz Antonio Farani de Souza, Rodrigo dos Santos Veloso Martins, Juliana Castanon Xavier, Johannes Hosp Porto

“…Uma das aplicações interessantes da engenharia civil é a treliça espacial, um elemento tridimensional, particularmente utilizado como cobertura para estruturas…”
Získat plný text

A variant of the large sieve inequality with explicit constants Autor Grześkowiak, Maciej

“…We give an effective version with explicit constants of the large sieve inequality for imaginary quadratic fields. Explicit results of this kind are useful for…”
Získat plný text

Algebraic Bayesian Networks: Checking Backbone Connectivity Autor Maksimov, A. G., Tulupyev, A. L.

“…The paper investigates one of the problems arising in machine learning of bases of knowledge fragments with uncertainty, presented in the form of algebraic…”
Získat plný text

A new O(m + kn log d) algorithm to Find the k shortest paths in acyclic digraphs Autor Mehdi Kadivar

“…We give an algorithm, called T*, for finding the k shortest simplepaths connecting a certain pair of nodes, s and t, in a acyclic digraph.First the nodes of…”
Získat plný text

Idempotent and tropical mathematics; complexity of algorithms and interval analysis Autor Litvinov, G.L.

“…A very brief introduction to tropical and idempotent mathematics is presented. Tropical mathematics can be treated as a result of a dequantization of the…”
Získat plný text

Complexity analysis and numerical implementation of a full-Newton step interior-point algorithm for LCCO Autor Achache, Mohamed, Goutali, Moufida

“…In this paper, we present a primal-dual interior point algorithm for linearly constrained convex optimization (LCCO). The algorithm uses only full-Newton step…”
Získat plný text

Algorithmic aspects of Steiner convexity and enumeration of Steiner trees Autor Dourado, Mitre C., Oliveira, Rodolfo A., Protti, Fábio

“…For a set W of vertices of a connected graph G = ( V ( G ) , E ( G ) ) , a Steiner W-tree is a connected subgraph T of G such that W ⊆ V ( T ) and | E ( T ) |…”
Získat plný text

Inverse Linear Difference Operators Autor Abramov, S. A.

“…For matrices whose elements are scalar linear difference operators, algorithms for checking invertibility (unimodularity) and constructing an inverse matrix…”
Získat plný text

Nominative data with ordered set of names Autor Volodymyr G. Skobelev, Ievgen Ivanov, Mykola Nikitchenko

“…In the paper we analyze the set of nominative sets, which can be considered as some mathematical model for data used in computing systems, under assumption…”
Získat plný text

Average case complexity results for a centering algorithm for linear programming problems under Gaussian distributions Autor Huhn, Petra, Wehlitz, Verena

“…To solve linear programming problems by interior point methods an approximately centered interior point has to be known. Such a point can be found by an…”
Získat plný text

Link Reversal Routing with Binary Link Labels: Work Complexity Autor Charron-Bost, Bernadette, Gaillard, Antoine, Welch, Jennifer L., Widder, Josef

“…Full Reversal and Partial Reversal are two well-known routing algorithms that were introduced by Gafni and Bertsekas [IEEE Trans. Commun., 29 (1981), pp…”
Získat plný text

A weighted full-Newton step primal-dual interior point algorithm for convex quadratic optimization Autor Mohamed, Achache

“…In this paper a new weighted short-step primal-dual interior point algorithm to solve convex quadratic optimization (CQO) problems. The algorithm uses at each…”
Získat plný text

Precise Estimates for the Time Complexity of Implementing Algorithms of Set-Theoretic Operations in Table Algebras Autor Red’ko, V. N., Buy, D. B., Kanarskaya, I. S., Senchenko, A. S.

“…Algorithms implementing intersection, union, and difference in table algebras are investigated. Modifications of the most widespread algorithms reducing the…”
Získat plný text

Complexity Analysis of an Interior Point Algorithm for the Semidefinite Optimization Based on a Kernel Function with a Double Barrier Term Autor Achache, Mohamed

“…In this paper, we establish the polynomial complexity of a primal-dual path-following interior point algorithm for solving semidefinite optimization（SDO）…”
Získat plný text

Mutual upper bounds of size and time for a Turing machine and a Markov–Post algorithm for mutual simulations Autor Kosovskii, N. K., Kosovskaya, T. M., Kosovskii, N. N.

“…A Markov–Post algorithm and a Turing machine, which have mutual upper bounds on time and space, are proven to be interchangeable up to a linear function of…”
Získat plný text