11 citations · 28 across the 5 of their papers we have counts for
Showing 2008Show all
2 papers · 1 filter
cs.LG2008★ 11 cited
Learning Low-Density Separators
Shai Ben-David, Tyler Lu, David Pal +1
We define a novel, basic, unsupervised learning problem - learning the lowest density homogeneous hyperplane separator of an unknown probability distribution. This task is relevant…
cs.CC2008
Breaking One-Round Key-Agreement Protocols in the Random Oracle Model
Miroslava Sotakova
In this paper we study one-round key-agreement protocols analogous to Merkle's puzzles in the random oracle model. The players Alice and Bob are allowed to query a random permutati…