Now showing items 19868-19887 of 37280

    • 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 ...
    • Fast Wavelet Transforms for Matrices Arising from Boundary Element Methods 

      Bond, David M.; Vavasis, Stephen A. (Cornell University, 1994-03)
      (The following contains mathematical formulae and symbols that may become distorted in ASCII text.) For many boundary element methods applied to Laplace's equation in two dimensions, the resulting integral equation has ...
    • A Faster Algorithm for the Quickest Transshipment Problem 

      Fleischer, L. (Cornell University Operations Research and Industrial Engineering, 1997-03)
      A Faster Algorithm for the Quickest Transshipment Problem
    • Faster Algorithms for the Nonemptiness of Streett Automata and forCommunication Protocol Pruning 

      Henzinger, Monika; Telle, Jan (Cornell University, 1995-12)
      This paper shows how a general technique, called {\it lock-step search}, developed for dynamic graph algorithms, can be used to improve the running time of two problems arising in program verification and communication ...
    • Faster approximation algorithms for the unit capacity concurrent flow problem with applications to routing and finding sparse cuts 

      Tardos, E.; Klein, P.; Plotkin, S.; Stein, C. (Cornell University Operations Research and Industrial Engineering, 1991-02)
      This paper to appear in "IIE Transactions".
    • A faster parametric minimum cut algorithm 

      Gusfield, D.; Tardos, E. (Cornell University Operations Research and Industrial Engineering, 1990-09)
      A faster parametric minimum cut algorithm
    • Faster Possibility Detection by Combining Two Approaches 

      Stoller, Scott D.; Schneider, Fred B. (Cornell University, 1995-04)
      A new algorithm is presented for detecting whether a particular computation of an asynchronous distributed system satisfies $\Poss\Phi$ (read "possibly $\Phi$"), meaning the system could have passed through a global state ...
    • A Faster PSPACE Algorithm for Deciding the Existential Theory of the Reals 

      Renegar, J. (Cornell University Operations Research and Industrial Engineering, 1988-04)
      A Faster PSPACE Algorithm for Deciding the Existential Theory of the Reals
    • Faster SVD for Matrices with Small $m/n$ 

      Bau, David (Cornell University, 1994-03)
      The singular values of a matrix are conventionally computed using either the bidiagonalization algorithm by Golub and Reinsch (1970) when $m/n less than 5/3$, or the algorithm by Lawson and Hanson (1974) and Chan (1982) ...