Results 21 to 30 of about 107,922 (254)
A Probabilistic Subspace Bound with Application to Active Subspaces [PDF]
Given a real symmetric positive semidefinite matrix $E$, and an approximation $S$ that is a sum of $n$ independent matrix-valued random variables, we present bounds on the relative error in $S$ due to randomization. The bounds do not depend on the matrix dimensions but only on the numerical rank (intrinsic dimension) of $E$.
John T. Holodnak +2 more
openaire +3 more sources
Cyclic subspace codes via subspace polynomials
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kamil Otal, Ferruh Özbudak
openaire +3 more sources
Guruswami and Xing introduced subspace designs in 2013 to give the first construction of positive rate rank metric codes list-decodable beyond half the distance. In this paper we provide bounds involving the parameters of a subspace design, showing they are tight via explicit constructions.
Santonastaso, Paolo, Zullo, Ferdinando
openaire +5 more sources
GLRT-Based Direction Detectors in Homogeneous Noise and Subspace Interference [PDF]
In this paper, we derive and assess decision schemes to discriminate, resorting to an array of sensors, between the H0 hypothesis that data under test contain disturbance only (i.e., noise plus interference) and the H1 hypothesis that they also contain ...
Ricci, Giuseppe +12 more
core +2 more sources
Let \(T\) and \(D\) be the translation and unitary dilation operators on \(L^2(\mathbb{R})\) given by \((Tf)(t)= f(t- 1)\) and \((Df)(t)=\sqrt 2f(2t)\). An orthogonal wavelet for a subspace \(X\) of \(L^2(\mathbb{R})\) is a unit vector \(\psi\in X\) such that \(\{D^nT^m\psi: n,m\in\mathbb{Z}\}\) is an orthonormal basis of \(X\).
Dai, Xingde, Lu, Shijie
openaire +3 more sources
Detection of a signal in linear subspace with bounded mismatch [PDF]
We consider the problem of detecting a signal of interest in a background of noise with unknown covariance matrix, taking into account a possible mismatch between the actual steering vector and the presumed one.
Besson, Olivier
core +1 more source
An \(n\)-dimensional vector space over the field \(F\) with \(q\) elements gives rise to an \((n-1)\)-dimensional projective space. The set of subspaces \(S\) of either space becomes a metric space by the subspace distance: \(d(U,U'):=\dim(U+U')-\dim(U\cap U')\), \(U,U'\in S\). These metric spaces are canonically isomorphic. The authors construct a \(q\
Antonio Cossidente, Francesco Pavese
openaire +5 more sources
For a finite-dimensional algebra \(A\) over an infinite field \(K\), the subspace semigroup \({\mathcal S}(A)\) consists of all subspaces of \(A\) with operation \(V*W=\text{lin}_KVW\), the linear span of \(VW\) over \(K\). The authors describe the structure of \({\mathcal S}(A)\), showing in particular that, similar to any linear algebraic semigroup, \
Okniński, Jan, Putcha, Mohan S.
openaire +2 more sources
—Subspace-based blind and group-blind space–time (ST) multiuser detection (MUD) is invoked for a smart-antenna-aided gen-eralized multicarrier direct-sequence code-division multiple-access (MC DS-CDMA) system communicating over a dispersive ST Rayleigh ...
Lie-liang Yang +8 more
core +1 more source
Discriminative Semantic Subspace Analysis for Relevance Feedback [PDF]
Content-based image retrieval (CBIR) has attracted much attention during the past decades for its potential practical applications to image database management. A variety of relevance feedback (RF) schemes have been designed to bridge the gap between low-
Zhang, Lining +6 more
core +1 more source

