2233 search results - page 79 / 447 » On the Complexity of Theory Curbing |
152
click to vote
ASIACRYPT
1991
Springer
15 years 9 months ago
1991
Springer
In [1] a construction of a block cipher from a single pseudorandom permutation is proposed. In a complexity theoretical setting they prove that this scheme is secure against a pol...
155
click to vote
ESANN
2006
15 years 7 months ago
2006
In this presentation we show the semi-supervised learning with two input sources can be transformed into a maximum margin problem to be similar to a binary SVM. Our formulation exp...
185
click to vote
ATAL
2009
Springer
16 years 26 days ago
2009
Springer
Coalition formation is a key topic in multi–agent systems (mas). Coalitions enable agents to achieve goals that they may not have been able to achieve independently, and encoura...
155
click to vote
PODC
2005
ACM
15 years 12 months ago
2005
ACM
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
188
click to vote
FOCS
2007
IEEE
16 years 18 days ago
2007
IEEE
d Abstract) Kousha Etessami LFCS, School of Informatics University of Edinburgh Mihalis Yannakakis Department of Computer Science Columbia University We reexamine what it means to...