Let G = (V, E) be a simple graph. A set D V is a dominating set of G if every vertex of V - D is adjacent to a vertex of D. The domination number of G, denoted by (G), is the min...
Hua-Ming Xing, Johannes H. Hattingh, Andrew R. Plu...
This study examines the effects of overlapping walking service areas of bus stops on the demand for bus transit. This requires controlling for variation in potential transit demand...
The majority of methods available to recover 3D structure from video assume that a set of feature points are tracked across a large number of frames. This is not always possible i...
MetaCrystal enables users to visualize and control the degree of overlap between the results returned by different search engines. Several linked overview tools support rapid expl...
: The distribution of overlaps of solutions of a random constraint satisfaction problem (CSP) is an indicator of the overall geometry of its solution space. For random k-SAT, nonri...