Results 251 to 260 of about 1,725,284 (283)
Some of the next articles are maybe not open access.
The complex backpropagation algorithm
IEEE Transactions on Signal Processing, 1991The backpropagation (BP) algorithm that provides a popular method for the design of a multilayer neural network to include complex coefficients and complex signals so that it can be applied to general radar signal processing and communications problems. It is shown that the network can classify complex signals. The generalization of the BP to deal with
Henry Leung, Simon Haykin 0001
openaire +1 more source
On the complexity of search algorithms
IEEE Transactions on Computers, 1992The average complexity for searching a record in a sorted file of records that are stored on a tape is analyzed for four search algorithms, namely, sequential search, binary search, Fibonacci search, and a modified version of Fibonacci search. The theoretical results are consistent with the recent simulation results by S. Nishihara and N. Nishino (1987)
Kuo-Liang Chung +2 more
openaire +1 more source
Proceedings of the international symposium on Symbolic and algebraic computation - ISSAC '94, 1994
For computing free resolutions over a polynomial ring the usual approach consists in iterating the Buchburger's algorithm for each module in the resolution. In this paper, we propose one single algorithm which can be viewed as a generalization of Buchberger's to chain complexes.
openaire +1 more source
For computing free resolutions over a polynomial ring the usual approach consists in iterating the Buchburger's algorithm for each module in the resolution. In this paper, we propose one single algorithm which can be viewed as a generalization of Buchberger's to chain complexes.
openaire +1 more source
Complexity of Makanin's algorithm
Journal of the ACM, 1996The exponent of periodicity is an important factor in estimates of complexity of word-unification algorithms. We prove that the exponent of periodicity of a minimal solution of a word equation is of order 2 1.07d , where d is the length of the equation. We also give a lower bound 2
Antoni Koscielski, Leszek Pacholski
openaire +2 more sources
Complexity Theory and Algorithms
2000This workshop embraces algorithmic and complexity theory issues in parallel computing. A total of 10 submissions were received. Three papers were accepted, two as regular papers, one as a research note.
Friedhelm Meyer auf der Heide +2 more
openaire +1 more source
On the complex backpropagation algorithm
IEEE Transactions on Signal Processing, 1992A recursive algorithm for updating the coefficients of a neural network structure for complex signals is presented. Various complex activation functions are considered and a practical definition is proposed. The method, associated to a mean-square-error criterion, yields the complex form of the conventional backpropagation algorithm. >
BENVENUTO, NEVIO, F. Piazza
openaire +1 more source
Complexity Theory and Algorithms
2002The goal of algorithm design and complexity theory in parallel/distributed computing is to study efficient algorithms for (and limitations on the complexity of) problems, taking into account such parallel complexity measures as the number of processing nodes or the amount of communication, in addition to classical measures like time and space. Research
openaire +1 more source
The complexity of the Quantum Adiabatic Algorithm
Computer Physics Communications, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
A. P. Young +2 more
openaire +3 more sources
Complexity of Combinatorial Algorithms
SIAM Review, 1978This paper examines recent work on the complexity of combinatorial algorithms, highlighting the aims of the work, the mathematical tools used, and the important results. Included are sections discussing ways to measure the complexity of an algorithm, methods for proving that certain problems are very hard to solve, tools useful in the design of good ...
openaire +2 more sources
Graph Subcolorings: Complexity and Algorithms
SIAM Journal on Discrete Mathematics, 2003Summary: In a graph coloring, each color class induces a disjoint union of isolated vertices. A graph subcoloring generalizes this concept, since here each color class induces a disjoint union of complete graphs. \textit{P. Erdős} [Mat. Lapok 18, 283-288 (1967; Zbl 0193.24302)] and, independently, \textit{M. O. Albertson} et al. [Discrete Math.
Jirí Fiala 0001 +3 more
openaire +4 more sources