Results 1  10
of
67
A Note on Scrambling Permutations
, 2001
"... A family F of permutations of [n] is completely kscrambling [7] if for every sequence hp 1 ; p 2 ; : : : ; p k i of k distinct elements of [n], there is a permutation 2 F with (p 1 ) < (p 2 ) < < (p k ): We show that the size of the smallest completely kscrambling family of permutat ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
A family F of permutations of [n] is completely kscrambling [7] if for every sequence hp 1 ; p 2 ; : : : ; p k i of k distinct elements of [n], there is a permutation 2 F with (p 1 ) < (p 2 ) < < (p k ): We show that the size of the smallest completely kscrambling family
Entropy and Counting
, 2001
"... We illustrate the role of information theoretic ideas in combinatorial problems, some of them arising in computer science. We also consider the problem of covering graphs using other graphs, and show how information theoretic ideas are applied to this setting. Our treatment of graph covering problem ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
problems naturally motivates two (already known) definitions of Körner’s graph entropy.
Public Key Cryptography from Different Assumptions
, 2008
"... We construct a new public key encryption based on two assumptions: 1. One can obtain a pseudorandom generator with small locality by connecting the outputs to the inputs using any sufficiently good unbalanced expander. 2. It is hard to distinguish between a random graph that is such an expander and ..."
Abstract

Cited by 22 (4 self)
 Add to MetaCart
We construct a new public key encryption based on two assumptions: 1. One can obtain a pseudorandom generator with small locality by connecting the outputs to the inputs using any sufficiently good unbalanced expander. 2. It is hard to distinguish between a random graph that is such an expander and a random graph where a (planted) random logarithmicsized subset S of the outputs is connected to fewer than S  inputs. The validity and strength of the assumptions raise interesting new algorithmic and pseudorandomness questions, and we explore their relation to the current stateofart. 1
The Geometry of Constrained Structured Prediction: Applications to Inference and Learning of Natural Language Syntax
, 2012
"... ..."
Hashing, Randomness and Dictionaries
, 2002
"... This thesis is centered around one of the most basic information retrieval problems, namely that of storing and accessing the elements of a set. Each element in the set has some associated information that is returned along with it. The problem is referred to as the dictionary problem, due to the si ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
This thesis is centered around one of the most basic information retrieval problems, namely that of storing and accessing the elements of a set. Each element in the set has some associated information that is returned along with it. The problem is referred to as the dictionary problem, due to the similarity to a bookshelf dictionary, which contains a set of words and has an explanation associated with each word. In the static version of the problem the set is fixed, whereas in the dynamic version, insertions and deletions of elements are possible. The approach
c○2007 The Association for Computational Linguistics Order copies of this and other ACL proceedings from:
, 2007
"... Rochester in New York. It was organized in response to growing interest in statistical, tree structured models of relations between natural languages. Our hope was to bring together researchers working on ..."
Abstract
 Add to MetaCart
Rochester in New York. It was organized in response to growing interest in statistical, tree structured models of relations between natural languages. Our hope was to bring together researchers working on
Results 1  10
of
67