Results 1  10
of
3,697
Design of capacityapproaching irregular lowdensity paritycheck codes
 IEEE TRANS. INFORM. THEORY
, 2001
"... We design lowdensity paritycheck (LDPC) codes that perform at rates extremely close to the Shannon capacity. The codes are built from highly irregular bipartite graphs with carefully chosen degree patterns on both sides. Our theoretical analysis of the codes is based on [1]. Assuming that the unde ..."
Abstract

Cited by 588 (6 self)
 Add to MetaCart
to infinity. Furthermore, we prove a stability condition which implies an upper bound on the fraction of errors that a beliefpropagation decoder can correct when applied to a code induced from a bipartite graph with a given degree distribution. Our codes are found by optimizing the degree structure
Search and replication in unstructured peertopeer networks
, 2002
"... Abstract Decentralized and unstructured peertopeer networks such as Gnutella are attractive for certain applicationsbecause they require no centralized directories and no precise control over network topologies and data placement. However, the floodingbased query algorithm used in Gnutella does n ..."
Abstract

Cited by 692 (6 self)
 Add to MetaCart
not scale; each individual query generates a large amount of traffic and, as it grows, the system quickly becomes overwhelmed with the queryinduced load. This paper explores, through simulation, various alternatives to gnutella's query algorithm, data replicationmethod, and network topology. We
Induced graph Ramsey theory
 Ars Combin
, 2003
"... We say that a graph F strongly arrows (G, H) and write F (G, H) if for every edgecoloring of F with colors red and blue a red G or a blue H occurs as an induced subgraph of F. Induced Ramsey numbers are defined by r ∗ (G, H) = min{V (F)  : F (G, H)}. The value of r ∗ (G, H) is finite for all gra ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
We say that a graph F strongly arrows (G, H) and write F (G, H) if for every edgecoloring of F with colors red and blue a red G or a blue H occurs as an induced subgraph of F. Induced Ramsey numbers are defined by r ∗ (G, H) = min{V (F)  : F (G, H)}. The value of r ∗ (G, H) is finite for all
The strong perfect graph theorem
 ANNALS OF MATHEMATICS
, 2006
"... A graph G is perfect if for every induced subgraph H, the chromatic number of H equals the size of the largest complete subgraph of H, and G is Berge if no induced subgraph of G is an odd cycle of length at least five or the complement of one. The “strong perfect graph conjecture” (Berge, 1961) asse ..."
Abstract

Cited by 285 (23 self)
 Add to MetaCart
A graph G is perfect if for every induced subgraph H, the chromatic number of H equals the size of the largest complete subgraph of H, and G is Berge if no induced subgraph of G is an odd cycle of length at least five or the complement of one. The “strong perfect graph conjecture” (Berge, 1961
Large margin dags for multiclass classification
 Advances in Neural Information Processing Systems 12
, 2000
"... We present a new learning architecture: the Decision Directed Acyclic Graph (DDAG), which is used to combine many twoclass classifiers into a multiclass classifier. For anclass problem, the DDAG contains � classifiers, one for each pair of classes. We present a VC analysis of the case when the nod ..."
Abstract

Cited by 374 (1 self)
 Add to MetaCart
We present a new learning architecture: the Decision Directed Acyclic Graph (DDAG), which is used to combine many twoclass classifiers into a multiclass classifier. For anclass problem, the DDAG contains � classifiers, one for each pair of classes. We present a VC analysis of the case when
Approximation Algorithms for Connected Dominating Sets
 Algorithmica
, 1996
"... The dominating set problem in graphs asks for a minimum size subset of vertices with the following property: each vertex is required to either be in the dominating set, or adjacent to some node in the dominating set. We focus on the question of finding a connected dominating set of minimum size, whe ..."
Abstract

Cited by 366 (9 self)
 Add to MetaCart
, where the graph induced by vertices in the dominating set is required to be connected as well. This problem arises in network testing, as well as in wireless communication. Two polynomial time algorithms that achieve approximation factors of O(H (\Delta)) are presented, where \Delta is the maximum
Complexity and kernels for bipartition into degreebounded induced graphs
"... Abstract. In this paper, we study the parameterized complexity of the problems of partitioning the vertex set of a graph into two parts VA and VB such that VA induces a graph with degree at most a (resp., an aregular graph) and VB induces a graph with degree at most b (resp., a bregular graph). T ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. In this paper, we study the parameterized complexity of the problems of partitioning the vertex set of a graph into two parts VA and VB such that VA induces a graph with degree at most a (resp., an aregular graph) and VB induces a graph with degree at most b (resp., a bregular graph
Vertex Coverings by Coloured Induced Graphs  Frames and Umbrellas
"... A graph G homogeneously embeds in a graph H if for every vertex x of G and every vertex y of H there is an induced copy of G in H with x at y. The graph G uniformly embeds in H if for every vertex y of H there is an induced copy of G in H containing y. For positive integer k, let fk(G) (respectively ..."
Abstract
 Add to MetaCart
A graph G homogeneously embeds in a graph H if for every vertex x of G and every vertex y of H there is an induced copy of G in H with x at y. The graph G uniformly embeds in H if for every vertex y of H there is an induced copy of G in H containing y. For positive integer k, let fk
A HammersleyClifford Thorem for Induced Graph Semantics
"... The HammersleyClifford Theorem provides a key link which makes graphical models a useful way to represent certain assumptions employed in statistical models. The theorem links the absence of edges in an undirected graph to a Markov assumption about the involved random variables, which are taken to ..."
Abstract
 Add to MetaCart
the possibility of generating distributions with powerlaw behavior and distributions with finite support. We achieve the generalization by introducing a variation on the Markov property, thereby inducing a new meaning for the edge of a graph. Although the graph is always fully connected in the original semantics
Mining large query induced graphs towards a hierarchical query folksonomy
 String Processing and Information Retrieval, Lecture Notes in Computer Science
, 2010
"... Abstract. The human interaction through the web generates both implicit and explicit knowledge. An example of an implicit contribution is searching, as people contribute with their knowledge by clicking on retrieved documents. Thus, an important and interesting challenge is to extract semantic rel ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
relations among queries and their terms from query logs. In this paper we present and discuss results on mining large query log induced graphs, and how they contribute to query classification and to understand user intent and interest. Our approach consists on efficiently obtaining a hierarchical
Results 1  10
of
3,697