Results 221 to 230 of about 107,922 (254)
Some of the next articles are maybe not open access.
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 +2 more sources
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 +2 more sources
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
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
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 +2 more sources
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
2006
As pattern recognition methods, subspace methods have attracted much attention in the fields of face, object and video-based recognition in recent years. In subspace methods, each instance is characterized by a subspace that is spanned by a set of vectors. Thus, the distance between instances reduces to the distance between subspaces.
Xichen Sun, QianSheng Cheng
openaire +2 more sources
As pattern recognition methods, subspace methods have attracted much attention in the fields of face, object and video-based recognition in recent years. In subspace methods, each instance is characterized by a subspace that is spanned by a set of vectors. Thus, the distance between instances reduces to the distance between subspaces.
Xichen Sun, QianSheng Cheng
openaire +2 more sources
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 +2 more sources
Detection of subspace waveforms in subspace interference and noise
2000 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.00CH37100), 2002The natural models of multi-access communication and modern radar and sonar systems involve infinite-dimensional waveform spaces. A common problem in these systems is the detection of subspace signals measured in the presence of subspace interference and broadband noise.
John A. Gubner, Louis L. Scharf
openaire +2 more sources
Interior-compact subspaces and differentiation in model subspaces
Journal of Mathematical Sciences, 2006Let \(\lambda_n\) be a sequence of complex numbers with positive imaginary parts, and assign to them some multiplicities \(m_n \in \mathbb N\). Denote by \(E\) the subspace of \(L_2(0, +\infty)\) spanned by the functions \(t^{k-1}\exp(-i\bar{\lambda}_nt)\), \(n \in \mathbb N\), \(1\leq k \leq m_n\).
openaire +2 more sources
On the subspace distance of the subspace codes
Summary: Let \(\mathcal{P}_q(n)\) be the set of all subspaces in the vector space \(\mathbb{F}_q^n\). There is a subspace distance \(d_S(U, V)\) between any two subspaces \(U\) and \(V\). A subspace code is also a subset of \(\mathcal{P}_q(n)\). It is known that \(d_S(U, V)\geq d_H(\nu(\pi U), \nu(\pi V))\), where \(\pi\in S_n\), \(\nu(U)\) denotes theSadrolhoffaz, Seyedeh Hawra +1 more
openaire +1 more source

