2623 search results - page 255 / 525 » Universal Learning Theory |
199
click to vote
CRYPTO
2010
Springer
15 years 7 months ago
2010
Springer
Multiparty computation protocols have been known for more than twenty years now, but due to their lack of efficiency their use is still limited in real-world applications: the goal...
156
click to vote
ICFP
2010
ACM
15 years 7 months ago
2010
ACM
We present a closed dependent type theory whose inductive types are given not by a scheme for generative declarations, but by encoding in a universe. Each inductive datatype arise...
196
click to vote
PODC
2010
ACM
15 years 6 months ago
2010
ACM
We present information-theoretically secure schemes for sharing and modifying secrets among a dynamic swarm of computing devices. The schemes support an unlimited number of change...
184
click to vote
ALGORITHMICA
2006
15 years 6 months ago
2006
We show that the number of t-ary trees with path length equal to p is t h(t-1) tp log2 p(1+o(1)) , where h(x)=-x log2 x-(1-x) log2(1-x) is the binary entropy function. Besides its...
116
click to vote
JNS
2008
15 years 6 months ago
2008
We describe a basic framework for studying dynamic scaling that has roots in dynamical systems and probability theory. Within this framework, we study Smoluchowski's coagulat...