Results 11  20
of
6,115
Parsing English with a Link Grammar
, 1991
"... We define a new formal grammatical system called a link grammar . A sequence of words is in the language of a link grammar if there is a way to draw links between words in such a way that (1) the local requirements of each word are satisfied, (2) the links do not cross, and (3) the words form a conn ..."
Abstract

Cited by 437 (4 self)
 Add to MetaCart
connected graph. We have encoded English grammar into such a system, and written a program (based on new algorithms) for efficiently parsing with a link grammar. The formalism is lexical and makes no explicit use of constituents and categories. The breadth of English phenomena that our system handles
Measurement and Analysis of Online Social Networks
 In Proceedings of the 5th ACM/USENIX Internet Measurement Conference (IMC’07
, 2007
"... Online social networking sites like Orkut, YouTube, and Flickr are among the most popular sites on the Internet. Users of these sites form a social network, which provides a powerful means of sharing, organizing, and finding content and contacts. The popularity of these sites provides an opportunity ..."
Abstract

Cited by 698 (14 self)
 Add to MetaCart
of multiple online social networks. We examine data gathered from four popular online social networks: Flickr, YouTube, LiveJournal, and Orkut. We crawled the publicly accessible user links on each site, obtaining a large portion of each social network’s graph. Our data set contains over 11.3 million users
Intrinsically linked graphs with knotted components
"... Abstract. We construct a graph G such that any embedding of G into R 3 contains a nonsplit link of two components, where at least one of the components is a nontrivial knot. Further, for any m < n we produce a graph H so that every embedding of H contains a nonsplit n component link, where at lea ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
Abstract. We construct a graph G such that any embedding of G into R 3 contains a nonsplit link of two components, where at least one of the components is a nontrivial knot. Further, for any m < n we produce a graph H so that every embedding of H contains a nonsplit n component link, where
The extremal function for 3linked graphs
 J. COMBINATORIAL THEORY, SER. B
, 2007
"... A graph is klinked if for every set of 2k distinct vertices {s1,..., sk, t1,..., tk} there exist disjoint paths P1,..., Pk such that the endpoints of Pi are si and ti. We prove every 6connected graph on n vertices with 5n − 14 edges is 3linked. This is optimal, in that there exist 6connected gra ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
A graph is klinked if for every set of 2k distinct vertices {s1,..., sk, t1,..., tk} there exist disjoint paths P1,..., Pk such that the endpoints of Pi are si and ti. We prove every 6connected graph on n vertices with 5n − 14 edges is 3linked. This is optimal, in that there exist 6connected
Two analogs of intrinsically linked graphs
, 2008
"... A graph G is intrinsically S 1linked if for every embedding of the vertices of G into S 1, vertices that form the endpoints of two disjoint edges in G form a nonsplit link in the embedding. We show that a graph is intrinsically S 1 −linked if and only if it is not outerplanar. A graph is outerfl ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
A graph G is intrinsically S 1linked if for every embedding of the vertices of G into S 1, vertices that form the endpoints of two disjoint edges in G form a nonsplit link in the embedding. We show that a graph is intrinsically S 1 −linked if and only if it is not outerplanar. A graph is outer
Consensus and cooperation in networked multiagent systems
 Proceedings of the IEEE
, 2007
"... Summary. This paper provides a theoretical framework for analysis of consensus algorithms for multiagent networked systems with an emphasis on the role of directed information flow, robustness to changes in network topology due to link/node failures, timedelays, and performance guarantees. An ove ..."
Abstract

Cited by 807 (4 self)
 Add to MetaCart
Summary. This paper provides a theoretical framework for analysis of consensus algorithms for multiagent networked systems with an emphasis on the role of directed information flow, robustness to changes in network topology due to link/node failures, timedelays, and performance guarantees
Intrinsically Linked Graphs in Projective Space
, 2008
"... We examine graphs that contain a nontrivial link in every embedding into real projective space, using a weaker notion of unlink than was used in [5]. We call such graphs intrinsically linked in RP 3. We fully characterize such graphs with connectivity 0,1 and 2. We also show that only one Petersen ..."
Abstract
 Add to MetaCart
We examine graphs that contain a nontrivial link in every embedding into real projective space, using a weaker notion of unlink than was used in [5]. We call such graphs intrinsically linked in RP 3. We fully characterize such graphs with connectivity 0,1 and 2. We also show that only one Petersen
ATG Intrinsically linked graphs and even linking number
, 2005
"... Abstract We study intrinsically linked graphs where we require that every embedding of the graph contains not just a nonsplit link, but a link that satisfies some additional property. Examples of properties we address in this paper are: a two component link with lk(A, L) = k2 r, k ̸ = 0, a nonspl ..."
Abstract
 Add to MetaCart
Abstract We study intrinsically linked graphs where we require that every embedding of the graph contains not just a nonsplit link, but a link that satisfies some additional property. Examples of properties we address in this paper are: a two component link with lk(A, L) = k2 r, k ̸ = 0, a non
Loopy belief propagation for approximate inference: An empirical study. In:
 Proceedings of Uncertainty in AI,
, 1999
"... Abstract Recently, researchers have demonstrated that "loopy belief propagation" the use of Pearl's polytree algorithm in a Bayesian network with loops can perform well in the context of errorcorrecting codes. The most dramatic instance of this is the near Shannonlimit performanc ..."
Abstract

Cited by 676 (15 self)
 Add to MetaCart
with loops (undirected cycles). The algorithm is an exact inference algorithm for singly connected networks the beliefs converge to the cor rect marginals in a number of iterations equal to the diameter of the graph.1 However, as Pearl noted, the same algorithm will not give the correct beliefs for mul
Results 11  20
of
6,115