JavaScript is disabled for your browser. Some features of this site may not work without it.
Browsing by Title
Now showing items 1857818597 of 37352

Explaining the Saddlepoint Approximation
Goutis, Constantinos; Casella, George; Cornell University. Biometrics Unit.; Cornell University. Dept. of Biometrics.; Cornell University. Dept. of Biological Statistics and Computational Biology. (199512) 
Explaining Unsynthesizability Of HighLevel Robot Behaviors
Raman, Vasumathi (20130819)As robots become increasingly capable and generalpurpose, it is desirable for them to be easily controllable by a wide variety of users. The near future will likely see robots in homes and offices, performing everyday ... 
Explicit Allatom Modeling of Realistically Sized Ligandcapped Nanocrystals
Kaushik, A.P.; Clancy, P. (AIP Publishing, 20120315)We present a study of an explicit allatom representation of nanocrystals of experimentally relevant sizes (up to 6 nm), “capped” with alkyl chain ligands, in vacuum. We employ allatom molecular dynamics simulation methods ... 
Explicit form and path regularity of Martingale representations
Ma, J.; Protter, P.; Zhang, J. (Cornell University Operations Research and Industrial Engineering, 200109)Explicit form and path regularity of Martingale representations 
Explicit form and robustness of Martingale representations
Jacod, J.; Meleard, S.; Protter, P. (Cornell University Operations Research and Industrial Engineering, 200109)Explicit form and robustness of Martingale representations 
Explicit Formulas for Confidence Interval Estimation in Discrete Distributions
McCulloch, Charles E.; Casella, George; Cornell University. Biometrics Unit.; Cornell University. Dept. of Biometrics.; Cornell University. Dept. of Biological Statistics and Computational Biology. (198306) 
An Explicit Separation of Relativised Random and Polynomial Time and Relativised Deterministic Polynomial Time
Zippel, Richard (Cornell University, 198902)Inthis note, we demonstrate that a certain class of naturally occuring problems involving an oracle are solvable in random polynomial time, but not in deterministic polynomial time. This class of problems is especially ... 
Exploitation of Latency Hiding on the KSR1  Case Study: The Barnes Hut Algorithm
Tumuluri, Chaitanya; Choudhary, Alok N. (Cornell University, 199405)This study is aimed at examining the performance of dynamic, irregular and loosely synchronous class of applications on the KSR1 distributed shared memory COMA system. The BarnesHut tree based algorithm for simulating ... 
Exploitation Of PGlycoprotein At The Blood Brain Barrier For Targeted Drug Delivery
Crawford, Lindsey (20150817)Drug development for the central nervous system (CNS) has struggled to reach clinical approval. One reason many drugs do not advance into clinical applications is their low uptake in the CNS due to the blood brain barrier ... 
Exploiting Asynchrony In GPS Receiver Systems To Enable UltraLowPower Operation
Tang, Benjamin (20140127)Many complex systems are inherently asynchronous. One simple example is the neural network in human bodies where neurons communicate with one another through synaptic signaling. They pass messages around efficiently without ... 
Exploiting Fast Matrix Multiplication Within the Level 3 BLAS
Higham, Nicholas J. (Cornell University, 198904)The Level 3 BLAS (BLAS3) are a set of specifications of Fortran 77 subprograms for carrying out matrix multiplications and the solution of triangular systems with multiple righthand sides. They are intended to provide ... 
Exploiting Replication
Birman, Kenneth P.; Joseph, Thomas A. (Cornell University, 198806)NO ABSTRACT AVAILABLE 
Exploiting Sparsity in NewtownLike Methods
Marwil, Earl S. (Cornell University, 197802)The basic problem considered here is to solve sparse systems of nonlinear equations. A system is considered to be sparse when the Jacobian has fewer than ten percent nonzero entries. Algorithms are presented and their ... 
Exploiting Special Structure in Karmarkar's Linear Programming Algorithm
Todd, M. (Cornell University Operations Research and Industrial Engineering, 198610)Exploiting Special Structure in Karmarkar's Linear Programming Algorithm 
Exploiting Structure For Sentiment Classification
Yessenalina, Ainur (20120820)This thesis studies the problem of sentiment classification at both the document and sentence level using statistical learning methods. In particular, we develop computational models that capture useful structurebased ... 
Exploiting Structure In Combinatorial Problems With Applications In Computational Sustainability
Dilkina, Bistra (20120131)Combinatorial decision and optimization problems are at the core of many tasks with practical importance in areas as diverse as planning and scheduling, supply chain management, hardware and software verification, electronic ... 
Exploiting Virtual Synchrony in Distributed Systems
Birman, Kenneth P.; Joseph, Thomas A. (Cornell University, 198702)We describe applications of a new software abstraction called the virtually synchronous process group. Such a group consists of a set of processes that cooperate to implement some distributed behavior in an environment ... 
Exploration Vs. Exploitation In The Information Filtering Problem And Its Application In Arxiv.Org
Zhao, XiaoTing (20150817)We consider information filtering, in which we face a stream of items too voluminous to process by hand (e.g., scientific articles, blog posts, emails), and must rely on a computer system to automatically filter out ... 
Explorations In STM Phenomenology : "Inversion" Techniques For STM Data Analyses
Pujari, Sumiran (20120131)With the advent of Scanning Tunneling Microscopy (STM), the STM has provided us with unprecedented information on the electronic properties of a sample at the atomic level. Because of the STM's accessibility to the microscopic ...