Results 21 to 30 of about 425,843 (182)
A Generalized Bootstrap Technique for Dependent Observations
Recoletos Multidisciplinary Research Journal, 2014 The bootstrap method for re-sampling essentially obtains the re-sampled observations from the empirical distribution function of the original data. The method relies heavily on the assumption of independence of the observations (iid).
Roberto N. Padua +2 more
doaj +1 more source
An Accurate and Efficient Device-Free Localization Approach Based on Sparse Coding in Subspace
IEEE Access, 2018 In practical device-free localization (DFL) applications, for enlarging the monitoring area and improving localization accuracy, too many nodes need to be deployed, which results in a large volume of DFL data with high dimensions.
Huakun Huang +5 more
doaj +1 more source
Journal of Functional Analysis, 2001 The authors establish a correspondence between the reducing subspaces of a self-adjoint operator on a separable Hilbert space operator that come from a spectral projection and the convex, norm-closed bands in the set of finite Borel measures on the real line. Several applications are obtained.
Killip, Rowan, Remling, Christian
openaire +2 more sources
Wasit Journal of Engineering Sciences, 2013 This paper presents a subspace method of spot centroiding algorithm for locating the centers of laser spots. It focuses on how to find the position of the activated pixel which is the position of the imaged spot on the detector of the camera using ...
Azad Raheem Kareem
doaj +1 more source
Any $2\otimes n$ subspace is locally distinguishable [PDF]
, 2010 A subspace of a multipartite Hilbert space is called \textit{locally indistinguishable} if any orthogonal basis of this subspace cannot be perfectly distinguished by local operations and classical communication. Previously it was shown that any $m\otimes
Duan, Runyao +2 more
core +1 more source
About Subspace-Frequently Hypercyclic Operators [PDF]
Sahand Communications in Mathematical Analysis, 2020 In this paper, we introduce subspace-frequently hypercyclic operators. We show that these operators are subspace-hypercyclic and there are subspace-hypercyclic operators that are not subspace-frequently hypercyclic. There is a criterion like to subspace-
Mansooreh Moosapoor, Mohammad Shahriari
doaj +1 more source
CS Decomposition Based Bayesian Subspace Estimation [PDF]
, 2012 In numerous applications, it is required to estimate the principal subspace of the data, possibly from a very limited number of samples. Additionally, it often occurs that some rough knowledge about this subspace is available and could be used to improve
Besson, Olivier +2 more
core +3 more sources
Existence of common and upper frequently hypercyclic subspaces [PDF]
, 2014 We provide criteria for the existence of upper frequently hypercyclic subspaces and for common hypercyclic subspaces, which include the following consequences.
Bès, Juan, Menet, Quentin
core +2 more sources
Cyclic subspace codes via subspace polynomials
Designs, Codes and Cryptography, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kamil Otal, Ferruh Özbudak
openaire +3 more sources
Optimal Binary Subspace Codes of Length 6, Constant Dimension 3 and Minimum Distance 4 [PDF]
, 2014 It is shown that the maximum size of a binary subspace code of packet length $v=6$, minimum subspace distance $d=4$, and constant dimension $k=3$ is $M=77$; in Finite Geometry terms, the maximum number of planes in $\operatorname{PG}(5,2)$ mutually ...
Honold, Thomas +2 more
core +2 more sources