Results 201 to 210 of about 95,918 (238)
Some of the next articles are maybe not open access.
Proceedings of the 39th International Conference on Computer-Aided Design, 2020
Compute-in-memory (CIM) is a promising approach that exploits the analog computation inside the memory array to speed up the vector-matrix multiplication (VMM) for deep neural network (DNN) inference. SRAM has been demonstrated as a mature candidate for CIM architecture due to its availability in advanced technology node. However, as the weights of the
Shanshi Huang +4 more
openaire +1 more source
Compute-in-memory (CIM) is a promising approach that exploits the analog computation inside the memory array to speed up the vector-matrix multiplication (VMM) for deep neural network (DNN) inference. SRAM has been demonstrated as a mature candidate for CIM architecture due to its availability in advanced technology node. However, as the weights of the
Shanshi Huang +4 more
openaire +1 more source
ACM SIGCOMM Computer Communication Review, 2019
While placing the paper "XORs in the Air" in the context of the theoretical and practical understanding of network coding, we present a view of the progress of the field of network coding, In particular, we examine the interplay of theory and practice in the field.
Muriel Médard +5 more
openaire +1 more source
While placing the paper "XORs in the Air" in the context of the theoretical and practical understanding of network coding, we present a view of the progress of the field of network coding, In particular, we examine the interplay of theory and practice in the field.
Muriel Médard +5 more
openaire +1 more source
Journal of Experimental Psychology: Animal Behavior Processes, 2008
Three experiments examined the way in which exclusive-or (XOR) problems are solved by rats. All rats first received food-rewarded positive and negative patterning problems with two stimulus sets: either A+, B+, AB- and C-, D-, CD+, or A-, B-, AB + and C+, D +, and CD-.
C, Grand, R C, Honey
openaire +2 more sources
Three experiments examined the way in which exclusive-or (XOR) problems are solved by rats. All rats first received food-rewarded positive and negative patterning problems with two stimulus sets: either A+, B+, AB- and C-, D-, CD+, or A-, B-, AB + and C+, D +, and CD-.
C, Grand, R C, Honey
openaire +2 more sources
Combinatorica, 2007
What is the maximum possible number, f3(n), of vectors of length n over {0,1,2} such that the Hamming distance between every two is even? What is the maximum possible number, g3(n), of vectors in {0,1,2}n such that the Hamming distance between every two is odd?
Noga Alon, Eyal Lubetzky
openaire +1 more source
What is the maximum possible number, f3(n), of vectors of length n over {0,1,2} such that the Hamming distance between every two is even? What is the maximum possible number, g3(n), of vectors in {0,1,2}n such that the Hamming distance between every two is odd?
Noga Alon, Eyal Lubetzky
openaire +1 more source
The Indistinguishability of the XOR of $$k$$ Permutations
2015Given k independent pseudorandom permutations f(1), ... , f(k) over {0, 1}(n), it is natural to define a pseudorandom function by XORing the permutations f(1) circle plus... circle plus f(k). In [9] Stefan Lucks studied the security of this PRF. In this paper we improve the security bounds of [9] by using different proof techniques.
Benoit Cogliati +2 more
openaire +2 more sources
Efficient synthesis of AND/XOR networks
Proceedings of ASP-DAC '97: Asia and South Pacific Design Automation Conference, 2002A new graph-based synthesis method for general Exclusive Sum-of-Product forms (ESOP) is presented in this paper. Previous research has largely concentrated on a class of ESOP's, the Canonical Restricted Fixed/Mixed Polarity Reed-Muller form, also known as Generalized Reed-Muller (GRM) form. However, for many functions, the minimum GRM can be much worse
Yibin Ye, Kaushik Roy 0001
openaire +1 more source
IEEE Transactions on Computers, 2005
Bank conflicts can severely reduce the bandwidth of an interleaved multibank memory and conflict misses increase the miss rate of a cache or a predictor. Both occurrences are manifestations of the same problem: objects, which should be mapped to different indices, are accidentally mapped to the same index.
Hans Vandierendonck +1 more
openaire +1 more source
Bank conflicts can severely reduce the bandwidth of an interleaved multibank memory and conflict misses increase the miss rate of a cache or a predictor. Both occurrences are manifestations of the same problem: objects, which should be mapped to different indices, are accidentally mapped to the same index.
Hans Vandierendonck +1 more
openaire +1 more source
International Journal on Science and Technology
The XOR cipher is a simple symmetric encryption algorithm based on the (XOR) logical operation. It is broadly used in cryptography, data masking, and lightweight encryption applications due to its simplicity and efficiency. The XOR cipher operates by applying the XOR function between the plaintext and a key, ensuring that the encrypted output appears ...
Sinchana A - +4 more
openaire +1 more source
The XOR cipher is a simple symmetric encryption algorithm based on the (XOR) logical operation. It is broadly used in cryptography, data masking, and lightweight encryption applications due to its simplicity and efficiency. The XOR cipher operates by applying the XOR function between the plaintext and a key, ensuring that the encrypted output appears ...
Sinchana A - +4 more
openaire +1 more source
2007
We consider Independent Component Analysis (ICA) for the case of binary sources, where addition has the meaning of the boolean "Exclusive Or" (XOR) operation. Thus, each mixture-signal is given by the XOR of one or more of the source-signals. While such mixtures can be considered linear transformations over the finite Galois Field of order 2, they are ...
openaire +1 more source
We consider Independent Component Analysis (ICA) for the case of binary sources, where addition has the meaning of the boolean "Exclusive Or" (XOR) operation. Thus, each mixture-signal is given by the XOR of one or more of the source-signals. While such mixtures can be considered linear transformations over the finite Galois Field of order 2, they are ...
openaire +1 more source
Some Results on Extension of Lattice-Valued XOR, XOR-Implications and E-Implications
2016The extension problem is an important and interesting issue that be addressed for many different classes of operator. For instance, one can thing who to extend a fuzzy operator from a lattice to a bigger one preserving its algebraic properties. In this paper we attempt to the extension of lattice-valued version of Xor (exclusive) operator using a ...
Eduardo Silva Palmeira +1 more
openaire +1 more source