Search Results for ""
261 - 270 of 677 for Hausdorff DistanceSearch Results
The Pell graph Pi_n is the graph defined as follows. Consider n-tuples of (0,1,2) such that maximal blocks of an odd number of 2's are forbidden. Take these as the vertices ...
Given two circles with one interior to the other, if small tangent circles can be inscribed around the region between the two circles such that the final circle is tangent to ...
Two trains are on the same track a distance 100 km apart heading towards one another, each at a speed of 50 km/h. A fly starting out at the front of one train, flies towards ...
Topology
The x- (horizontal) coordinate of a point in a two dimensional coordinate system. Physicists and astronomers sometimes use the term to refer to the axis itself instead of the ...
Alpha is the name for the first letter in the Greek alphabet: alpha. In finance, alpha is a financial measure giving the difference between a fund's actual return and its ...
The angular acceleration alpha is defined as the time derivative of the angular velocity omega, alpha=(domega)/(dt)=(d^2theta)/(dt^2)z^^=(a)/r.
The Bellman-Ford algorithm is an algorithm for solving the shortest path problem, i.e., finding a graph geodesic between two given vertices. Other algorithms that can be used ...
All triangles are bicentric, i.e., possess both an incircle and a circumcircle. This is not necessarily the case for polygons with four or more sides. The inradius r and ...
Let T be a tree defined on a metric over a set of paths such that the distance between paths p and q is 1/n, where n is the number of nodes shared by p and q. Let A be a ...
...
View search results from all Wolfram sites (4799 matches)

