Homomorphic Model Selection for Data Analysis in an Encrypted Domain
Secure computation, a methodology of computing on encrypted data, has become a key factor in machine learning. Homomorphic encryption (HE) enables computation on encrypted data without leaking any information to untrusted servers.
Mi Yeon Hong, Joon Soo Yoo, Ji Won Yoon
doaj +1 more source
Finiteness theorems on elliptical billiards and a variant of the dynamical Mordell–Lang conjecture
Abstract We offer some theorems, mainly finiteness results, for certain patterns in elliptical billiards, related to periodic trajectories; these seem to be the first finiteness results in this context. For instance, if two players hit a ball at a given position and with directions forming a fixed angle in (0,π)$(0,\pi )$, there are only finitely many ...
Pietro Corvaja, Umberto Zannier
wiley +1 more source
Using graphics processors to accelerate the computation of the matrix inverse [PDF]
We study the use of massively parallel architectures for computing a matrix inverse. Two different algorithms are reviewed, the traditional approach based on Gaussian elimination and the Gauss-Jordan elimination alternative, and several high ...
Ezzatti, Pablo +2 more
core +1 more source
Designing an efficient test pattern generator using input reduction with linear operations [PDF]
Advances in fabrication technology have resulted in more complicated systems, being used in ever increasing numbers of applications. The large increase in transistor counts versus the number of pins on the chip has made VLSI testing much harder than ever
Lee, Kangjoo
core +1 more source
Trading Off Performance for Energy in Linear Algebra Operations with Applications in Control Theory
We analyze the performance-power-energy balance of a conventional Intel Xeon mul- ticore processor and two low-power architectures –an Intel Atom processor and a sys- tem with a quad-core ARM Cortex A9+NVIDIA Quadro 1000M– using a high perfor- mance ...
Peter Benner +3 more
doaj +1 more source
Uplink Multiuser MIMO Detection Scheme with Reduced Computational Complexity [PDF]
The wireless communication systems with multiple antennas have recently received significant attention due to their higher capacity and better immunity to fading channels as compared to single antenna systems.
Cho, S., Park, S. K.
core +2 more sources
Reduced complexity and latency for a massive MIMO system using a parallel detection algorithm
In recent years, massive MIMO systems have been widely researched to realize high-speed data transmission. Since massive MIMO systems use a large number of antennas, these systems require huge complexity to detect the signal.
Shoichi Higuchi, Chang-Jun Ahn
doaj +1 more source
Execute Elementary Row and Column Operations on the Partitioned Matrix to Compute M-P Inverse A†
We first study the complexity of the algorithm presented in Guo and Huang (2010). After that, a new explicit formula for computational of the Moore-Penrose inverse A† of a singular or rectangular matrix A.
Xingping Sheng
doaj +1 more source
An Improved Blind Recognition Method of the Convolutional Interleaver Parameters in a Noisy Channel
In a digital communication system, forward error correction (FEC) codes and interleavers are implemented to code the data so as to improve the error performance, which is hindered by random and burst errors. In the context of noncooperative communication,
Yiyao Xu, Yang Zhong, Zhiping Huang
doaj +1 more source
High-speed hardware architecture for implementations of multivariate signature generations on FPGAs
Multivariate signature belongs to Multivariate-Quadratic-Equations Public Key Cryptography (MPKC), which is secure to quantum computer attacks. Compared with RSA and ECC, it is required to speed up multivariate signature implementations.
Haibo Yi, Zhe Nie
doaj +1 more source

