Results 41 to 50 of about 425,843 (182)
Fusing Local and Global Information for One-Step Multi-View Subspace Clustering
Multi-view subspace clustering has drawn significant attention in the pattern recognition and machine learning research community. However, most of the existing multi-view subspace clustering methods are still limited in two aspects.
Yiqiang Duan +3 more
doaj +1 more source
On the topology of free paratopological groups
The result often known as Joiner's lemma is fundamental in understanding the topology of the free topological group $F(X)$ on a Tychonoff space$X$. In this paper, an analogue of Joiner's lemma for the free paratopological group $\FP(X)$ on a $T_1$ space $
Elfard, Ali Sayed, Nickolas, Peter
core +1 more source
In this study, a direct position tracking method for non-circular (NC) signals using distributed passive arrays is proposed. First, we calculate the initial positions of sources using a direct position determination (DPD) approach; next, we transform the
Jinke Cao, Xiaofei Zhang, Honghao Hao
doaj +1 more source
Optimizing Tree-Based Contrast Subspace Mining Using Genetic Algorithm
Mining contrast subspace is a task of finding contrast subspace where a given query object is most similar to a target class but dissimilar to non-target class in a multidimensional data set.
Florence Sia, Rayner Alfred
doaj +1 more source
Tensor products of subspace lattices and rank one density
We show that, if $M$ is a subspace lattice with the property that the rank one subspace of its operator algebra is weak* dense, $L$ is a commutative subspace lattice and $P$ is the lattice of all projections on a separable infinite dimensional Hilbert ...
A. Hopenwasser +16 more
core +1 more source
Explicit subspace designs [PDF]
An \((s,A)\) subspace design is a set of linear subspaces \(H_1, \dots, H_M\) of \(F_q^m\) such that for every \(s\)-dimensional subspace \(W\) of \(F_q^m\) at most \(A\) of the \(H_i\) intersect \(W\) non-trivially. In this paper, the authors refine the construction of the first author and \textit{C.
Guruswami, Venkatesan, Kopparty, Swastik
openaire +2 more sources
In this paper, we define subspace-ergodic operators and give examples of these operators. We show that by any given separable infinite-dimensional Banach space, subspace-ergodic operators can be constructed.
Mansooreh Moosapoor
doaj +1 more source
MOON: A Subspace-Based Multi-Branch Network for Object Detection in Remotely Sensed Images
The effectiveness of training-based object detection heavily depends on the amount of sample data. But in the field of remote sensing, the amount of sample data is difficult to meet the needs of network training due to the non-cooperative imaging modes ...
Huan Zhang +3 more
doaj +1 more source
A Fault-tolerance Subspace Clustering Algorithm in Data Mining [PDF]
In order to improve the computation efficiency of the subspace clustering algorithm,this paper gives a general fault-tolerance subspace clustering definition according to the number of objects,dimensions,mode tolerance and relative threshold constraint ...
TIAN Jinhua,SUN Li
doaj +1 more source
Subspace variational quantum simulator
Quantum simulation is one of the key applications of quantum computing, which accelerates research and development in the fields such as chemistry and material science.
Kentaro Heya +10 more
doaj +1 more source

