TOPICS
Search

Search Results for ""


7391 - 7400 of 13135 for Computational GeometrySearch Results
A function f:{0,1}^(l(n))×{0,1}^n->{0,1}^(m(n)) is a trapdoor one-way hash function if f is a trapdoor one-way function and is also a one-way hash function, i.e., if, ...
The set of all centroid points in a weighted tree (Harary 1994, p. 36).
The height of a tree g is defined as the vertex height of its root vertex, where the vertex height of a vertex v in a tree g is the number of edges on the longest downward ...
A tree having an infinite number of branches and whose nodes are sequences generated by a set of rules.
In statistics, a trial is a single performance of well-defined experiment (Papoulis 1984, p. 25), such as the flipping of a coin, the generation of a random number, the ...
The triangle coefficient is function of three variables written Delta(abc)=Delta(a,b,c) and defined by Delta(abc)=((a+b-c)!(a-b+c)!(-a+b+c)!)/((a+b+c+1)!), (Shore and Menzel ...
The condition that j takes on the values j=j_1+j_2,j_1+j_2-1,...,|j_1-j_2|, denoted Delta(j_1j_2j).
Let a triangle have angles A, B, and C, then inequalities include sinA+sinB+sinC<=3/2sqrt(3) (1) 1<=cosA+cosB+cosC<=3/2 (2) sin(1/2A)sin(1/2B)sin(1/2C)<=1/8 (3) ...
A triangular grid, also called an isometric grid (Gardner 1986, pp. 209-210), is a grid formed by tiling the plane regularly with equilateral triangles.
The triangular inequalities are the inequalities |x-y|<=z<=x+y for real numbers (x,y,z) (Messiah 1962, p. 1056). If these inequalities hold for any one permutation of ...
1 ... 737|738|739|740|741|742|743 ... 1314 Previous Next

...