Circulant matrix

Known as: Circulant, Circulant determinant, Circulant matrices 
In linear algebra, a circulant matrix is a special kind of Toeplitz matrix where each row vector is rotated one element to the right relative to the… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2017
Highly Cited
2017
Structured output support vector machine (SVM) based tracking algorithms have shown favorable performance recently. Nonetheless… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • table 2
Is this relevant?
Highly Cited
2015
Highly Cited
2015
We explore the redundancy of parameters in deep neural networks by replacing the conventional linear projection in fully… (More)
  • table 1
  • table 2
  • table 4
  • table 5
  • figure 1
Is this relevant?
Highly Cited
2014
Highly Cited
2014
Binary embedding of high-dimensional data requires long codes to preserve the discriminative power of the input space… (More)
  • table 1
  • figure 1
  • table 2
  • figure 5
  • table 3
Is this relevant?
Highly Cited
2012
Highly Cited
2012
function k = dgk(x1, x2, sigma) % Eq. 16 c = fftshift(ifft2(fft2(x1) .* conj(fft2(x2)))); d = x1(:)'*x1(:) + x2(:)'*x2(:) 2*c; k… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Compressive sensing encodes a signal into a relatively small number of incoherent linear measurements. In theory, the optimal… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Compressed sensing seeks to recover a sparse vector from a small number of linear and non-adaptive measurements. While most work… (More)
Is this relevant?
Highly Cited
2004
Highly Cited
2004
A class of algebraically structured quasi-cyclic (QC) low-density parity-check (LDPC) codes and their convolutional counterparts… (More)
  • figure 1
  • figure 2
  • table I
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2004
Highly Cited
2004
This correspondence presents three algebraic methods for constructing low-density parity-check (LDPC) codes. These methods are… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2004
Highly Cited
2004
In this correspondence, the construction of low-density parity-check (LDPC) codes from circulant permutation matrices is… (More)
  • table II
  • table IV
  • table III
  • figure 2
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Geostatistical simulations often require the generation of numerous realizations of a stationary Gaussian process over a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?