Results 31 to 40 of about 425,843 (182)
A real negative selection algorithm with evolutionary preference for anomaly detection
Open Physics, 2017 Traditional real negative selection algorithms (RNSAs) adopt the estimated coverage (c0) as the algorithm termination threshold, and generate detectors randomly.
Yang Tao, Chen Wen, Li Tao
doaj +1 more source
The research of improved MUSIC algorithm based on far field sound source localization
Dianzi Jishu Yingyong, 2018 Systemic research has been done on the thesis of far field sound source localization combined characteristics of the speech signal in this paper. An improved MUSIC algorithm is proposed based on the traditional MUSIC algorithm in far-field of microphone ...
Deng Yanrong +5 more
doaj +1 more source
A Subspace Approach to Sparse Sampling Based Data Gathering in Wireless Sensor Networks
Sensors, 2020 Data gathering is an essential concern in Wireless Sensor Networks (WSNs). This paper proposes an efficient data gathering method in clustered WSNs based on sparse sampling to reduce energy consumption and prolong the network lifetime. For data gathering
Jingfei He +3 more
doaj +1 more source
Slow feature subspace: A video representation based on slow feature analysis for action recognition
Machine Learning with Applications, 2023 This paper proposes a new video representation for subspace-based action recognition. Traditional subspace-based methods represent a video as a subspace by applying principal component analysis (PCA) to its frames. However, this subspace might lead to an
Suzana Rita Alves Beleza +3 more
doaj +1 more source
Matched direction detectors [PDF]
, 2005 In this paper, we address the problem of detecting a signal whose associated spatial signature is subject to uncertainties, in the presence of subspace interference and broadband noise, and using multiple snapshots from an array of sensors.
Besson, Olivier +2 more
core +1 more source
Multiple pattern classification by sparse subspace decomposition
, 2009 A robust classification method is developed on the basis of sparse subspace decomposition. This method tries to decompose a mixture of subspaces of unlabeled data (queries) into class subspaces as few as possible.
Sakai, Tomoya
core +1 more source
Stabilization of Unstable Procedures: The Recursive Projection Method [PDF]
, 1993 Fixed-point iterative procedures for solving nonlinear parameter dependent problems can converge for some interval of parameter values and diverge as the parameter changes.
Keller, Herbert B., Shroff, Gautam M.
core +2 more sources
Extremal sizes of subspace partitions
, 2011 A subspace partition $\Pi$ of $V=V(n,q)$ is a collection of subspaces of $V$ such that each 1-dimensional subspace of $V$ is in exactly one subspace of $\Pi$. The size of $\Pi$ is the number of its subspaces.
Heden, Olof +3 more
core +1 more source
Subspace Hamiltonian technique [PDF]
Physical Review B, 1986 Journals published by the American Physical Society can be found at http://journals.aps.org/
Allen, Roland E., MENON, M.
openaire +3 more sources
High Density Subspace Clustering Algorithm for High Dimensional Data
Journal of Harbin University of Science and Technology, 2020 Highdimensional data have the characteristics of sparsity and vulnerability to dimension disaster, which makes it is difficult to ensure the precision and efficiency of high dimensional data clustering Therefore the method of subspace clustering is ...
WAN Jing +3 more
doaj +1 more source