Results 1  10
of
1,678
Accelerating AES with Vector Permute Instructions
 In Clavier and Gaj [8
"... Abstract. We demonstrate new techniques to speed up the Rijndael (AES) block cipher using vector permute instructions. Because these techniques avoid data and keydependent branches and memory references, they are immune to known timing attacks. This is the first constanttime software implementat ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
Abstract. We demonstrate new techniques to speed up the Rijndael (AES) block cipher using vector permute instructions. Because these techniques avoid data and keydependent branches and memory references, they are immune to known timing attacks. This is the first constanttime software
Automatically characterizing large scale program behavior
, 2002
"... Understanding program behavior is at the foundation of computer architecture and program optimization. Many programs have wildly different behavior on even the very largest of scales (over the complete execution of the program). This realization has ramifications for many architectural and compile ..."
Abstract

Cited by 778 (41 self)
 Add to MetaCart
of execution. Our goal is to develop automatic techniques that are capable of finding and exploiting the Large Scale Behavior of programs (behavior seen over billions of instructions). The first step towards this goal is the development of a hardware independent metric that can concisely summarize the behav
Similarity estimation techniques from rounding algorithms
 In Proc. of 34th STOC
, 2002
"... A locality sensitive hashing scheme is a distribution on a family F of hash functions operating on a collection of objects, such that for two objects x, y, Prh∈F[h(x) = h(y)] = sim(x,y), where sim(x,y) ∈ [0, 1] is some similarity function defined on the collection of objects. Such a scheme leads ..."
Abstract

Cited by 449 (6 self)
 Add to MetaCart
vectors, as well as a simple alternative to minwise independent permutations for estimating set similarity. 2. A collection of distributions on n points in a metric space, with distance between distributions measured by the Earth Mover Distance (EMD), (a popular distance measure in graphics and vision
A hardcore predicate for all oneway functions
 In Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing
, 1989
"... Abstract rity of f. In fact, for inputs (to f*) of practical size, the pieces effected by f are so small A central tool in constructing pseudorandom that f can be inverted (and the “hardcore” generators, secure encryption functions, and bit computed) by exhaustive search. in other areas are “hardc ..."
Abstract

Cited by 440 (5 self)
 Add to MetaCart
core ” predicates b In this paper we show that every oneof functions (permutations) f, discovered in way function, padded to the form f(p,z) = [Blum Micali $21. Such b ( 5) cannot be effi (P,9(X)), llPl / = 11z//, has bY itself a hardcore ciently guessed (substantially better than SO predicate of the same
From frequency to meaning : Vector space models of semantics
 Journal of Artificial Intelligence Research
, 2010
"... Computers understand very little of the meaning of human language. This profoundly limits our ability to give instructions to computers, the ability of computers to explain their actions to us, and the ability of computers to analyse and process text. Vector space models (VSMs) of semantics are begi ..."
Abstract

Cited by 347 (3 self)
 Add to MetaCart
Computers understand very little of the meaning of human language. This profoundly limits our ability to give instructions to computers, the ability of computers to explain their actions to us, and the ability of computers to analyse and process text. Vector space models (VSMs) of semantics
Generating SIMD Vectorized Permutations
"... Abstract. This paper introduces a method to generate efficient vectorized implementations of small stride permutations using only vector load and vector shuffle instructions. These permutations are crucial for highperformance numerical kernels including the fast Fourier transform. Our generator take ..."
Abstract

Cited by 8 (6 self)
 Add to MetaCart
Abstract. This paper introduces a method to generate efficient vectorized implementations of small stride permutations using only vector load and vector shuffle instructions. These permutations are crucial for highperformance numerical kernels including the fast Fourier transform. Our generator
Generating permutation instructions from a highlevel description
"... Finegrained data parallelism, from media extensions to full streaming or vector instruction sets, offer enormous performance potential, if they can be effectively used from the application level. One critical aspect of their design is the organization of the registers and the generality of operat ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
of operations that move data between registers. In this paper we focus on this datamovement problem and demonstrate that starting with a highlevel description of a dataparallel application, we can automatically map certain datamovements in the program onto a regular set of vector permutation instructions
Permutation Statistics of Indexed Permutations
, 1994
"... The definitions of descent, excedance, major index, inversion index and Denert's statistic for the elements of the symmetric group S d are generalized to indexed permutations, i.e. the elements of the group S n d := Z n o S d , where o is wreath product with respect to the usual action of S d ..."
Abstract

Cited by 51 (2 self)
 Add to MetaCart
The definitions of descent, excedance, major index, inversion index and Denert's statistic for the elements of the symmetric group S d are generalized to indexed permutations, i.e. the elements of the group S n d := Z n o S d , where o is wreath product with respect to the usual action
Bit permutation instructions for accelerating software cryptography
 Proceedings of the IEEE International Conference on ApplicationSpecific Systems, Architectures and Processors
, 2000
"... Permutation is widely used in cryptographic algorithms. However, it is not wellsupported in existing instruction sets. In this paper, two instructions, PPERM3R and GRP, are proposed for efficient software implementation of arbitrary permutations. The PPERM3R instruction can be used for dynamically ..."
Abstract

Cited by 52 (18 self)
 Add to MetaCart
Permutation is widely used in cryptographic algorithms. However, it is not wellsupported in existing instruction sets. In this paper, two instructions, PPERM3R and GRP, are proposed for efficient software implementation of arbitrary permutations. The PPERM3R instruction can be used for dynamically
The Convex Geometry of Linear Inverse Problems
, 2010
"... In applications throughout science and engineering one is often faced with the challenge of solving an illposed inverse problem, where the number of available measurements is smaller than the dimension of the model to be estimated. However in many practical situations of interest, models are constr ..."
Abstract

Cited by 189 (20 self)
 Add to MetaCart
. The class of simple models considered are those formed as the sum of a few atoms from some (possibly infinite) elementary atomic set; examples include wellstudied cases such as sparse vectors (e.g., signal processing, statistics) and lowrank matrices (e.g., control, statistics), as well as several others
Results 1  10
of
1,678