Now showing items 17466-17485 of 37358

    • 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. ...
    • Efficient Computational Techniques For High Dimensional Stochastic Modeling 

      Wan, Jiang (2013-08-19)
      Modeling of physical systems in the presence of uncertainties is critical in many respects. Therefore it is necessary to quantitatively characterize these uncertainties. There are two major types of problems with respect ...
    • Efficient Concatenable Ordered Lists 

      Pugh, William W. (Cornell University, 1987-04)
      A new approach for providing an efficient implementation of concatenable ordered lists is discussed. The structures described have an equivalence to search trees. In balanced search trees the tree is continually modified ...
    • Efficient Concurrency Control for Libraries of Typed Objects 

      Raeuchle, Thomas (Cornell University, 1986-09)
      Concurrency control algorithms use a conflict detection strategy to determine operations that have to be delayed to provide a correct serialization order. To keep the cost of detecting conflicts feasible, most algorithms ...
    • Efficient Content Distribution With Managed Swarms 

      Peterson, Ryan (2012-01-31)
      Content distribution has become increasingly important as people have become more reliant on Internet services to provide large multimedia content. Efficiently distributing content is a complex and difficult problem: large ...
    • Efficient Continuous-Time Dynamic Network Flow Algorithms 

      Fleischer, L.; Tardos, E. (Cornell University Operations Research and Industrial Engineering, 1996-08)
      Efficient Continuous-Time Dynamic Network Flow Algorithms
    • Efficient Design Of Inbound Logistics Networks 

      Dong, Zhijie (2015-08-17)
      Logistics is a vitally important part of the economy, and it is now a $1.45 trillion industry in the United States representing 8.3 percent of GDP. Efficient design of routes and schedules for moving materials into ...
    • Efficient Dynamic Network Flow Algorithms 

      Hoppe, Bruce (Cornell University, 1995-06)
      Dynamic network flows model transportation. A dynamic network consists of a graph with capacities and transit times on its edges. Flow moves through a dynamic network over time. Edge capacities restrict the rate of ...
    • Efficient Error Recovery For Reliable Multicast 

      Xiao, Zhen (Cornell University, 2001-01-03)
      Multicast is an efficient mechanism for distributing data from one sender to multiple receivers. Many applications need a reliable multicast service which is not provided by the existing IP multicast protocol. Providing ...
    • Efficient Estimations from a Slowly Convergent Robbins-Monro Process 

      Ruppert, D. (Cornell University Operations Research and Industrial Engineering, 1988-02)
      Efficient Estimations from a Slowly Convergent Robbins-Monro Process
    • Efficient Generation of Memory Reference Strings Based on the LRU Stack Model of Program Behaviour 

      Babaoglu,Ozalp (Cornell University, 1981-10)
      We consider the problem of generating memory reference strings that are to be used instead of real program address traces with the generator based on the Least-Recently-Used Stack Model (LRUSM) of program behaviour. A ...
    • Efficient Geometric Algorithms for Robot Sensing and Control 

      Briggs, Amy (Cornell University, 1995-02)
      This thesis addresses the problem of automatically generating solutions to robotics tasks that are specified at a high level. In particular, we consider the problems of robot motion planning and the planning of sensor ...
    • Efficient group sequential designs when there are several effect sizes under consideration 

      Jennison, C.; Turnbull, B. (Cornell University Operations Research and Industrial Engineering, 2004-10)
      Efficient group sequential designs when there are several effect sizes under consideration
    • Efficient Hierarchical Radiosity in Complex Environments 

      Smits, Brian Edward (Cornell University, 1994-08)
      This thesis presents methods for speeding up the global illumination computations by using bounds on error to eliminate work that is not needed for a solution of a given accuracy. This work makes the hieerarchical ...