|
|
Creator | Title | Description | Subject | Date |
| 201 |
 |
Hansen, Charles D. | Case study of isosurface extraction algorithm performance | Isosurface extraction is an important and useful visualization method. Over the past ten years, the field has seen numerous isosurface techniques published, leaving the user in a quandary about which one should be used. Some papers have published complexity analysis of the techniques, yet empirical... | Isosurfaces; Contours | 2000 |
| 202 |
 |
Riloff, Ellen M. | Empirical study of automated dictionary construction for information extraction in three domains | A primary goal of natural language processing researchers is to develop a knowledge-based natural language processing (NLP) system that is portable across domains. However, most knowledge-based NLP systems rely on a domain-specific dictionary of concepts, which represents a substantial knowledge-en... | Information extraction; AutoSlog; Across domains | 1996 |
| 203 |
 |
Joshi, Sarang; Venkatasubramanian, Suresh | Matching shapes using the current distance | Current Distance: It was introduced by Vaillant and Glaunès as a way of comparing shapes (point sets, curves, surfaces). This distance measure is defined by viewing a shape as a linear operator on a k-form field, and constructing a (dual) norm on the space of shapes. Shape Matching: Given two s... | | |
| 204 |
 |
Li, Peng; Regehr, John | T-check: bug finding for sensor networks | A safety property is true if something bad never happens. If any state in an execution violates the safety property, the entire execution violates that property. A liveness property holds if something good will eventually happen. An execution satisfies a liveness property if the execution will en... | | 2010-02-26 |
| 205 |
 |
Regehr, John; Pagariya, Rohit Pannalalji | Direct equivalence testing | Testing embedded software is difficult. • Further complicated by presence of memory and type safety errors in software. • Compiler contain various known bugs. Developers are skeptical to upgrade the compilers. • Is your embedded software affected by memory safety and compilation erro... | | |
| 206 |
 |
Musuvathy, Suraj Ravi; Cohen, Elaine | Tracing ridges on B-Spline surfaces | Won Best Paper Award at SIAM/ACM Joint Conference on Geometric and Physical Modeling, San Francisco, 2009 | | 2010-02-26 |
| 207 |
 |
Tripathi, Abhishek; Bremer, Peer-Timo; Pascucci, Valerio | Understanding global climate change | What is Climate Modeling? Use of quantitative methods to simulate the interactions of the atmosphere, oceans, land surface, and ice. Average Global Temperatures indicate a warming trend but that alone does not explain why it is happening. | | |
| 208 |
 |
Baxter, Brent S. | Image processing in the human visual system | This work extends the multiplicative visual model to include image texture as suggested by experiments [Campbell, Weisel] linking a low resolution Fourier analysis with neurons in certain parts of the visual cortex. The new model takes image texture into account in the sense that weak texture is acc... | Human visual system; Image texture | 1975 |
| 209 |
 |
Henderson, Thomas C. | Monte Carlo sensor networks | Biswas et al. [1] introduced a probabilistic approach to inference with limited information in sensor networks. They represented the sensor network as a Bayesian network and performed approximate inference using Markov Chain Monte Carlo (MCMC). The goal is to robustly answer queries even under no... | Monte Carlo sensor networks; Markov Chain Monte Carlo; MCMC | 2005-01-20 |
| 210 |
 |
Stoller, Leigh B. | PPE interface and functional specification | This document describes the interface and functional specification of a Protocol Processing Engine (PPE) for workstation clusters. The PPE is intended to provide the support necessary to implement low latency protocols requiring only low resource (cpu and bus bandwidth) consumption. | Protocol Processing Engine; PPE; Workstation clusters | 1995 |
| 211 |
 |
Warnock, John E. | A hidden line algorithm for halftone picture representation | In exploring applications in computer graphics, one finds quickly that the representation of three dimensional objects in picture form is both a desirable and necessary capability. Applications dealing with any form of spatial design or with visual environment simulation need the ability to represen... | Halftone picture representation; Spatial design | 1968 |
| 212 |
 |
Bruderlin, Beat | An interactive N-Dimensional constraint system | In this paper, we present a graph-based approach to geometric constraint solving. Geometric primitives (points, lines, circles, planes, etc.) possess intrinsic degrees of freedom in their embedding space. Constraints reduce the degrees of freedom of a set of objects. A constraint graph is created wi... | Geometric constraint solving | 1994 |
| 213 |
 |
Bruderlin, Beat | Detecting ambiguities: an optimistic approach to robustness problems in computational geometry | Computational geometry algorithms deal with geometric objects, usually represented by coordinates in an n-dimensional Euclidean space. Most efficient algorithms implement geometric operations as floating point arithmetic operations on the coordinates. Since floating point numbers can only approxima... | Ambiguities; Computational geometry; Robustness problems | 1990 |
| 214 |
 |
Brunvand, Erik L. | A partial scan methodology for testing self-timed circuits | This paper presents a partial scan method for testing control sections of macromodule based self-timed circuits for stuck-at faults. In comparison with other proposed test methods for self-timed circuits, this technique offers better fault coverage than methods using self-checking techniques, and ... | | 1995 |
| 215 |
 |
Carter, Tony M. | Cascade: hardware for high/variable precision arithmetic | The Cascade hardware architecture for high/variable precision arithmetic is described. It uses a radix-16 redundant signed-digit number representation and directly supports single or multiple precision addition, subtraction, multiplication, division, extraction of the square root and computation... | | 1989 |
| 216 |
 |
Organick, Elliott I. | Semiannual technical report transformation of ADA programs into silicon (1 Sept. 1981- 28 Feb. 1982) | This report summarizes the first six months work of the research project, "Transformation of Ada Programs into Silicon." Our project has five main objectives: 1. Develop and document elements of a transformation methodology for converting Ada programs, or program constructs, into VLSI systems which ... | ADA programs; VLSI | 1982 |
| 217 |
 |
Freire, Juliana | Integrated scientific workflow management for the Emulab network testbed | The main forces that shaped current network testbeds were the needs for realism and scale. Now that several testbeds support large and complex experiments, management of experimentation processes and results has become more difficult and a barrier to high-quality systems research. The popularity o... | Workflow management; Data exploration; Emulab; Network testbeds | 2006 |
| 218 |
 |
Shirley, Peter S.; Gooch, Bruce | Artistic vision: painterly rendering using computer vision techniques | We present a method that takes a raster image as input and produces a painting-like image composed of strokes rather than pixels. Unlike previous automatic painting methods, we attempt to keep the number of brush-stroke small. This is accomplished by first segmenting the image into features, finding... | Painting-like image; Raster image; Painterly rendering | 2000 |
| 219 |
 |
Henderson, Thomas C. | A study of Pierce's group generator | Pierce describes an approach to map learning with uninterpreted sensors and effectors. As part of that, he describes a sensor grouping generator operator that attempts to arrange similar sensors into groups. Here we review that work and place it in a more strenuous statistical validation framewor... | Pierce's group; Map learning; Sensor grouping generator | 2010 |
| 220 |
 |
Brunvand, Erik L. | Precise exception handling for a self-timed processor | Self-timed systems structured as multiple concurrent processes and communicating through self-timed queues are a convenient way to implement decoupled computer architectures. Machines of this type can exploit instruction level parallelism in a natural way, and can be easily modified and extended... | | 1995 |
| 221 |
 |
Hansen, Charles D. | Flow charts: visualization of vector fields on arbitrary surfaces | We introduce a novel flow visualization method called Flow Charts, which uses a texture atlas approach for the visualization of flows defined over curved surfaces. In this scheme, the surface and its associated flow are segmented into overlapping patches, which are then parameterized and packed in ... | | 2008-09 |
| 222 |
 |
Orr, Douglas B. | OMOS - An object server for program execution | The benefits of object-oriented programming are well known, but popular operating systems provide very few object-oriented features to users, and few are implemented using object-oriented techniques themselves. In this paper we discuss a mechanism for applying object-oriented programming concepts to... | OMOS; Object server | 1992 |
| 223 |
 |
Davis, Alan L. | Data driven nets: a maximally concurrent, procedural, parallel process representation for distributed control systems | A procedural parallel process representation, known as data-driven nets is described. The sequencing mechanism of the data-driven representation is based on the principle of data dependency. Operations are driven into action by the arrival of the required working set of input operands. Execution of ... | Data driven nets | 1978 |
| 224 |
 |
Kessler, Robert R. | Concurrent Scheme | This paper describes an evolution of the Scheme language to support parallelism with tight coupling of control and data. Mechanisms are presented to address the difficult and related problems of mutual exclusion and data sharing which arise in concurrent language systems. The mechanisms are tailored... | Concurrent Scheme; Parallelism | 1990 |
| 225 |
 |
Henderson, Thomas C. | Evolutionary teleomorphology | The physical layout of organs and neural structures in biological systems is important to their functioning, and is the result of evolutionary selection forces. We believe this is true even at the individual neuron level, and should be accounted for in any bio-based approach. In particular, when tr... | Evolutionary teleomorphology; Bio-based approach; Physical layout problem; PLP; Neurons; Nodes | 1995 |
