Sciweavers

1578 search results - page 18 / 316
» Algorithmic randomness of continuous functions
Sort
View
98
Voted
EUROCRYPT
2010
Springer
15 years 27 days ago
Constructing Verifiable Random Functions with Large Input Spaces
We present a family of verifiable random functions which are provably secure for exponentially-large input spaces under a non-interactive complexity assumption. Prior construction...
Susan Hohenberger, Brent Waters
CDC
2009
IEEE
111views Control Systems» more  CDC 2009»
15 years 2 months ago
An optimal investment problem with randomly terminating income
Abstract— We investigate an optimal consumption and investment problem where we receive a certain fixed income stream that is terminated at a random time. It turns out that the ...
Michel H. Vellekoop, Mark Davis
PODS
2012
ACM
276views Database» more  PODS 2012»
13 years 2 days ago
Randomized algorithms for tracking distributed count, frequencies, and ranks
We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k...
Zengfeng Huang, Ke Yi, Qin Zhang
RSA
2002
99views more  RSA 2002»
14 years 9 months ago
Distributed algorithms with dynamical random transitions
Given any measure-preserving dynamical system (Y, A , , T) and g Lp() , we study convergence of the sequence 1 n n k=1 g TSk , n 1 where Sk is a dynamic Zr -valued random w...
Nadine Guillotin-Plantard, René Schott
AUTOMATICA
2008
115views more  AUTOMATICA 2008»
14 years 9 months ago
Distributed algorithms for reaching consensus on general functions
This paper presents analysis and design results for distributed consensus algorithms in multi-agent networks. We consider continuous consensus functions of the initial state of th...
Jorge Cortés