Results 31 to 40 of about 38,175 (260)
Efficient ab initio many-body calculations based on sparse modeling of Matsubara Green's function
SciPost Physics Lecture Notes, 2022 This lecture note reviews recently proposed sparse-modeling approaches for efficient ab initio many-body calculations based on the data compression of Green's functions.
Hiroshi Shinaoka, Naoya Chikano, Emanuel Gull, Jia Li, Takuya Nomoto, Junya Otsuki, Markus Wallerberger, Tianchun Wang, Kazuyoshi Yoshimi
doaj +1 more source
An improved method for counting 6-cycles in low-density parity-check codes [PDF]
Serbian Journal of Electrical Engineering, 2023 Since their rediscovery in the early 1990s, low-density parity-check (LDPC) codes have become the most popular error-correcting codes owing to their excellent performance. An LDPC code is a linear block code that has a sparse parity-check matrix.
Slimani Djamel, Kaddai Abdellah
doaj +1 more source
On Design and Efficient Decoding of Sparse Random Linear Network Codes
IEEE Access, 2017 While random linear network coding is known to improve network reliability and throughput, its high costs for delivering coding coefficients and decoding represent an obstacle where nodes have limited power to transmit and decode packets.
Ye Li, Wai-Yip Chan, Steven D. Blostein
doaj +1 more source
Nature Communications, 2023 Neural computation is often traced in terms of either rate- or phase-codes. However, most circuit operations will simultaneously affect information across both coding schemes. It remains unclear how phase and rate coded information is transmitted, in the
Daniel Müller-Komorowska +3 more
doaj +1 more source
Transformational Sparse Coding
CoRR, 2017 A fundamental problem faced by object recognition systems is that objects and their features can appear in different locations, scales and orientations. Current deep learning methods attempt to achieve invariance to local translations via pooling, discarding the locations of features in the process.
Dimitrios C. Gklezakos, Rajesh P. N. Rao
openaire +2 more sources
Phonological codes constrain output of orthographic codes via sublexical and lexical routes in Chinese written production. [PDF]
PLoS ONE, 2015 To what extent do phonological codes constrain orthographic output in handwritten production? We investigated how phonological codes constrain the selection of orthographic codes via sublexical and lexical routes in Chinese written production ...
Cheng Wang, Qingfang Zhang
doaj +1 more source
Neural Sparse Topical Coding [PDF]
Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), 2018 Topic models with sparsity enhancement have been proven to be effective at learn- ing discriminative and coherent latent top- ics of short texts, which is critical to many scientific and engineering applica- tions. However, the extensions of these models require carefully tailored graphi- cal models and re-deduced inference al- gorithms, limiting their
Min Peng 0002 +6 more
openaire +1 more source
Compressed Sensing Based Non-Orthogonal Pilot Designs for Multi-Antenna Grant-Free Access Systems
IEEE Open Journal of the Communications Society, 2020 Grant-free access is an attractive approach to enable spectrum-efficient low-latency access for systems with massive number of users. Pilot design plays a crucial role for grant-free access as it needs to provide a large number of access codes with fast ...
Ayon Quayum, Hlaing Minn
doaj +1 more source
Sparse Grassmannian Design for Noncoherent Codes via Schubert Cell Decomposition
IEEE Open Journal of the Communications SocietyIn this paper, we propose a method for designing sparse Grassmannian codes for noncoherent multiple-input multiple-output systems. Conventional pairwise error probability formulations under uncorrelated Rayleigh fading channels fail to account for rank ...
Joe Asano +5 more
doaj +1 more source
Моделирование и анализ информационных систем, 2023 The development of fast algorithms for key generation, encryption and decryption not only increases the efficiency of related operations. Such fast algorithms, for example, for asymmetric cryptosystems on quasi-cyclic codes, make it possible to ...
Andrey N. Sushko +4 more
doaj +1 more source