Now showing items 17519-17538 of 37676

    • An Efficient Algorithm for Nonlinear Minimax Problems 

      Conn, Andrew R.; Li, Yuying (Cornell University, 1990-03)
      We present a new method for solving a nonlinear minimax problem. This new algorithm exploits the structure and characterisation of the solution whenever possible. The exploitation is based on the results that have been ...
    • An Efficient Algorithm for One-Step Planar Compliant Motion Planning with Uncertainty 

      Briggs, Amy (Cornell University, 1989-03)
      Uncertainty in the executin of robot motion plans must be accounted for in the geometric computations from which plans are obtained, especially in the case where position sensing is inaccurate. We give an $O(n^{2} log ...
    • An Efficient Algorithm for Polymer Sequence Design 

      Kleinberg, Jon (Cornell University, 1998-03)
      Polymer sequence design is a natural inverse problem to protein structure prediction: given a target structure in three dimensions, we wish to design an amino acid sequence that will fold to it. A model of Sun, Brem, Chan, ...
    • An Efficient Algorithm for Testing Losslessness of Joins in Relational Data Bases 

      Liu, Lishing; Demers, Alan J. (Cornell University, 1978-09)
      Answering queries in a relational database model often requires the computation of joins of relations. Losslessness of joins is an important property for joins of relations to be semantically meaningful. In this paper ...
    • Efficient Algorithms for Optimal Video Transmission 

      Kozen, Dexter; Minsky, Yaron; Smith, Brian (Cornell University, 1995-05)
      This paper addresses the problem of sending an encoded video stream over a channel of limited bandwidth. When there is insufficient bandwidth available, some data must be dropped. For many video encodings, some data are ...
    • Efficient Algorithms for Protein Sequence Design and the Analysis ofCertain Evolutionary Fitness Landscapes 

      Kleinberg, Jon (Cornell University, 1998-10)
      Protein sequence design is a natural inverse problem to protein structure prediction: given a target structure in three dimensions, we wish to design an amino acid sequence that is likely fold to it. A model of Sun, Brem, ...
    • Efficient and Accurate Ethernet Simulation 

      Wang, Jia; Keshav, Srinivasan (Cornell University, 1999-02)
      The Internet is increasingly being called upon to provide different levels of service to different applications and users. A practical problem in doing so is that although Ethernet is one of the hops for nearly all ...
    • Efficient and Accurate Ethernet Simulation (revised) 

      Wang, Jia; Keshav, Srinivasan (Cornell University, 1999-05)
      The Internet is increasingly being called upon to provide different levels of service to different applications and users. A practical problem in doing so is that although Ethernet is one of the hops for nearly all ...
    • An Efficient Auction Mechanism for a Production-Transportation Problem 

      Chen, R.; Janakiraman, G.; Roundy, R.; Zhang, R. Q. (Cornell University Operations Research and Industrial Engineering, 2000-04)
      An Efficient Auction Mechanism for a Production-Transportation Problem
    • Efficient Average-Case Algorithms for the Modular Group 

      Kozen, Dexter (Cornell University, 1994-04)
      The modular group occupies a central position in many branches of mathematical sciences. In this paper we give average polynomial-time algorithms for the unbounded and bounded membership problems for finitely generated ...
    • Efficient Buffering in Reliable Multicast Protocols 

      Ozkasap, Oznur; Van Renesse, Robbert van; Birman, Kenneth P.,; Xiao, Zhen (Cornell University, 1999-07)
      Reliable multicast protocols provide all-or-none delivery to participants. Traditionally, such protocols suffer from large buffering requirements, as receivers have to buffer messages, and buffer sizes grow with the number ...
    • Efficient Calculation of Jacobian and Adjoint Vector Products in Wave Propagational Inverse Problems Using Automatic Differentiation 

      Coleman, Thomas F.; Santosa, Fadil; Verma, Arun (Cornell University, 2003-01-23)
      Wave propagational inverse problems arise in several applications including medical imaging and geophysical exploration. In these problems, one is interested in obtaining the parameters describing the medium from its ...
    • Efficient Calculation of Jacobian and Adjoint Vector Products in Wave Propagational Inverse Problems Using Automatic Differentiation 

      Coleman, Thomas F.; Santosa, Fadil; Verma, Arun (Cornell University, 2003-01-22)
      Wave propagational inverse problems arise in several applications including medical imaging and geophysical exploration. In these problems, one is interested in obtaining the parameters describing the medium from its ...
    • The Efficient Calculation of Powers of Polynomials 

      Horowitz, Ellis (Cornell University, 1972-04)
      Suppose we are given a polynomial $P(x_{1},\ldots,x_{r})$ in $r \geq 1$ variables, let $m$ bound the degree of $P$ in all variables $x_{i}, l \leq i \leq r$, and we wish to raise $P$ to the $n^{th}$ power, $n>1$. In a ...
    • Efficient CO2 Sorbents Based on Silica Foam with Ultra-large Mesopores 

      Qi, Genggeng; Fu, Liling; Choi, Brian Hyun; Giannelis, Emmanuel P. (Energy & Environmental Science, 2012-04-19)
      A series of high-capacity, amine impregnated sorbents based on a cost-effective silica foam with ultra-large mesopores is reported. The sorbents exhibit fast CO2 capture kinetics, high adsorption capacity (of up to 5.8 ...
    • Efficient Code Certification 

      Kozen, Dexter (Cornell University, 1998-01)
      We introduce a simple and efficient approach to the certification of compiled code. We ensure a basic but nontrivial level of code safety, including control flow safety, memory safety, and stack safety. The system is ...
    • Efficient Computation of Interprocedural Control Dependence 

      Ezick, James; Bilardi, Gianfranco; Pingali, Keshav (Cornell University, 2001-09-06)
      Control dependence information is useful for a wide range of software maintenance and testing tasks. For example, program slicers use it to determine statements and predicates that might affect the value of a particular ...
    • The Efficient Computation of Sparse Jacobian Matrices Using Automatic Differentiation 

      Coleman, Thomas F.; Verma, Arun (Cornell University, 1995-12)
      This paper is concerned with the efficient computation of sparse Jacobian matrices of nonlinear vector maps using automatic differentiation (AD). Specifically, we propose the use of a graph coloring technique, bi-coloring, ...
    • The efficient computation of sparse Jacobian matrices using automaticdifferentiation 

      Coleman, Thomas F.; Verma, Arun (Cornell University, 1995-11)
      This paper is concerned with the efficient computation of sparse Jacobian matrices of nonlinear vector maps using automatic differentiation (AD). Specifically, we propose the use of a graph coloring technique, bi-coloring, ...
    • An Efficient Computational Framework For Uncertainty Quantification In Multiscale Systems 

      Ma, Xiang (2011-01-31)
      To accurately predict the performance of physical systems, it becomes essential for one to include the effects of input uncertainties into the model system and understand how they propagate and alter the final solution. ...