Now showing items 18878-18897 of 37359

    • Fashion: The Sine Qua Non Of Modernity 

      Kang, Eun Jung (2012-08-20)
      The purpose of this dissertation is to respond to the question-What is fashion? Although significant efforts have been made to identify the meaning and implications of fashion in our times, no term of explanatory reference ...
    • Fashioning A Discourse Of Elegance And Politics: The Historical Roots Of The Sapeur Movement, 1884-1980 

      Porter, Danielle (2010-08-05)
      This thesis focuses on the history of the movement in CongoBrazzaville and the Democratic Republic of the Congo. It seeks to bridge the gaps between the social, cultural, and political histories of these two countries with ...
    • FAST (Faceted Application of Subject Terminology) overview 

      Chew, Chiat Naun (2013-10-08)
      An overview of OCLC's FAST (Faceted Application of Subject Terminology), its characteristics and potential uses.
    • Fast Algorithms for $N$-body Simulation 

      Sundaram, Sridhar (Cornell University, 1993-08)
      Many physical models require the simulation of a large number ($N$) of particles interacting through pair-wise inverse square law forces. $N$-body simulations are employed in fluid-dynamics, biochemistry, astrophysics, ...
    • Fast approximation algorithms for fractional packing and covering problems 

      Plotkin, S. A.; Shmoys, D.; Tardos, E. (Cornell University Operations Research and Industrial Engineering, 1992-02)
      This paper published in "Computational Optimization and Applications" 2 (1993) 301-318
    • Fast Approximation Algorithms for Multicommodity Flow Problems 

      Leighton, T.; Makedon, F.; Plotkin, S.; Stein, C.; Tardos, E.; Tragoudas, S. (Cornell University Operations Research and Industrial Engineering, 1995-02)
      Fast Approximation Algorithms for Multicommodity Flow Problems
    • Fast approximation algorithms for multicommodity flow problems 

      Leighton, T.; Makedon, F.; Plotkin, S.; Stein, C.; Tardos, E.; Tragoudas, S. (Cornell University Operations Research and Industrial Engineering, 1991-08)
      This paper published in "Mathematical Programming" 65 (1994), 217-245
    • Fast But Right: Outbreak Surveillance And Foodborne Knowledge Infrastructure 

      Boyce, Angie (2014-08-18)
      This dissertation examines knowledge infrastructures for detecting and investigating national outbreaks of foodborne disease. Drawing on archival and ethnographic material from US public health and regulatory agencies, I ...
    • Fast Compact Prime Number Sieves (Among Others) 

      Pritchard, Paul (Cornell University, 1981-10)
      NO ABSTRACT SUPPLIED
    • Fast Compiled Logic Simulation Using Linear BDDs 

      Gupta, Sudeep; Pingali, Keshav (Cornell University, 1995-06)
      This paper presents a new technique for compiled zero delay logic simulation, and includes extensive experiments that demonstrate its performance on standard benchmarks. Our compiler partitions the circuit into fanout-freeregions ...
    • Fast Compiled Logic Simulation Using Linear BDDs 

      Gupta, Sudeep; Pingali, Keshav (Cornell University, 1995-06)
      This paper presents a new technique for compiled zero delay logic simulation, and includes extensive experiments that demonstrate its performance on standard benchmarks. Our compiler partitions the circuit into fanout-free ...
    • Fast Detection of Common Geometric Substructure in Proteins 

      Chew, Paul; Kedem, Klara; Kleinberg, Jon; Huttenlocher, Dan (Cornell University, 1998-09)
      We consider the problem of identifying common three-dimensional substructures between proteins. Our method is based on comparing the shape of the $\alpha$-carbon backbone structures of the proteins in order to find 3D ...
    • Fast Firewall Implementations for Software-based Routers 

      Qiu, Lili; Varghese, George; Subash, Suri (Cornell University, 2000-07-14)
      Routers must perform packet classification at high speeds to efficiently implement functions such as firewalls. The classification can be based on an arbitrary number of prefix and range fields in the packet header. The ...
    • The Fast Fourier Transform on Hypercube Parallel Computers 

      Chu, Clare Yung-lei (Cornell University, 1987-11)
      The Fast Fourier Transform appears frequently in scientific computing. Therefore it is desirable to implement it efficiently on parallel computers. In this thesis, we investigate several different aspects of parallel ...
    • A Fast Method for Interpolating Preconditioning 

      Horowitz, Ellis (Cornell University, 1971-12)
      Given $n$ points $(x_{i},y_{i})$ the best algorithms for finding the unique interpolating polynomial $G(x)$ such that $G(x_{i})=y_{i}$ take $O(n^{2})$ arithmetic operations. If the $(x_{i}$ are known in advance then an ...
    • Fast Near Neighbor Search in High-Dimensional Binary Data 

      Shrivastava, Anshumali; Li, Ping (Internetware 2013, 2013-10-23)
      Numerous applications in search, databases, machine learning, and computer vision, can benefit from efficient algorithms for near neighbor search. This paper proposes a simple framework for fast near neighbor search in ...
    • Fast Ordered Multicasts 

      Stephenson, Patrick (Cornell University, 1991-02)
      In this thesis, we present new protocols that provide reliable ordered multicasts to multiple overlapping process groups in the presence of failures. Our protocols provide two kinds of message delivery ordering - causal ...
    • Fast Parallel Algorithms for the Modular Decomposition 

      Novick, Mark B. (Cornell University, 1989-06)
      A module in a graph is like a black box: all the vertices in the module look the same to vertices not in the module. This paper gives the first $NC$ algorithm for finding the modular decomposition of a graph. The algorithm ...
    • Fast Parallel Matrix and GCD Computations 

      Borodin, Allan B.; Von zur Gathen, Joachim; Hopcroft, John E. (Cornell University, 1982-04)
      We present parallel algorithms to compute the determinant and characteristic polynomial of n x n-matrices and the gcd of polynomials of degree $\leq$n. The algorithms use parallel time $O(\log^{2}n)$ and a polynomial ...
    • Fast Polar Decomposition of an Arbitrary Matrix 

      Higham, Nicholas J.; Schreiber, Robert S. (Cornell University, 1988-10)
      The polar decomposition of an $m x n$ matrix $A$ of full rank, where $m \geq n$, can be computed using a quadratically convergent algorithm of Higham [SIAM J. Sci. Stat. Comput., 7 (1986), pp.1160-1174]. The algorithm ...