Now showing items 1-20 of 1736

• #### The 1986-1987 Taulbee Survey Report: The Computing Research Board's Survey on the Production and Employment of Ph.D.'s and Faculty in Computer Science and Engineering ﻿

(Cornell University, 1988-02)
ABSTRACT NOT AVAILABLE
• #### 2.25 N-Lower Bound on the Combinational Complexity of Boolean Functions ﻿

(Cornell University, 1974-12)
Consider the combinational complexity L(f) of Boolean functions over the basis $\Omega = \{f|f:\{0,1\}^{2} \rightarrow \{0,1\}\}$. A new Method for proving linear lower bounds of size 2n is presented. Combining it with ...
• #### The 711 Problem ﻿

(Cornell University, 1982-05)
NO ABSTRACT SUPPLIED
• #### A Hamiltonian-Schur Decomposition ﻿

(Cornell University, 1979-09)
• #### A Logic For Correct Program Development ﻿

(Cornell University, 1979-08)
• #### Abstract Identifiers and Textual Reference ﻿

(Cornell University, 2002-11-15)
Here are three proposals concerning the structure and maintenance of formal, inter-referential, digitally stored texts: (1) include abstract atomic identifiers in texts, (2) identify these identifiers with references ...
• #### Abstract Semantics for a Higher order Functional Language with Logic Variables ﻿

(Cornell University, 1991-07)
The addition of logic variables to functional languages gives the programmer novel and powerful tools such as incremental definition of data structures through constraint intersection. A number of such "hybrid" languages, ...
• #### Abstract Value Constructors: Symbolic Constants for Standard ML ﻿

(Cornell University, 1992-06)
Standard ML (SML) has been used to implement a wide variety of large systems, such as compilers, theorem provers, graphics libraries and even operating systems. While SML provides a convenient, high-level notation for ...
• #### Abstractions for Fault Tolerance in Distributed Systems ﻿

(Cornell University, 1986-04)
Abstractions useful in fault-tolerant and distributed systems are described. The abstractions are specified as properties of protocols, hence they have a different flavor from abstractions prevalent in sequential and ...
• #### An Accelerated Interior Point Method Whose Running Time Depends Only on $A$ ﻿

(Cornell University, 1993-10)
We propose a "layered-step" interior point (LIP) algorithm for linear programming. This algorithm follows the central path, either with short steps or with a new type of step called a "layered least squares" (LLS) step. ...
• #### Access Control in Parallel Programs ﻿

(Cornell University, 1978-01)
An important component of a programming language for writing operating systems, or other large parallel systems, is the set of access control facilities. Two principles for access control, expressive power and access ...
• #### Access Normalization: Loop Restructuring for NUMA Compilers ﻿

(Cornell University, 1992-04)
A common feature of many scalable parallel machines is non-uniform memory access - a processor can access data in its local memory ten to a thousand times faster than it can access non-local data. In addition, when a ...
• #### Accommodating Simplicity and Complexity in Metadata: Lessons from theDublin Core Experience ﻿

(Cornell University, 2000-06-30)
The Dublin Core Metadata Element Set (DCMES) grew out of a recognized need for improved resource discovery of web resources. Initial work on the DCMES focused on the requirement of simplicity: "ordinary" users should be ...
• #### Accumulators: New Logic Variable Abstractions for Functional Languages ﻿

(Cornell University, 1988-12)
Much attention has been focused by the declarative languages community on combining the functional and logic programming paradigms. In particular, there are many efforts to incorporate logic variables into functional ...
• #### Accurate and Reliable Algorithms for Global Illumination ﻿

(Cornell University, 1994-10)
The simulation of global illumination is one of the most fundamental problems in computer graphics, with applications in a wide variety of areas, such as architecture and lighting design, computer-aided design, and virtual ...
• #### Achieving Critical Reliability With Unreliable Components andUnreliable Glue ﻿

(Cornell University, 1995-03)
Even the most aggressive quality assurance procedures yield at best probabilistic confidence in the reliability of complex systems. Distributed systems, because of their large numbers of components, are enormously complex ...
• #### Ada/CS - An Instructional Subset of the Programming Language Ada ﻿

(Cornell University, 1979-10)
NO ABSTRACT SUPPLIED
• #### Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared Memory Machines ﻿

(Cornell University, 1986-08)
We propose a parallel algorithm, called adaptive bitonic sorting, which runs on a PRAC, a shared-memory multiprocessor where fetch and store conflicts are disallowed. On a $P$ processors PRAC, our algorithm achieves ...
• #### Adaptive Error Bracketing for Controlled-Precision Volume Rendering ﻿

(Cornell University, 1992-11)
We present a new ray tracing approach to volume rendering in which the low-albedo volume rendering integral for each ray is efficiently computed to any prescribed accuracy. By bracketing the emission and absorption ...
• #### Adaptive Locking ﻿

(Cornell University, 1987-04)
Adaptive locking is a new concurrency control scheme for relational database systems. An adaptive locking scheduler automatically issues to each transaction appropriate locks on its read and write sets. The read and write ...