Results 151 to 160 of about 425,843 (182)
Some of the next articles are maybe not open access.
1998
Abstract Let pc(r)(n,q) be the set of r-spaces of PG(n,q) and let ø (r;n,q) be the cardinality of PG(r)(n,q). Also, let 𝒳 (s,r; n,q) be the number of r-spaces through r-space of PG(n,q).
openaire +1 more source
Abstract Let pc(r)(n,q) be the set of r-spaces of PG(n,q) and let ø (r;n,q) be the cardinality of PG(r)(n,q). Also, let 𝒳 (s,r; n,q) be the number of r-spaces through r-space of PG(n,q).
openaire +1 more source
Computing in Science & Engineering, 2000
This survey article reviews the history and current importance of Krylov subspace iteration algorithms.
openaire +2 more sources
This survey article reviews the history and current importance of Krylov subspace iteration algorithms.
openaire +2 more sources
Fast Parameter-Free Multi-View Subspace Clustering With Consensus Anchor Guidance
IEEE Transactions on Image Processing, 2022Siwei Wang, Xinwang Liu, Xinzhong Zhu
exaly
Generalized Latent Multi-View Subspace Clustering
IEEE Transactions on Pattern Analysis and Machine Intelligence, 2020Changqing Zhang, Huazhu Fu, Qinghua Hu
exaly
Multimodal sparse and low-rank subspace clustering
Information Fusion, 2018Mahdi Abavisani, Vishal M Patel
exaly
Robust Recovery of Subspace Structures by Low-Rank Representation
IEEE Transactions on Pattern Analysis and Machine Intelligence, 2013Guangcan Liu, Zhou-Chen Lin, Ju Sun
exaly

