Results 281 to 290 of about 6,970,988 (348)
Two-Input Functional Encryption for Inner Products from Bilinear Maps [PDF]
IACR Cryptology ePrint Archive, 2018 Functional encryption is a new paradigm of public-key encryption that allows a user to compute f (x) on encrypted data CT (x) with a private key SK f to finely control the revealed information.
Kwangsu Lee, Dong Hoon Lee
semanticscholar +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
On Winograd's Algorithm for Inner Products
IEEE Transactions on Computers, 1970This correspondence demonstrates an improvement on Winogard's algorithm for inner products as applied to the multiplication of two matrices.
A. Waksman
openaire +2 more sources
A Note on Inexact Inner Products in GMRES
SIAM Journal on Matrix Analysis and Applications, 2022 International audienceWe show to what extent the accuracy of the inner products computed in the GMRES iterative solver can be reduced as the iterations proceed without affecting the convergence rate or final accuracy achieved by the iterates.
Serge Gratton +2 more
exaly +2 more sources
Fully Secure Functional Encryption for Inner Products, from Standard Assumptions
Annual International Cryptology Conference, 2016 International audienceFunctional encryption is a modern public-key paradigm where a master secret key can be used to derive sub-keys SKF associated with certain functions F in such a way that the decryption operation reveals F (M), if M is the encrypted ...
Shweta Agrawal +2 more
semanticscholar +3 more sources
IEEE Transactions on Computers, 1978
The inner product computer is a special-purpose computational unit intended to be used as an adjunct to a general-purpose digital computer to perform numerical processing tasks which previously exceeded the capacity of the general-purpose computer. The algorithmic structure of the inner product is briefly reviewed in the first section of this paper ...
Earl E. Swartzlander Jr. +2 more
openaire +2 more sources
The inner product computer is a special-purpose computational unit intended to be used as an adjunct to a general-purpose digital computer to perform numerical processing tasks which previously exceeded the capacity of the general-purpose computer. The algorithmic structure of the inner product is briefly reviewed in the first section of this paper ...
Earl E. Swartzlander Jr. +2 more
openaire +2 more sources
Indefinite inner products: Nonstandard involution
, 2014 This chapter fixes a nonstandard involution φ. It introduces indefinite inner products defined on Hn×1 of the symmetric and skewsymmetric types associated with φ and matrices having symmetry properties with respect to one of these indefinite inner ...
Leiba Rodman
exaly +2 more sources
Microprocessing and Microprogramming, 1987
Abstract The inner Product Processor (IPP) is designed to increase the computing power of a Multiple Instruction stream Multiple Data stream (MIMD) supercomputer, the Delft Parallel Processor (DPP). At this moment a small MIMD supercomputer with 16 Processing Elements (PE's) has been realized.
Edward E. E. Frietman, F. Bruggeman
openaire +1 more source
Abstract The inner Product Processor (IPP) is designed to increase the computing power of a Multiple Instruction stream Multiple Data stream (MIMD) supercomputer, the Delft Parallel Processor (DPP). At this moment a small MIMD supercomputer with 16 Processing Elements (PE's) has been realized.
Edward E. E. Frietman, F. Bruggeman
openaire +1 more source
On spherical codes with inner products in a prescribed interval
Designs, Codes and Cryptography, 2018We develop a framework for obtaining linear programming bounds for spherical codes whose inner products belong to a prescribed subinterval [ℓ,s]\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage ...
P. Boyvalenkov +4 more
semanticscholar +1 more source
SIAM Journal on Mathematical Analysis, 1973
A fundamental inequality which provides lower bounds for real-valued inner products is stated and proved.
openaire +2 more sources
A fundamental inequality which provides lower bounds for real-valued inner products is stated and proved.
openaire +2 more sources
Optimal Compression of Approximate Inner Products and Dimension Reduction
IEEE Annual Symposium on Foundations of Computer Science, 2016Let X be a set of n points of norm at most 1 in the Euclidean space R^k, and suppose ≥0. An ≥-distance sketch for X is a data structure that, given any two points of X enables one to recover the square of the (Euclidean) distance between ...
N. Alon, B. Klartag
semanticscholar +1 more source