A Steiner tree for a set S of vertices in a connected graph G is a connected subgraph of G with a smallest number of edges that contains S. The Steiner interval I (S) of S is the union of all the vertices of G that belong to some Steiner tree for S. If S = {u, v}, then I (S) = I [u, v] is called the interval between u and v and consists of all vertices that lie on some shortest u–v path in G. T...

Space geodetic estimates of the rate of Nazca-South America convergence and Nazca-Pacific spreading averaging over several years show that present day rates are significantly slower than the 3 million year average NUVEL-1A model. The implied rates of deceleration are consistent with longer term trends extending back to at least 20 Ma, about the time of initiation of Andes growth, and may reflec...

the basic National horizontal and vertical networks of geodetic control and provides governmentwide leadership in the improvement of geodetic surveying methods and instrumentation, coordinates operations to ass ure network development, and provides specifications and criteria for survey operations by Federal, State, and other agencies. NGS engages in research and development for the improvement...

Automatic writer identification and writer verification has recently received significant attention in the field of historical analysis. In this work a short overview of current approaches for writer identification is given. Current state-of-the-art results on contemporary data are related to different approaches for writer verification on a small dataset of datum lines extracted from papal cha...