Search Results for ""

An n-component of a graph G is a maximal n-connected subgraph.

The endpoints of a confidence interval are known as the confidence limits.

The apodization function A(x)=(1-(x^2)/(a^2))^2. Its full width at half maximum is sqrt(4-2sqrt(2))a. Its instrument function is ...

A formal argument in logic in which it is stated that (1) P=>Q and R=>S (where => means "implies"), and (2) either P or R is true, from which two statements it follows that ...

A sentence is called a contradiction if its truth table contains only false entries.

The science of breaking codes, which is one part of cryptology.

A cycle double cover of an undirected graph is a collection of cycles that cover each edge of the graph exactly twice. For a polyhedral graph, the faces of a corresponding ...

A set S together with a relation >= which is both transitive and reflexive such that for any two elements a,b in S, there exists another element c in S with c>=a and c>=b. In ...

The kurtosis excess of a distribution is sometimes called the excess, or excess coefficient. In graph theory, excess refers to the quantity e=n-n_l(v,g) (1) for a v-regular ...

An experiment E(S,F,P) is defined (Papoulis 1984, p. 30) as a mathematical object consisting of the following elements. 1. A set S (the probability space) of elements. 2. A ...