37 search results - page 7 / 8 » What is the furthest graph from a hereditary property |
ICALP
2004
Springer
13 years 11 months ago
2004
Springer
We study the random composition of a small family of O(n3 ) simple permutations on {0, 1}n . Specifically we ask what is the number of compositions needed to achieve a permutatio...
CRYPTO
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. The problem of perfectly secure message transmission concerns two synchronized non-faulty processors sender (S) and receiver (R) that are connected by a synchronous netwo...
CORR
2004
Springer
13 years 5 months ago
2004
Springer
We define the concept of dependence among multiple variables using maximum entropy techniques and introduce a graphical notation to denote the dependencies. Direct inference of in...
CLUSTER
2002
IEEE
13 years 10 months ago
2002
IEEE
Clusters have made the jump from lab prototypes to fullfledged production computing platforms. The number, variety, and specialized configurations of these machines are increasi...
STACS
1999
Springer
13 years 9 months ago
1999
Springer
Leo Harrington surprisingly constructed a machine which can learn any computable function f according to the following criterion (called Bc∗ -identification). His machine, on t...