Sciweavers

8825 search results - page 31 / 1765
» All for one or one for all
Sort
View
ECCC
2000
113views more  ECCC 2000»
13 years 7 months ago
Candidate One-Way Functions Based on Expander Graphs
Abstract. We suggest a candidate one-way function using combinatorial constructs such as expander graphs. These graphs are used to determine a sequence of small overlapping subsets...
Oded Goldreich
PC
2000
93views Management» more  PC 2000»
13 years 7 months ago
Scheduling outtrees of height one in the LogP model
The LogP model is a model of parallel computation that characterises a parallel computer system by four parameters: the latency L, the overhead o, the gap g and the number of proc...
Jacques Verriet
ACL
2010
13 years 5 months ago
Training Phrase Translation Models with Leaving-One-Out
Several attempts have been made to learn phrase translation probabilities for phrasebased statistical machine translation that go beyond pure counting of phrases in word-aligned t...
Joern Wuebker, Arne Mauser, Hermann Ney
KDD
2012
ACM
181views Data Mining» more  KDD 2012»
11 years 10 months ago
On "one of the few" objects
Objects with multiple numeric attributes can be compared within any “subspace” (subset of attributes). In applications such as computational journalism, users are interested i...
You Wu, Pankaj K. Agarwal, Chengkai Li, Jun Yang 0...
CRYPTO
2008
Springer
98views Cryptology» more  CRYPTO 2008»
13 years 9 months ago
One-Time Programs
Abstract. In this work, we introduce one-time programs, a new computational paradigm geared towards security applications. A one-time program can be executed on a single input, who...
Shafi Goldwasser, Yael Tauman Kalai, Guy N. Rothbl...