Results 261 to 270 of about 2,086,846 (295)
Some of the next articles are maybe not open access.
Non-Local Neural Networks With Grouped Bilinear Attentional Transforms
Computer Vision and Pattern Recognition, 2020Modeling spatial or temporal long-range dependency plays a key role in deep neural networks. Conventional dominant solutions include recurrent operations on sequential data or deeply stacking convolutional layers with small kernel size.
semanticscholar +1 more source
On surjective bilinear mappings
Journal of Soviet Mathematics, 1992See the review in Zbl 0742.15014.
openaire +1 more source
Canonical Realization of Bilinear Input/Output Maps
SIAM Journal on Control and Optimization, 1979The idea of extending the comprehensive theory of state space realization for linear systems to certain classes of nonlinear systems has been the subject of much recent research in mathematical system theory. One such class are those systems with a bilinear input/output map, first considered by Kalman [Pattern recognition properties of multi-linear ...
Pearlman, J. G., Denham, M. J.
openaire +1 more source
Cocharacters of Bilinear Mappings and Graded Matrices
Algebras and Representation Theory, 2012Let \(M_k(F)\) be the algebra of \(k\times k\) matrices over a field \(F\) of characteristic zero. Let \(G\) be any group, consider \(M_k(F)\) with the elementary grading induced by the \(k\)-tuple \((1,\ldots,1,g)\), where \(g\in G\), \(g^2\neq 1\). Then the graded identities of \(M_k(F)\) depending only on variables of homogeneous degrees \(g\) and \(
Aquè, Stefania, Giambruno, Antonio
openaire +1 more source
Towards Ideal Self-bilinear Map
Proceedings of the 5th ACM on ASIA Public-Key Cryptography Workshop, 2018Bilinear maps (also called pairings) have been used for constructing various kinds of cryptographic primitives including (but not limited to) short signatures, identity-based encryption, attribute-based encryption, and non-interactive zero-knowledge proof systems.
openaire +1 more source
Arithmetic Garbling from Bilinear Maps
2019We consider the problem of garbling arithmetic circuits and present a garbling scheme for inner-product predicates over exponentially large fields. Our construction stems from a generic transformation from predicate encryption which makes only blackbox calls to the underlying primitive.
Fleischhacker N. +2 more
openaire +2 more sources
Definable invariants of bilinear mappings
Siberian Mathematical Journal, 1990Elementary theories of bilinear mappings are studied. The interest in these questions is explained by the fact that different model-theoretic problems of algebra reduce largely to the corresponding problems for bilinear mappings. Bilinear mappings in rings arise most naturally --- the multiplication operation itself generates them.
openaire +1 more source
Characterizations of compact bilinear maps
Linear and Multilinear Algebra, 1989A factorization theorem for compact bilinear operators was given (Theorem 2.7) by Ramanujan and Schock in [5]. Their proof is not complete, and in fact the truth of the theorem as stated may be in doubt. In this paper, a similar theorem is stated and proved.
openaire +1 more source
The bidual of a Banach algebra associated with a bilinear map
Bollettino dell'Unione Matematica Italiana, 2019S. Barootkoob +2 more
semanticscholar +1 more source
Attribute-Based Signatures for Circuits from Bilinear Map
International Conference on Theory and Practice of Public Key Cryptography, 2016Yusuke Sakai +2 more
semanticscholar +1 more source