Results 281 to 290 of about 72,703 (318)
Some of the next articles are maybe not open access.
Is a subspace containing a splitting subspace a splitting subspace?
Statistics & Probability Letters, 2008zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Bulletin of the London Mathematical Society, 2003
This survey describes some recent results on linear subspaces in which all elements, except the zero vector, are supercyclic for a given supercyclic operator. Before stating some results precisely, we need to recall that the set of normal eigenvalues of an operator \(T\), denoted by \(\sigma_0(T)\), is the set of isolated points in the spectrum of \(T\)
Montes-Rodríguez, Alfonso +1 more
openaire +2 more sources
This survey describes some recent results on linear subspaces in which all elements, except the zero vector, are supercyclic for a given supercyclic operator. Before stating some results precisely, we need to recall that the set of normal eigenvalues of an operator \(T\), denoted by \(\sigma_0(T)\), is the set of isolated points in the spectrum of \(T\)
Montes-Rodríguez, Alfonso +1 more
openaire +2 more sources
2009 Seventh International Workshop on Content-Based Multimedia Indexing, 2009
We are interested in designing a data structure for n objects of dimension d, with the following objectives: Space requirements should be O(d * n) and the query time should be O(d * log(n)). Such a structure corresponds to subspace trees. A subspace tree divides the distances between the subspaces.
openaire +1 more source
We are interested in designing a data structure for n objects of dimension d, with the following objectives: Space requirements should be O(d * n) and the query time should be O(d * log(n)). Such a structure corresponds to subspace trees. A subspace tree divides the distances between the subspaces.
openaire +1 more source
2009
This paper is a survey of bounds and constructions for subspace codes designed for the injection metric, a distance measure that arises in the context of correcting adversarial packet insertions in linear network coding. The construction of lifted rank-metric codes is reviewed, along with improved constructions leading to codes with strictly more ...
Azadeh Khaleghi +2 more
openaire +1 more source
This paper is a survey of bounds and constructions for subspace codes designed for the injection metric, a distance measure that arises in the context of correcting adversarial packet insertions in linear network coding. The construction of lifted rank-metric codes is reviewed, along with improved constructions leading to codes with strictly more ...
Azadeh Khaleghi +2 more
openaire +1 more source
WIREs Data Mining and Knowledge Discovery, 2012
AbstractSubspace clusteringrefers to the task of identifying clusters of similar objects or data records (vectors) where the similarity is defined with respect to a subset of the attributes (i.e., a subspace of the data space). The subspace is not necessarily (and actually is usually not) the same for different clusters within one clustering solution ...
Hans-Peter Kriegel +2 more
openaire +1 more source
AbstractSubspace clusteringrefers to the task of identifying clusters of similar objects or data records (vectors) where the similarity is defined with respect to a subset of the attributes (i.e., a subspace of the data space). The subspace is not necessarily (and actually is usually not) the same for different clusters within one clustering solution ...
Hans-Peter Kriegel +2 more
openaire +1 more source
On the Deformation of a Subspace
Journal of the London Mathematical Society, 1936(Die Symbolik dieser Abhandlung ist den Arbeiten von \textit{J. A. Schouten} und \textit{E. R. van Kampen} [Prace Mat.-Fiz. 41, 1--19 (1933; Zbl 0008.17902)] und \textit{J. A. Schouten} und \textit{D. J. Struik} [Einführung in die neueren Methoden der Differentialgeometrie. Band 1. Groningen (1935; Zbl 0011.17404)] entnommen.
openaire +2 more sources
Matched subspace beamforming using signal subspace
2011 8th International Conference on Information, Communications & Signal Processing, 2011In this paper, the manifold vector of the desired signal is assumed to lie in a known subspace, but the associated coordinates are random variables. This model is suitable for the fast varying environment. The so-called matched subspace beamforming is referred to as the beamformer resolving the signal that are drawn from this multi-dimension subspace ...
Jie Zhuang, Wei Huang
openaire +1 more source
Proceedings of the 24th international conference on Machine learning, 2007
We generalize the Winnow algorithm for learning disjunctions to learning subspaces of low rank. Subspaces are represented by symmetric projection matrices. The online algorithm maintains its uncertainty about the hidden low rank projection matrix as a symmetric positive definite matrix. This matrix is updated using a version of the Matrix Exponentiated
openaire +1 more source
We generalize the Winnow algorithm for learning disjunctions to learning subspaces of low rank. Subspaces are represented by symmetric projection matrices. The online algorithm maintains its uncertainty about the hidden low rank projection matrix as a symmetric positive definite matrix. This matrix is updated using a version of the Matrix Exponentiated
openaire +1 more source
Top Subspace Synthesizing for Promotional Subspace Mining
2011 IEEE 23rd International Conference on Tools with Artificial Intelligence, 2011In Promotional Subspace Mining (PSM), Pat Ranking provides an effective way to locate the outstanding subspaces for a given object among a group of competitive objects in multidimensional data. In this paper, we propose a top subspace synthesis framework that aims to integrate the results produced through independent Pat Ranking procedures on multiple ...
Yan Zhang, Yiyu Jia, Chunying Zhao
openaire +1 more source
Union of Subspaces Signal Detection In Subspace Interference
2018 IEEE Statistical Signal Processing Workshop (SSP), 2018This paper investigates detection theory for signals belonging to a union of subspaces (UoS) in the presence of an interference subspace and white noise of unknown variance. Generalized likelihood ratio tests are provided for both signal detection and “active” subspace detection under the UoS model.
Muhammad Asad Lodhi, Waheed U. Bajwa
openaire +1 more source