105,524 research outputs found
Letter from M. H. Meeks to Theophilus Brown Larimore
No full textLetter from M. H. Meeks to Theophilus Brown Larimore dated 29 November 1912. The two-page letter is typewritten
Meeks Vaughan Interview
No full textCapt. Meeks B. Vaughan commissioned in the Army Air Force as a 2nd Lieutenant while at the University of Tennessee, in June of 1942. A WWII veteran, he was stationed at Guadalcanal, Bougainville, Leyte, Morotai, and Palawan from March 1944 through October 1945, serving as an Intelligence Officer (S-2) and Captain. This interview covers Capt. Vaughan's early years growing up in Timpton County, Tennessee, as well as his experiences during WWII
Marriage record of Meeks, James H. and Frierson, Mary E.
No full textMarriage license for James H. Meeks and Mary E. Frierson. E.S. Tyner was the officiant
Marriage record of Dodson, E. H. and Meeks, Effie E.
No full textMarriage license for E. H. Dodson and Effie E. Meeks. Ira G. Anderson was the officiant
Nearly Optimal Independence Oracle Algorithms for Edge Estimation in Hypergraphs
No full textConsider a query model of computation in which an n-vertex k-hypergraph can be accessed only via its independence oracle or via its colourful independence oracle, and each oracle query may incur a cost depending on the size of the query. Several recent results (Dell and Lapinskas, STOC 2018; Dell, Lapinskas, and Meeks, SODA 2020) give efficient algorithms to approximately count the hypergraph’s edges in the colourful setting. These algorithms immediately imply fine-grained reductions from approximate counting to decision, with overhead only log^Θ(k) n over the running time n^α of the original decision algorithm, for many well-studied problems including k-Orthogonal Vectors, k-SUM, subgraph isomorphism problems including k-Clique and colourful-H, graph motifs, and k-variable first-order model checking.
We explore the limits of what is achievable in this setting, obtaining unconditional lower bounds on the oracle cost of algorithms to approximately count the hypergraph’s edges in both the colourful and uncoloured settings. In both settings, we also obtain algorithms which essentially match these lower bounds; in the colourful setting, this requires significant changes to the algorithm of Dell, Lapinskas, and Meeks (SODA 2020) and reduces the total overhead to log^{Θ(k-α)}n. Our lower bound for the uncoloured setting shows that there is no fine-grained reduction from approximate counting to the corresponding uncoloured decision problem (except in the case α ≥ k-1): without an algorithm for the colourful decision problem, we cannot hope to avoid the much larger overhead of roughly n^{(k-α)²/4}. The uncoloured setting has previously been studied for the special case k = 2 (Peled, Ramamoorthy, Rashtchian, Sinha, ITCS 2018; Chen, Levi, and Waingarten, SODA 2020), and our work generalises the existing algorithms and lower bounds for this special case to k > 2 and to oracles with cost
Dalton Meeks and miniature horse
No full textBlack and white photograph of U.S. Grazing Service agent Dalton Meeks at Monticello with a miniature horse he found in a remote canyon in Wayne County, Utah, in 1945. Photo is "reversed." Accompanied by a newspaper article with the story
The Evolution of Dividend Reinvestment Plans: 1968-1988
No full textH. Kent Baker is Professor of Finance and Sue E. Meeks a Research Fellow in the Kogod College of Business Administration, Department of Finance and Real Estate at The American University
Invitation from Mr. H. Meeks, Sons of Temperance, Charlottesville, Virginia, to B. B. Walker, Bentivoglio, Virginia, February 10, 1846
No full textDie Fläche von Costa, Hoffman und Meeks
No full textEs war eine langjährige Vermutung, dass die Ebene, das Katenoid und das Helikoid die einzigen vollständigen, in den dreidimensionalen Euklidischen Raum eingebetteten Minimalflächen endlichen topologischen Typs seien. Erst 1985 wurde diese Vermutung widerlegt, als Hoffman und Meeks zeigten, dass die drei Jahre zuvor von Costa gefundene Minimalfläche eingebettet ist. Sie ist vollständig und topologisch ein Torus ohne drei Punkte. Sie wird als mathematische Sensation angesehen und ist mittlerweile nicht nur unter Mathematikern weltberühmt! In diesem Buch beschreibt der Autor ihre Konstruktion auf zwei unterschiedliche Arten, zeigt deren biholomorphe Äquivalenz und schließt eine Lücke im Eingebettetheitsbeweis mit Hilfe von Homotopiehochhebungsmethoden. Ferner stellt er neue Algorithmen zu ihrer Implementierung vor, welche Eisensteinreihen verwenden. Hierbei werden neue interessante Zusammenhänge zwischen den Invarianten der Weierstraßschen p-Funktion, der Lemniskatenkonstante und dem AGM-Algorithmus aufgezeigt. Dieses Buch enthält zahlreiche Abbildungen und richtet sich an alle Leser, die komplexe Analysis, Differentialgeometrie, Topologie und Minimalflächen lieben
- …
