297 search results - page 13 / 60 » Every Sequence Is Decompressible from a Random One |
COCO
2003
Springer
15 years 5 months ago
2003
Springer
We study the complexity of building pseudorandom generators (PRGs) with logarithmic seed length from hard functions. We show that, starting from a function f : {0, 1}l → {0, 1} ...
99
Voted
ICGA
2006
15 years 14 days ago
2006
The element of luck permeates every aspect of the game of poker. Random stochastic outcomes introduce a large amount of noise that can make it very difficult to distinguish a good...
108
Voted
JCT
2007
15 years 11 days ago
2007
Abstract. Simple families of increasing trees can be constructed from simply generated tree families, if one considers for every tree of size n all its increasing labellings, i.e.,...
SODA
2010
ACM
15 years 10 months ago
2010
ACM
A Random Geometric Graph (RGG) in two dimensions is constructed by distributing n nodes independently and uniformly at random in [0, n ]2 and creating edges between every pair of...
115
Voted
BIBE
2005
IEEE
15 years 6 months ago
2005
IEEE
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...