3928 search results - page 23 / 786 » order 2006 |
RSA
2010
13 years 8 months ago
2010
We establish central and local limit theorems for the number of vertices in the largest component of a random d-uniform hypergraph Hd(n, p) with edge probability p = c/ n−1 d−1...
RSA
2008
13 years 9 months ago
2008
For the only known universal best choice algorithm for partially ordered sets with known cardinality and unknown order (proposed by J. Preater) we improve the estimation of the lo...
MJ
2006
13 years 9 months ago
2006
Surface relief formed by nanoimprinting and etching into a thermally grown SiO2 layer on Si was used to position the initial nuclei formed by chemically vapor deposited Si and Ge....
ACST
2006
13 years 11 months ago
2006
Consider the problem of membership query for a given partially ordered set. We devise a greedy algorithm which can produce near-optimal search strategies. Rigorous analysis has be...
ORDER
2010
13 years 8 months ago
2010
Embedding a partially ordered set into a product of chains is a classical way to encode it. Such encodings have been used in various fields such as object oriented programming or ...