132 search results - page 6 / 27 » Graph limits and hereditary properties |
STOC
2010
ACM
14 years 1 months ago
2010
ACM
We establish the existence of free energy limits for several sparse random hypergraph models corresponding to certain combinatorial models on Erd¨os-R´enyi graph G(N, c/N) and r...
JAL
1998
13 years 9 months ago
1998
We describe a very general technique for generating families of combinatorial objects without isomorphs. It applies to almost any class of objects for which an inductive construct...
IFIP
2005
Springer
14 years 3 months ago
2005
Springer
A new quasi-Newton scheme for updating a low rank positive semi-definite Hessian approximation is described, primarily for use in sequential quadratic programming methods for non...
RSA
2010
13 years 8 months ago
2010
A random graph order, also known as a transitive percolation process, is defined by taking a random graph on the vertex set {0, . . . , n − 1}, and putting i below j if there i...
INFOCOM
2009
IEEE
2009
IEEE
Understanding the Performance Gap Between Pull-Based Mesh Streaming Protocols and Fundamental Limits
14 years 4 months ago
—Pull-based mesh streaming protocols have recently received much research attention, with successful commercial systems showing their viability in the Internet. Despite the remar...