Results 271 to 280 of about 3,487,435 (303)
Some of the next articles are maybe not open access.

Computing Minimal Spanning Subgraphs in Linear Time

SIAM Journal on Computing, 1995
A graph property \(P\) is monotone if the addition of an edge to a \(P\)-graph results in a \(P\)-graph. An edge \(e\) of a \(P\)-graph \(G\) is essential if \(G-e\) is not a \(P\)-graph. This paper discusses several algorithms to construct a minimal spanning \(P\)-subgraph for a given \(P\)-graph as also their adaptations for the case of digraphs. The
Han, X.   +3 more
openaire   +4 more sources

Linear spans of modified de Bruijn sequences

IEEE Transactions on Information Theory, 1990
Summary: Order \(n\) modified de Bruijn sequences are created by removing a single zero from the longest run of zeros in period \(2^ n\) de Bruijn sequences. The \(M\) sequences are then the natural undisguised linear subset of modified de Bruijn sequences.
Gregory L. Mayhew, Solomon W. Golomb
openaire   +3 more sources

Student learning of basis, span and linear independence in linear algebra

International Journal of Mathematical Education in Science and Technology, 2010
One of the earlier, more challenging concepts in linear algebra at university is that of basis. Students are often taught procedurally how to find a basis for a subspace using matrix manipulation, but may struggle with understanding the construct of basis, making further progress harder.
Sepideh Stewart, Michael O.J. Thomas
openaire   +1 more source

Recursive Variable Span Linear Filter for Noise Reduction

IEEE Signal Processing Letters, 2019
The design of variable span linear filters for noise reduction involves a generalized eigenvalue decomposition problem that is of high computational complexity. In order to address this issue, this work proposes a recursive algorithm that computes the filter weights with streaming signal data.
Yingke Zhao   +2 more
openaire   +1 more source

A linear-time algorithm for finding a minimum spanning pseudoforest

Information Processing Letters, 1988
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Harold N. Gabow, Robert Endre Tarjan
openaire   +3 more sources

Locally Linear Minimum Spanning Trees for Manifold Learning

2013 12th International Conference on Machine Learning and Applications, 2013
Graph-based manifold learning techniques have become of paramount importance when researchers have been faced to nonlinear data. These techniques have allowed them to discover relations that usual approaches such as PCA and MDS were incapable of. However, properties such as non-uniform sampling, varied topological substructures and highly curved ...
Carlos A. Quintero, Fernando Lozano
openaire   +1 more source

The Linear Vector Space Spanned by the Nonlinear Filter Generator

2007
The filter generator is an important building block in many stream ciphers. The generator consists of a linear feedback shift register (LFSR) of length n and a Boolean filtering function of degree d that combines bits from the shift register and creates an output bit zt at any time t.
Sondre Rønjom, Tor Helleseth
openaire   +1 more source

Linear span of extended sequences and cascaded GMW sequences

IEEE Transactions on Information Theory, 1999
Summary: The linear span of extended sequences of period \(2^{em}-1\) which are constructed from the ideally correlated sequences of period of \(2^m-1\) is derived. It is also shown that the linear span of cascaded GMW sequences can be derived in the same context.
Habong Chung, Jong-Seon No
openaire   +1 more source

Binary Sequences with Optimal Correlations and Large Linear Span

2006 IEEE International Conference on Communications, 2006
A family of binary sequences is presented and proved to have optimal correlations and large linear span. It includes the small set of Kasami sequences, No sequence set and TN sequence set as special cases. A lower bound on the linear span of the family is provided.
Xiangyong Zeng   +3 more
openaire   +2 more sources

A linear algorithm for centering a spanning tree of a biconnected graph

Information Processing Letters, 1994
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
K. S. Easwarakumar   +2 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy