1631 search results - page 108 / 327 » Uniform Distributed Synthesis |
ECAI
2004
Springer
15 years 7 months ago
2004
Springer
We present algorithms for the generation of uniformly distributed Bayesian networks with constraints on induced width. The algorithms use ergodic Markov chains to generate samples....
97
Voted
ICALP
1999
Springer
15 years 6 months ago
1999
Springer
We demonstrate an ⍀( pn1ϩ1/p) lower bound on the average-case running time (uniform distribution) of p-pass Shellsort. This is the first nontrivial general lower bound for avera...
112
click to vote
CORR
2008
Springer
15 years 2 months ago
2008
Springer
We prove existence and uniqueness of the minimizer for the average geodesic distance to the points of a geodesically convex set on the sphere. This implies a corresponding existen...
ECCC
2010
15 years 2 months ago
2010
We investigate the complexity of the following computational problem: Polynomial Entropy Approximation (PEA): Given a low-degree polynomial mapping p : Fn Fm , where F is a finite...
112
click to vote
COMBINATORICS
2007
15 years 2 months ago
2007
New cyclic n-digit Gray codes are constructed over {0, 1, . . . , R−1} for all R ≥ 3, n ≥ 2. These codes have the property that the distribution of the digit changes (transi...