5100 search results - page 43 / 1020 » The Linear Complexity of a Graph |
AAECC
2002
Springer
13 years 7 months ago
2002
Springer
It is shown that a q-periodic sequence over the finite field Fq passes an extended version of Marsaglia's lattice test for high dimensions if and only if its linear complexity...
MP
2011
13 years 2 months ago
2011
We perform a smoothed analysis of Renegar’s condition number for linear programming by analyzing the distribution of the distance to ill-posedness of a linear program subject to...
HAPTICS
2009
IEEE
14 years 2 months ago
2009
IEEE
The force-update-rate requirements of transparent rendering of virtual environments are in conflict with the computational cost required for computing complex interactions betwee...
WCC
2005
Springer
14 years 1 months ago
2005
Springer
In this paper, we discuss some methods of constructing frequency/time hopping (FH/TH) sequences over GF(pk ) by taking successive k-tuples of given sequences over GF(p). We are abl...
COMPUTING
2010
13 years 5 months ago
2010
In this paper, we introduce and analyze a modification of the Hermitian and skewHermitian splitting iteration method for solving a broad class of complex symmetric linear systems....