Search Results for ""

The solid cut from a horizontal cylinder of length L and radius R by a single plane oriented parallel to the cylinder's axis of symmetry (i.e., a portion of a horizontal ...

A clause (i.e., a disjunction of literals) is called a Horn clause if it contains at most one positive literal. Horn clauses are usually written as L_1,...,L_n=>L(=¬L_1 v ... ...

A rule for polynomial computation which both reduces the number of necessary multiplications and results in less numerical instability due to potential subtraction of one ...

Let X={x_1>=x_2>=...>=x_n|x_i in R} (1) and Y={y_1>=y_2>=...>=y_n|y_i in R}. (2) Then there exists an n×n Hermitian matrix with eigenvalues X and diagonal elements Y iff ...

Horowitz reduction is used in indefinite integration to reduce a rational function into polynomial and logarithmic parts. The polynomial part is then trivially integrated, ...

A univariate distribution proportional to the F-distribution. If the vector d is Gaussian multivariate-distributed with zero mean and unit covariance matrix N_p(0,I) and M is ...

There are three flavors of Hough transform. The first (original) was used to detect straight lines in bubble chamber images. The technique parameterizes pattern space, then ...

A root-finding algorithm based on the iteration formula x_(n+1)=x_n-(f(x_n))/(f^'(x_n)){1+(f(x_n)f^('')(x_n))/(2[f^'(x_n)]^2)}. This method, like Newton's method, has poor ...

Let P be a primitive polytope with eight vertices. Then there is a unimodular map that maps P to the polyhedron whose vertices are (0, 0, 0), (1, 0, 0), (0, 1, 0), (0, 0, 1), ...

Let a set of vertices A in a connected graph G be called convex if for every two vertices x,y in A, the vertex set of every (x,y) graph geodesic lies completely in A. Also ...