Find link

language:

Find link is a tool written by Edward Betts.

searching for Term graph 19 found (21 total)

alternate case: term graph

Abstract semantic graph (872 words) [view diff] exact match in snippet view article find links to article

In computer science, an abstract semantic graph (ASG) or term graph is a form of abstract syntax in which an expression of a formal or programming language

Graph kernel (624 words) [view diff] exact match in snippet view article find links to article

Haussler introduced convolutional kernels on discrete structures. The term graph kernels was more officially coined in 2002 by R. I. Kondor and J. Lafferty

Graph cuts in computer vision (2,097 words) [view diff] no match in snippet view article find links to article

vision algorithms involve cutting a graph (e.g., normalized cuts), the term "graph cuts" is applied specifically to those models which employ a max-flow/min-cut

Null graph (516 words) [view diff] exact match in snippet view article find links to article

need for such exceptions, it is often assumed in literature that the term graph implies "graph with at least one vertex" unless context suggests otherwise

Graph paper (973 words) [view diff] no match in snippet view article find links to article

'millimeter' paper) is practically worthless in the hands of beginners." The term "graph paper" did not catch on quickly in American usage. A School Arithmetic

Abstract syntax tree (1,203 words) [view diff] exact match in snippet view article find links to article

perform code clone detection. Abstract semantic graph (ASG), also called term graph Composite pattern Control-flow graph Directed acyclic graph (DAG) Document

Multigraph (1,028 words) [view diff] exact match in snippet view article find links to article

right identity for composition. For this reason, in category theory the term graph is standardly taken to mean "multidigraph", and the underlying multidigraph

Curry (programming language) (1,650 words) [view diff] exact match in snippet view article

of as reduction on a program term graph, and there are often many different ways (strategies) to reduce a given term graph. Antoy et al. proved in the

Graph property (1,182 words) [view diff] no match in snippet view article find links to article

of a specific drawing or representation of the graph. Informally, the term "graph invariant" is used for properties expressed quantitatively, while "property"

Molecular graph (538 words) [view diff] no match in snippet view article find links to article

molecular graphs as early as in 1874, even before the introduction of the term "graph". For the purposes of enumeration of isomers, Cayley considered "diagrams"

Series–parallel graph (1,031 words) [view diff] exact match in snippet view article find links to article

to model series and parallel electric circuits. In this context, the term graph means multigraph. There are several ways to define series–parallel graphs

Graph (discrete mathematics) (3,671 words) [view diff] no match in snippet view article

and Applied, 1 (1) : 64–90. doi:10.2307/2369436. JSTOR 2369436. The term "graph" first appears in this paper on page 65. Gross, Jonathan L.; Yellen,

James Joseph Sylvester (2,092 words) [view diff] no match in snippet view article find links to article

American Journal of Mathematics, Pure and Applied, 1 (1) : 64-90. The term "graph" first appears in this paper on page 65. J. J. Sylvester (1851) "On a

Graph theory (6,237 words) [view diff] no match in snippet view article find links to article

part of the standard terminology of graph theory. In particular, the term "graph" was introduced by Sylvester in a paper published in 1878 in Nature,

Infographic (4,817 words) [view diff] no match in snippet view article find links to article

temperatures they experienced. James Joseph Sylvester introduced the term "graph" in 1878 in the scientific magazine Nature and published a set of diagrams

Reduction strategy (2,608 words) [view diff] exact match in snippet view article find links to article

Glauert, J. R. W.; Kennaway, J. R.; Plasmeijer, M. J.; Sleep, M. R. (1987). Term graph rewriting. Parallel Architectures and Languages Europe. Vol. 259. pp. 141–158

Leavitt path algebra (2,854 words) [view diff] exact match in snippet view article find links to article

C*-algebraists, which differs slightly from that used by graph theorists. The term graph is typically taken to mean a directed graph E = ( E 0 , E 1 , r , s )

Graph C*-algebra (4,543 words) [view diff] exact match in snippet view article find links to article

C*-algebraists differs slightly from that used by graph theorists. The term graph is typically taken to mean a directed graph E = ( E 0 , E 1 , r , s )

Seir Kieran GAA (26,991 words) [view diff] exact match in snippet view article find links to article

experience for the black and amber; but it was clear that their longer-term graph was still pointing upwards. The disappointment was partly assuaged by