Results 281 to 290 of about 3,702,049 (302)
Some of the next articles are maybe not open access.
Separable Representations of Rings of Operators
The Annals of Mathematics, 1957Let A be a ring of operators (i.e., a weakly closed self-adjoint algebra of operators containing the identity) in a Hilbert space H. By a representation of A we understand an algebraic *-homomorphism ? of A into the algebra of all bounded operators on some Hilbert space K, which carries the identity into the identity operator.
Feldman, J., Fell, J. M. G.
openaire +1 more source
Separating learning and representation
1996Two of the most promising aspects of connectionist natural language research have been (i) the use of powerful statistical learning techniques to model language learning and (ii) the development of new representational theories. Often the two are treated together; some part of a grammar is induced by a net and the subsequent representations are ...
Noel E. Sharkey, Amanda J. C. Sharkey
openaire +1 more source
Faithful Representation of Separable Distributions
Neural Computation, 1997A geometric approach to data representation incorporating information theoretic ideas is presented. The task of finding a faithful representation, where the input distribution is evenly partitioned into regions of equal mass, is addressed. For input consisting of mixtures of statistically independent sources, we treat independent component analysis ...
Juan K. Lin +2 more
openaire +1 more source
The Separable Representations of U(H)
Proceedings of the American Mathematical Society, 1988Let H be a separable infinite-dimensional Hilbert space. Denote U(H) the unitary group of H, provided with the operator norm topology. By a result of Kadison, U(H) has a, up to complex scalars, unique closed normal subgroup \(U(H)_{\infty}\) consisting of unitary operators U of the form \(U=I+T\) with T a compact operator.
openaire +1 more source
Towards Clustering-friendly Representations: Subspace Clustering via Graph Filtering
ACM Multimedia, 2020Finding a suitable data representation for a specific task has been shown to be crucial in many applications. The success of subspace clustering depends on the assumption that the data can be separated into different subspaces.
Zhengrui Ma +4 more
semanticscholar +1 more source
Person Search by Separated Modeling and A Mask-Guided Two-Stream CNN Model
IEEE Transactions on Image Processing, 2020In this work, we tackle the problem of person search, which is a challenging task consisted of pedestrian detection and person re-identification (re-ID).
Di Chen +4 more
semanticscholar +1 more source
Compact Representations of Separable Graphs
1986We consider the problem of representing graphs compactly while supporting queries efficiently. In particular we describe a data structure for representing n-vertex unlabeled graphs that satisfy an O(nc)-separator theorem, c < 1. The structure uses O(n) bits, and supports adjacency and degree queries in constant time, and neighbor listing in constant
Blandford, Daniel K. +2 more
openaire +1 more source
Analysis of Sparse Representation and Blind Source Separation
Neural Computation, 2004In this letter, we analyze a two-stage cluster-then-l1-optimization approach for sparse representation of a data matrix, which is also a promising approach for blind source separation (BSS) in which fewer sensors than sources are present. First, sparse representation (factorization) of a data matrix is discussed. For a given overcomplete basis matrix,
Li, Yuanqing +2 more
openaire +2 more sources
Minimal Lower Separable Representations: Characterization and Construction
1989A ``lower (triangular) separable representation'' of an \(n\times m\) matrix function k defined on the square [a,b]\(\times [a,b]\) consists of an \(n\times p\) matrix function f and a \(p\times m\) matrix function g defined on [a,b], such that \(k(s,t)=f(t)g(s)\) on the triangle \(a\leq s\leq t\leq b\).
Kaashoek, M. A., Woerdeman, H. J.
openaire +2 more sources
Separable Representations of Two-Body Interactions
Physical Review C, 1973Consideration is given to the approximation in which an arbitrary potential is replaced by a separable potential. A method is presented which permits the construction of a rank-$N$ separable potential which has the property that the resulting $T$ matrix is exact on the energy shell and half off the energy shell at $N$ selected bound state and/or ...
D. J. Ernst, C. M. Shakin, R. M. Thaler
openaire +1 more source

