128 search results - page 17 / 26 » Weak Verifiable Random Functions |
SIGECOM
2008
ACM
13 years 8 months ago
2008
ACM
We study the question of how to easily recognize whether a social unction f from an abstract type space to a set of outcomes is truthful, i.e. implementable by a truthful mechanis...
CDC
2009
IEEE
14 years 1 months ago
2009
IEEE
— In this paper, we investigate synchronization in a small-world network of coupled nonlinear oscillators. This network is constructed by introducing random shortcuts in a neares...
AUTOMATICA
2006
13 years 8 months ago
2006
In this paper a novel, Gibbs sampler-based algorithm is proposed for coordination of autonomous swarms. The swarm is modeled as a Markov random field (MRF) on a graph with a time-...
IPL
2006
13 years 8 months ago
2006
The strongest well-known measure for the quality of a universal hash-function family H is its being -strongly universal, which measures, for randomly chosen h H, one's inabi...
TAP
2010
Springer
13 years 6 months ago
2010
Springer
Program verification systems based on automated theorem provers rely on user-provided axioms in order to verify domain-specific properties of code. However, formulating axioms corr...