3,493 research outputs found
Interview with Edna and Troy Whiteside
No full textTroy and Edna Whiteside talk about the ambivalent feelings that Swain County residents had towards the construction of the Fontana Dam. While the dam's construction resulted in people losing land in return for inadequate compensation and having to relocate, it also brought jobs to the area.
The largest dam of the Tennessee Valley Authority (TVA) system, Fontana Dam is built on the Little Tennessee River and was completed in 1945
Kentucky waltz
No full textfiddlescollected by- Brenda Jo Upton
played by Troy Lee Western Grove, Arkansas April 25, 1962
Reel 402
Item 19
KENTUCKY WALTZ
fiddle tuneFunding for digitization provided by the Arkansas Humanities Council and the Happy Hollow Foundation
Writers Talk featuring authors Troy Hicks and Elaine Wolf
No full textElaine Wolf, author of Camp, talks to OSU students Erin Reilly-Sanders and Allison Fetzer. Author and teacher Troy Hicks talks to OSU employee Kevin Cordi about the impact of technology on the teaching of writing.The media can be accessed here: http://streaming.osu.edu/knowledgebank/WritersTalk-Audio/WT_2013-3-18-Hicks_Wolf.mp3Ohio State University. Center for the Study and Teaching of Writin
Liberty
No full textfiddlescollected by played by Troy Lee
Brenda Jo Upton Western Grove, Arkansas
April 23, 1962
Reel 402 Item 17
LIBERTY
fiddle tuneFunding for digitization provided by the Arkansas Humanities Council and the Happy Hollow Foundation
Durang's hornpipe
No full textfiddlescollected by played by Troy Lee
Brenda Jo Upton Western Grove, Arkansas
April 25, 1962
Reel 402
Item 18
DURRING'S HORN PIPE
fiddle tuneFunding for digitization provided by the Arkansas Humanities Council and the Happy Hollow Foundation
Lee Street, Montgomery, Alabama
No full textColorized print of Lee Street in downtown Montgomery, AL. Buildings line both sides of street. Unpaved street with automobiles and horses and buggies. Postmarked Nov. 28, 1917. Divided back postcard.Printed on front: 'Lee Street, showing Union Depot, Montgomery, Ala.' ; Printed on back: 'Published by T. J. Mattox Cigar & Tobacco Co., Montgomery, Ala. Made in U.S.A.', 'C. T. Photochrom CT Chicago Co. A-14941'Written on back: 'Dear Bro. - Here is a card but not a Thanksgiving card, but it will show you a little of the town. How is hunting now are you good at caring the game. I'll bet you are well I won't get to hunt any this year. Love from Oiris.', 'Mr. Lawrence Fryburger Cozaddale, Ohio.
Tom Pearce, Ila and Floyd Wilkins, Alene, Beth Pearce, Lee Wilkins, Troy and Bob Pearce
No full textChildren Tom Pearce, Ila and Floyd Wilkins, Allene, Beth Pearce, Lee Wilkins, Troy and Bob Pearce
Candidates for Helen of Troy 1962
No full textHelen A. Johnson, Mary Lee O�� Keefe, Marlene Scheuring, Candidates for Helen of Troy. Feb 196
Candidates for Helen of Troy 1962
No full textHelen A. Johnson, Mary Lee O�� Keefe, Marlene Scheuring, Candidates for Helen of Troy. Feb 196
Approximation norms and duality for communication complexity lower bounds
No full textAbstract: We will discuss a general norm based framework for showing
lower bounds on communication complexity. An advantage of this approach is that one can use duality theory to obtain a lower bound quantity phrased as a
maximization problem, which can be more convenient to work with in showing lower bounds.
We discuss two applications of this approach.
1. The approximation rank of a matrix A is the minimum rank of a
matrix close to A in ell_infty norm. The logarithm of approximation rank lower bounds quantum communication complexity and is one of the most powerful techniques available, albeit difficult to compute in practice. We
show that an approximation norm known as gamma_2 is polynomially
related to approximation rank.
This results in a polynomial time algorithm to approximate
approximation rank, and also shows that the logarithm of approximation rank lower bounds quantum communication complexity even with entanglement which was previously not known.
2. By means of an approximation norm which lower bounds multiparty
number-on-the-forehead complexity, we show non-trivial lower bounds on the complexity of the disjointness function for up to c log log n players, c <1
- …
