1363 search results - page 91 / 273 » Distributed Authorization with Distributed Grammars |
143
Voted
CPC
1999
15 years 3 months ago
1999
Total path length, or search cost, for a rooted tree is defined as the sum of all root-to-node distances. Let Tn be the total path length for a random recursive tree of order n. M...
144
Voted
CRYPTO
2012
Springer
13 years 5 months ago
2012
Springer
We describe a working implementation of leveled homomorphic encryption (without bootstrapping) that can evaluate the AES-128 circuit in three different ways. One variant takes und...
136
click to vote
EUROCRYPT
2012
Springer
13 years 5 months ago
2012
Springer
We show that homomorphic evaluation of (wide enough) arithmetic circuits can be accomplished with only polylogarithmic overhead. Namely, we present a construction of fully homomorp...
125
click to vote
SPAA
2010
ACM
15 years 8 months ago
2010
ACM
The aim of rendezvous in a graph is meeting of two mobile agents at some node of an unknown anonymous connected graph. The two identical agents start from arbitrary nodes in the g...
129
Voted
ATAL
2008
Springer
15 years 5 months ago
2008
Springer
Multi-agent systems benefit greatly from an organization design that guides agents in determining when to communicate, how often, with whom, with what priority, and so on. However...