Results 61 to 70 of about 425,843 (182)
Joint & Progressive Learning from High-Dimensional Data for Multi-Label Classification [PDF]
, 2018 Despite the fact that nonlinear subspace learning techniques (e.g. manifold learning) have successfully applied to data representation, there is still room for improvement in explainability (explicit mapping), generalization (out-of-samples), and cost ...
Hong, Danfeng +3 more
core +1 more source
Distributed Low-rank Subspace Segmentation
, 2013 Vision problems ranging from image clustering to motion segmentation to semi-supervised learning can naturally be framed as subspace segmentation problems, in which one aims to recover multiple low-dimensional subspaces from noisy and corrupted input ...
Chang, Shih-Fu +4 more
core +1 more source
Sea Clutter Suppression Method Based on Correlation Features
Journal of Marine Science and EngineeringRadar target detection in a sea clutter environment is of significant importance in both civilian and military applications, with the detection of small maneuvering targets being particularly challenging.
Zhen Li +5 more
doaj +1 more source
Arab Journal of Mathematical Sciences, 2017 In this paper, we define and study subspace-diskcyclic operators. We show that subspace-diskcyclicity does not imply diskcyclicity. We establish a subspace-diskcyclic criterion and use it to find a subspace-diskcyclic operator that is not subspace ...
Nareen Bamerni, Adem Kılıçman
doaj +1 more source
Algebraic List-decoding of Subspace Codes [PDF]
, 2012 Subspace codes were introduced in order to correct errors and erasures for randomized network coding, in the case where network topology is unknown (the noncoherent case).
Mahdavifar, Hessam, Vardy, Alexander
core
Proceedings of the forty-fourth annual ACM symposium on Theory of computing, 2012 In this work we describe an explicit, simple, construction of large subsets of F^n, where F is a finite field, that have small intersection with every k-dimensional affine subspace. Interest in the explicit construction of such sets, termed subspace-evasive sets, started in the work of Pudlak and Rodl (2004) who showed how such constructions over the ...
Dvir, Zeev, Lovett, Shachar
openaire +2 more sources
Detecting Fourier Subspaces [PDF]
Journal of Fourier Analysis and Applications, 2015 Let G be a finite abelian group. We examine the discrepancy between subspaces of l^2(G) which are diagonalized in the standard basis and subspaces which are diagonalized in the dual Fourier basis. The general principle is that a Fourier subspace whose dimension is small compared to |G| = dim(l^2(G)) tends to be far away from standard subspaces.
Akemann, Charles, Weaver, Nik
openaire +3 more sources
A NEW REPRESENTATION RESULT FOR STOCHASTIC DIFFERENTIAL EQUATIONS WITH INFINITE MARKOV JUMPS AND MULTIPLICATIVE NOISE [PDF]
Fiabilitate şi Durabilitate, 2012 In this paper we give a new representation of the conditional mean square of the solutions for a classof stochastic differential linear equations with infinite Markov jumps (SDELMs) and multiplicative noise. Theobtained result is related to the solutions
Viorica Maria Ungureanu
doaj
A rough set based subspace clustering technique for high dimensional data
Journal of King Saud University: Computer and Information Sciences, 2020 Subspace clustering aims at identifying subspaces for cluster formation so that the data is categorized in different perspectives. The conventional subspace clustering algorithms explore dense clusters in all the possible subspaces.
B. Jaya Lakshmi, M. Shashi, K.B. Madhuri
doaj +1 more source
IEEE AccessAs wireless communication technology rapidly develops, multipath channel effects pose a severe challenge to the effectiveness of orthogonal frequency division multiplexing systems.
Jinyu Guo
doaj +1 more source