Results 1  10
of
689,430
Applications of the Regularity Lemma for UNIFORM HYPERGRAPHS
, 2004
"... In this note we discuss several combinatorial problems that can be addressed by the Regularity Method for hypergraphs. Based on recent results of Nagle, Schacht and the authors, we give here solutions to these problems. In particular, we prove the following: Let K (k) t be the complete kuniform h ..."
Abstract

Cited by 45 (5 self)
 Add to MetaCart
In this note we discuss several combinatorial problems that can be addressed by the Regularity Method for hypergraphs. Based on recent results of Nagle, Schacht and the authors, we give here solutions to these problems. In particular, we prove the following: Let K (k) t be the complete kuniform
The counting lemma for regular kuniform hypergraphs
, 2004
"... Szemerédi’s Regularity Lemma proved to be a powerful tool in the area of extremal graph theory. Many of its applications are based on its accompanying Counting Lemma: If G is an ℓpartite graph with V (G) = V1 ∪ · · · ∪ Vℓ and Vi  = n for all i ∈ [ℓ], and all pairs (Vi, Vj) are εregular of ..."
Abstract

Cited by 108 (14 self)
 Add to MetaCart
Szemerédi’s Regularity Lemma proved to be a powerful tool in the area of extremal graph theory. Many of its applications are based on its accompanying Counting Lemma: If G is an ℓpartite graph with V (G) = V1 ∪ · · · ∪ Vℓ and Vi  = n for all i ∈ [ℓ], and all pairs (Vi, Vj) are εregular
An Algorithmic Regularity Lemma For Hypergraphs
 SIAM J. COMPUT
, 2000
"... In this paper, we will consider the problem of designing an efficient algorithm that finds an regular partition of an luniform hypergraph. ..."
Abstract

Cited by 19 (5 self)
 Add to MetaCart
In this paper, we will consider the problem of designing an efficient algorithm that finds an regular partition of an luniform hypergraph.
AN ALGORITHMIC HYPERGRAPH REGULARITY LEMMA
"... Abstract. Szemerédi’s Regularity Lemma is a powerful tools in graph theory. It asserts that all large graphs admit bounded partitions of their edge sets, most classes of which consist of uniformly distributed edges. The original proof of this result was nonconstructive and a constructive proof was ..."
Abstract
 Add to MetaCart
was later given by Alon, Duke, Lefmann, Rödl and Yuster. Szemerédi’s Regularity Lemma was extended to hypergraphs by various authors. Frankl and Rödl gave one such extension in the case of 3uniform hypergraphs, which was later extended to kuniform hypergraphs by Rödl and Skokan. W.T. Gowers gave
Regular partitions of hypergraphs: Regularity Lemmas
 COMBIN. PROBAB. COMPUT
, 2007
"... Szemerédi’s regularity lemma for graphs has proved to be a powerful tool with many subsequent applications. The objective of this paper is to extend the techniques developed by Nagle, Skokan, and authors and obtain a stronger and more “user friendly” regularity lemma for hypergraphs. ..."
Abstract

Cited by 29 (1 self)
 Add to MetaCart
Szemerédi’s regularity lemma for graphs has proved to be a powerful tool with many subsequent applications. The objective of this paper is to extend the techniques developed by Nagle, Skokan, and authors and obtain a stronger and more “user friendly” regularity lemma for hypergraphs.
Regularity lemma for kuniform hypergraphs, Random Structures and Algorithms
, 2004
"... Abstract. Szemerédi’s Regularity Lemma proved to be a very powerful tool in extremal graph theory with a large number of applications. Chung [Regularity lemmas for hypergraphs and quasirandomness, Random ..."
Abstract

Cited by 92 (7 self)
 Add to MetaCart
Abstract. Szemerédi’s Regularity Lemma proved to be a very powerful tool in extremal graph theory with a large number of applications. Chung [Regularity lemmas for hypergraphs and quasirandomness, Random
Understanding Normal and Impaired Word Reading: Computational Principles in QuasiRegular Domains
 PSYCHOLOGICAL REVIEW
, 1996
"... We develop a connectionist approach to processing in quasiregular domains, as exemplified by English word reading. A consideration of the shortcomings of a previous implementation (Seidenberg & McClelland, 1989, Psych. Rev.) in reading nonwords leads to the development of orthographic and phono ..."
Abstract

Cited by 583 (94 self)
 Add to MetaCart
We develop a connectionist approach to processing in quasiregular domains, as exemplified by English word reading. A consideration of the shortcomings of a previous implementation (Seidenberg & McClelland, 1989, Psych. Rev.) in reading nonwords leads to the development of orthographic
Regular partitions of hypergraphs: Counting Lemmas
 COMBIN. PROBAB. COMPUT
"... We continue the study of regular partitions of hypergraphs. In particular we obtain corresponding counting lemmas for the regularity lemmas for hypergraphs from [Regular partitions of hypergraphs: Regularity Lemmas, Combin. Probab. Comput., to appear]. ..."
Abstract

Cited by 16 (3 self)
 Add to MetaCart
We continue the study of regular partitions of hypergraphs. In particular we obtain corresponding counting lemmas for the regularity lemmas for hypergraphs from [Regular partitions of hypergraphs: Regularity Lemmas, Combin. Probab. Comput., to appear].
Scalable Application Layer Multicast
, 2002
"... We describe a new scalable applicationlayer multicast protocol, specifically designed for lowbandwidth, data streaming applications with large receiver sets. Our scheme is based upon a hierarchical clustering of the applicationlayer multicast peers and can support a number of different data deliv ..."
Abstract

Cited by 719 (21 self)
 Add to MetaCart
We describe a new scalable applicationlayer multicast protocol, specifically designed for lowbandwidth, data streaming applications with large receiver sets. Our scheme is based upon a hierarchical clustering of the applicationlayer multicast peers and can support a number of different data
Exact Sampling with Coupled Markov Chains and Applications to Statistical Mechanics
, 1996
"... For many applications it is useful to sample from a finite set of objects in accordance with some particular distribution. One approach is to run an ergodic (i.e., irreducible aperiodic) Markov chain whose stationary distribution is the desired distribution on this set; after the Markov chain has ..."
Abstract

Cited by 548 (13 self)
 Add to MetaCart
For many applications it is useful to sample from a finite set of objects in accordance with some particular distribution. One approach is to run an ergodic (i.e., irreducible aperiodic) Markov chain whose stationary distribution is the desired distribution on this set; after the Markov chain
Results 1  10
of
689,430