110 search results - page 14 / 22 » Patterson-Wiedemann construction revisited |
157
click to vote
ICML
2007
IEEE
16 years 6 months ago
2007
IEEE
We consider a setting for discriminative semisupervised learning where unlabeled data are used with a generative model to learn effective feature representations for discriminativ...
154
click to vote
STACS
2009
Springer
16 years 25 days ago
2009
Springer
We revisit the problem of generating a “hard” random lattice together with a basis of relatively short vectors. This problem has gained in importance lately due to new cryptogr...
155
click to vote
CONTEXT
2007
Springer
16 years 7 days ago
2007
Springer
Contextual Graphs are a context-based formalism used in various real-world applications. They allow a uniform representation of elements of reasoning and of contexts for describing...
175
click to vote
EUROCRYPT
2004
Springer
15 years 11 months ago
2004
Springer
We revisit the following open problem in information-theoretic cryptography: Does the communication complexity of unconditionally secure computation depend on the computational com...
147
click to vote
PODC
2003
ACM
15 years 11 months ago
2003
ACM
Routing topologies for distributed hashing in peer-to-peer networks are classified into two categories: deterministic and randomized. A general technique for constructing determi...