2168 search results - page 20 / 434 » Randomized Algorithms and Complexity Theory |
RSA
2002
14 years 11 months ago
2002
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...
SIGMOD
2010
ACM
15 years 4 months ago
2010
ACM
Uncertain data streams, where data is incomplete, imprecise, and even misleading, have been observed in many environments. Feeding such data streams to existing stream systems pro...
102
click to vote
COCO
2003
Springer
15 years 4 months ago
2003
Springer
We give machine characterisations and logical descriptions of a number of parameterized complexity classes. The focus of our attention is the class W[P], which we characterise as ...
STOC
2002
ACM
15 years 12 months ago
2002
ACM
Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...
ECCC
2010
14 years 9 months ago
2010
The existence of a (p-)optimal propositional proof system is a major open question in (proof) complexity; many people conjecture that such systems do not exist. Kraj