Now showing items 19917-19936 of 36707

    • FINANCIAL AIDS AND SCHOLARSHIPS 1956-1957 

      Cornell University (Cornell University, 1957)
    • FINANCIAL AIDS AND SCHOLARSHIPS 1957-1958 

      Cornell University (Cornell University, 1958)
    • Financial impact of hyperketonemia 

      McArt, Jessica; Nydam, Daryl (DairyBusiness East, 2014-11)
      Almost 70% of the cost of losses from hyperketonemia, including future reproductive losses, future milk losses and future culling losses, are overlooked.
    • Financial Incentives and Autism Diagnoses: An Ohio Autism Scholarship Program Case Study 

      Wronski, Samantha (2011-05)
      In recent years, as the definition of autism has expanded to include a ―spectrum‖ of disorders (ASDs), the prevalence of ASDs have increased drastically – from 4 to 10 per 10,000 children in the early 1990s to 30 to 50 per ...
    • Financial Markets With Short Sales Prohibition 

      Pulido, Nino (2010-10-20)
      It is widely thought that short selling practices are a check against speculation and provide hedging mechanisms for many financial investments. Yet, due to its controversial character during economic downturns, regulators ...
    • Financing and Productivity of Biomedical Research across Therapeutic Areas 

      Nicholson, Sean (2009)
      Background: We estimated U.S. biomedical research funding across therapeutic areas, determined the association with disease burden, and evaluated new drug approvals that resulted from this investment. Methodology/Principal ...
    • Finch, John Alban 

      Cornell University, Office of the Dean of the University Faculty (Cornell University, 1967)
      Memorial Statement for Professor John Alban Finch who died in 1967. The memorial statements contained herein were prepared by the Office of the Dean of the University Faculty of Cornell University to honor its faculty for ...
    • Finch, William Albert 

      Cornell University, Office of the Dean of the University Faculty (Cornell University, 1912)
      Memorial Statement for Professor William Albert Finch who died in 1912. The memorial statements contained herein were prepared by the Office of the Dean of the University Faculty of Cornell University to honor its faculty ...
    • 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. (1898-1981) who was Assistant Professor (1926) and Professor (1938) at the New York State College of Veterinary Medicine. Dr. Fincher was appointed ...
    • Finding a Maximum Clique 

      Tarjan, Robert Endre (Cornell University, 1972-03)
      An algorithm for finding a maximum clique in an arbitrary graph is described. The algorithm has a worst-case 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, 1988-11)
      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, 1984-09)
      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, 1990-12)
      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, 1993-07)
      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, 1982-07)
      Two algorithms are presented for finding the values that occur more than $n \div k$ times in array b[O:n-1]. The second algorithm requires time $O(n \log(k))$ and extra space $O(k)$. We prove that $O(n \log(k))$ is a ...
    • Finding the Overall Minimum Cut in Undirected Planar Graphs with Non-negative Edge Costs 

      Ladanyi, L.; Martin, P. D. (Cornell University Operations Research and Industrial Engineering, 1995-01)
      Finding the Overall Minimum Cut in Undirected Planar Graphs with Non-negative Edge Costs
    • Fine Motion Planning for Dexterous Manipulation 

      Rus, Daniela (Cornell University, 1992-12)
      This thesis investigates the problem of dexterous manipulation; how can robots affect the world around them by means of their end-effectors? Dexterous manipulation is fundamental to robots operating intelligently and ...
    • Fine-Grain Compilation for Pipelined Machines 

      Pingali, Keshav (Cornell University, 1988-08)
      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 Fine-Grain Parallelizing Compiler 

      Nicolau, Alexandru (Cornell University, 1986-12)
      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 ...