JavaScript is disabled for your browser. Some features of this site may not work without it.
Browsing by Title
Now showing items 2072720746 of 44540

Fincher, Myron Gustin
Cornell University, Office of the Dean of the University Faculty; Fox, Francis H.; Roberts, Stephen J.; Leonard, Ellis P. (Cornell University, 1981)Memorial Statement for Professor Myron Gustin Fincher, D.V.M., M.S. (18981981) who was Assistant Professor (1926) and Professor (1938) at the New York State College of Veterinary Medicine. Dr. Fincher was appointed ... 
Finding a Home for Urdu: Islam and Science in Modern South Asia
Amstutz, Andrew McKinney (20170530)"Finding a Home for Urdu: Islam and Science in Modern South Asia" follows the Anjumani Taraqqīyi Urdu (Association for the Advancement of Urdu), an Urdu literary and promotional association with branches across South ... 
Finding a Maximum Clique
Tarjan, Robert Endre (Cornell University, 197203)An algorithm for finding a maximum clique in an arbitrary graph is described. The algorithm has a worstcase time bound of $k(1.286)^{n}$ for some constant $k$, where $n$ is the number of vertices in the graph. Within a ... 
Finding a Minimal Cover for Binary Images: An Optimal Parallel Algorithm
Moitra, Dipen (Cornell University, 198811)Given a black and white image, represented by an array of $\surd n x \surd n$ binary valued pixels, we wish to cover the black pixels with a minimal set of (possibly overlapping) maximal squares. It was recently shown ... 
Finding Minimal Perfect Hash Functions
Karplus, Kevin; Haggard, Gary (Cornell University, 198409)A heuristic is given for finding minimal perfect hash functions without extensive searching. The procedure is to construct a set of graph (or hypergraph) models for the dictionary, then choose one of the models for use ... 
Finding optimal bipartitions of points and polygons
Mitchell, J. S. B.; Wynters, E. L. (Cornell University Operations Research and Industrial Engineering, 199012)Finding optimal bipartitions of points and polygons 
Finding Regions Fast: Single Entry Single Exit and Control Regions in Linear Time
Johnson, Richard C.; Pearson, David; Pingali, Keshav (Cornell University, 199307)Many compilation problems require computing the control dependence equivalence relation which divides nodes in a control flow graph into equivalence classes such that nodes are in the same class if and only if they have ... 
Finding Repeated Elements
Misra, Jayadev; Gries, David (Cornell University, 198207)Two algorithms are presented for finding the values that occur more than $n \div k$ times in array b[O:n1]. The second algorithm requires time $O(n \log(k))$ and extra space $O(k)$. We prove that $O(n \log(k))$ is a ... 
Finding Salvation in Food: Social and Information Influences on the Perception of Food Fads
Wang, Xinyang (20170530)This paper studies consumers' preferences towards glutenfree products. We aim at investigating what are the factors that potentially motivate a healthy individual who is free from CD (celiac disease) and NCGS (nonceliac ... 
Finding the Observed Information when Using Monte Carlo E M for Mixed Models with Partially Observed/Grouped Data
Natarajan, Ranjini; McCulloch, Charles E.; Cornell University. Biometrics Unit.; Cornell University. Dept. of Biometrics.; Cornell University. Dept. of Biological Statistics and Computational Biology. (199409) 
Finding the Overall Minimum Cut in Undirected Planar Graphs with Nonnegative Edge Costs
Ladanyi, L.; Martin, P. D. (Cornell University Operations Research and Industrial Engineering, 199501)Finding the Overall Minimum Cut in Undirected Planar Graphs with Nonnegative Edge Costs 
Fine Motion Planning for Dexterous Manipulation
Rus, Daniela (Cornell University, 199212)This thesis investigates the problem of dexterous manipulation; how can robots affect the world around them by means of their endeffectors? Dexterous manipulation is fundamental to robots operating intelligently and ... 
FineGrain Compilation for Pipelined Machines
Pingali, Keshav (Cornell University, 198808)Computer architecture design requires careful attention to the balance between the complexity of code scheduling problems and the cost and feasibility of building a machine. In this paper, we show that recently developed ... 
A FineGrain Parallelizing Compiler
Nicolau, Alexandru (Cornell University, 198612)Percolation Scheduling (PS) is a new technique for compiling programs into parallel code. It attempts to overcome problems that limit the effectiveness and applicability of currently available techniques. PS globally ... 
FineGrained Opinion Analysis: StructureAware Approaches
Choi, Ye (20101020)Natural language reflects the affective nature of the human mind. Accordingly, expressions of affect and opinion appear profusely in natural language utterances  either explicitly or implicitly. Recognizing and interpreting ... 
FineGrained User Privacy from Avenance Tags
Birrell, Eleanor; Schneider, Fred B. (20140420)In the Internet, users interact with service providers; these interactions exchange information that might be considered private by the user. Existing schemes for expressing and enforcing user privacy on the Internetnotably ... 
Finetuning the acoustics of libraries at colleges and universities
Rosenbaum, Joyce E.; Krumhansl, Carol L.; Hove, Michael J. (Cornell University, Department of Physics and Department of Psychology, 200703)The research to be discussed in this paper seeks to discover if the acoustics of library spaces matters in people's preferences for different rooms and if it affects people's performance in their work. This research ... 
Finger lakes vineyard notes. Newsletter. 1995:no.1
Peterson, David V.; Weigle, Tim; Shaffer, Barry (Penn Yan, NY: Cornell Cooperative Extension Finger Lakes Grape Program, 19950215) 
Finger lakes vineyard notes. Newsletter. 1995:no.10
Peterson, David V.; Weigle, Tim; Shaffer, Barry (Penn Yan, NY: Cornell Cooperative Extension Finger Lakes Grape Program, 19951114) 
Finger lakes vineyard notes. Newsletter. 1995:no.12
Peterson, David V.; Weigle, Tim (Penn Yan, NY: Cornell Cooperative Extension Finger Lakes Grape Program, 19951229)