29 search results - page 5 / 6 » On variants of the Johnson-Lindenstrauss lemma |
CORR
2006
Springer
13 years 5 months ago
2006
Springer
Abstract. Oblivious transfer (OT) is a primitive of paramount importance in cryptography or, more precisely, two- and multi-party computation due to its universality. Unfortunately...
CADE
2007
Springer
14 years 6 months ago
2007
Springer
We add labels to first-order clauses to simultaneously apply superpositions to several proof obligations inside one clause set. From a theoretical perspective, the approach unifies...
FOCS
1998
IEEE
13 years 10 months ago
1998
IEEE
We show that approximating the shortest vector problem (in any p norm) to within any constant factor less than p 2 is hard for NP under reverse unfaithful random reductions with i...
FOCS
2004
IEEE
13 years 9 months ago
2004
IEEE
In this work we give the first deterministic extractors from a constant number of weak sources whose entropy rate is less than 1/2. Specifically, for every > 0 we give an expl...
LREC
2008
13 years 7 months ago
2008
This paper deals with a multilingual relational lexical database of proper name, Prolexbase, a free resource available on the CNRTL website. The Prolex model is based on two main ...