4 search results - page 1 / 1 » Hypergraphs, Quasi-randomness, and Conditions for Regularity |
JCT
2002
13 years 5 months ago
2002
Haviland and Thomason and Chung and Graham were the first to investigate systematically some properties of quasi-random hypergraphs. In particular, in a series of articles, Chung a...
EJC
2006
13 years 6 months ago
2006
The small subgraph conditioning method first appeared when Robinson and the second author showed the almost sure hamiltonicity of random d-regular graphs. Since then it has been u...
KDD
2008
ACM
14 years 6 months ago
2008
ACM
A hypergraph is a generalization of the traditional graph in which the edges are arbitrary non-empty subsets of the vertex set. It has been applied successfully to capture highord...
ICML
2009
IEEE
14 years 6 months ago
2009
IEEE
Many machine learning algorithms can be formulated as a generalized eigenvalue problem. One major limitation of such formulation is that the generalized eigenvalue problem is comp...