|
|
Creator | Title | Description | Subject | Date |
1 |
 | Smith, Kent F. | A fast parallel squarer based on divide-and-conquer | Fast and small squarers are needed in many applications such as image compression. A new family of high performance parallel squarers based on the divide-and-conquer method is reported. Our main result was realizing the basis cases of the divide-and-conquer recursion by using optimized n-bit primiti... | Squarer; Parallel squarers; Divide-and-conquer; MOPS; CMOS | 1995 |
2 |
 | Henderson, Thomas C.; Hansen, Charles D. | A fault tolerant sensor scheme | Multi-sensor systems pose the problem of how to coherently and efficiently treat the data provided by the various sensors. However. the availability of greater numbers of sensors also broadens the ability to build fault tolerant sensor systems. We define a framework in which sensors can be abstractl... | Multi-sensor systems; Logical sensors | 1983 |
3 |
 | 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 |
4 |
 | Weinstein, David | A morphing algorithm for generating near optimal grids: applications in computational medicine | We apply morphing to t h e problem of generating the initial mesh for finite element simulations. This algorithm reduces mesh adaptation time by integrating physical and geometric constraints to provide a near optimal initial mesh. We apply this method to large-scale bioelectric field problems invol... | Morphing algorithm; Bioelectric field problems | 1994 |
5 |
 | Bruderlin, Beat | A new approach to tolerance analysis | Tolerance analysis is seen as part of a more general problem, namely handling data with uncertainty. Uncertain geometric data arises when interpreting measured data, but also in solid modeling where floating point approximations are common, when representing design tolerances, or when dealing with l... | Tolerance analysis | 1994 |
6 |
 | Kirby, Robert Michael II; Johnson, Christopher R. | A new family of variational-form-based regularizers for reconstructing epicardial potentials from body-surface mapping | We propose a new family of regularizers for the inverse ECG problem, using a variational principle that underlies finite element approximation methods. As an alternative to traditional Tikhonov regularizers, the variational formulation has several advantages: 1)it enables a simple construction of ... | | 2010 |
7 |
 | Cohen, Elaine | A new local basis for designing with tensioned splines | Recently there has been a great deal of interest in the use of "tension" parameters to augment control mesh vertices as design handles for piecewise polynomials. A particular local cubic basis called p-splines, which has been termed a "generalization of B-splines", has been proposed as an appropriat... | Tensioned splines | 1985 |
8 |
 | Lyche, Tom | A note on the Oslo algorithm | The Oslo algorithm is a recursive method for updating the B-spline representation of a curve or tensor product surface when extra knots are added. In the present note the derivation of this method is simplified. | Oslo algorithm; B-spline; Curve product surface; Tensor product surface | 1987 |
9 |
 | Parke, Frederic Ira | A parametric model for human faces | This report presents a computer model for the representation of human faces. This three-dimensional, parametric model produces shaded facial images. The face, constructed of polygonal surfaces, is manipulated through the use of parameters which control interpolation, translation, rotation and scalin... | Parametric model; Human face | 1975 |
10 |
 | Gopalakrishnan, Ganesh | A partial order reduction algorithm without the Proviso | This paper presents a partial order reduction algorithm, called Two phase, that preserves stutter free LTL properties. Two phase dramatically reduces the number of states visited compared to previous partial order reduction algorithms on most practical protocols. The reason can be traced to a step o... | Order reduction algorithm; Proviso step | 1998 |
11 |
 | 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 |
12 |
 | Baxter, Brent S. | A standard magnetic tape format for digital image exchange | This proposal describes a simple yet flexible magnetic tape format for exchanging digital image information. Multi-dimensional arrays of raster scan data are stored as sequential files, with descriptive information related to the sefiles stored in an initial directory file. Directory information is ... | Raster scan data | 1981 |
13 |
 | Sobh, Tarek M. | A survey on sensor classifications for industrial applications | The importance of sensors in industrial applications is a result of the introduction of many robotics, automation, and intelligent control techniques into factory floors. Research and improvements need to be continuously performed to meet the challenges in automation and manufacturing applications i... | Sensor classifications; Industrial applications; Sensors | 1995 |
14 |
 | Sobh, Tarek M.; Henderson, Thomas C. | A unifying framework for tolerance analysis in sensing, design, and manufacturing | In this work we address the problem of tolerance representation and analysis across the domains of industrial inspection using sensed data, CAD design, and manufacturing. Instead of using geometric primitives in CAD models to define and represent tolerances, we propose the use of stronger methods t... | Tolerance representation; Tolerance analysis; Industrial inspection; Sensed data; CAD design | 1994 |
15 |
 | Beazley, David. M. | A wrapper generation tool for the creation of scriptable scientific applications | In recent years, there has been considerable interest in the use of scripting languages as a mechanism for controlling and developing scientific software. Scripting languages allow scientific applications to be encapsulated in an interpreted environment similar to that found in commercial scientific... | | 1998 |
16 |
 | Panangaden, Prakash | Abstract interpretation and indeterminacy | We present a semantic theory that allows us to discuss the semantics of indeterminate operators in a dataflow network. The assumption is made that the language in which the indeterminate operators are written has a construct that allows for the testing of availability of data on input lines. We then... | Semantics; Indeterminate operators | 1984 |
17 |
 | Hansen, Charles D. | Accelerated isosurface extraction in time-varying fields | For large time-varying data sets, memory and disk limitations can lower the performance of visualization applications. Algorithms and data structures must be explicitly designed to handle these data sets in order to achieve more interactive rates. The Temporal Branch-on-Need Octree (T-BON) extends t... | Isosurfaces; Time-dependent scalar field visualization; Multiresolution methods; Octree; Bricking; Unstructured grid visualization; Out-of-core visualization | 2000 |
18 |
 | Brunvand, Erik L. | ACT: A DFT tool for self-timed circuits | This paper presents a Design for Testability (DFT) tool called ACT (Asynchronous Circuit Testing) which uses a partial scan technique to make macro-module based selftimed circuits testable. The ACT tool is the first oFits kind for testing macro-module based self-timed circuits. ACT modifies design... | | 1997 |
19 |
 | Cohen, Elaine | Adaptive isocurves based rendering for freeform surfaces | Freeform surface rendering is traditionally performed by approximating the surface with polygons and then rendering the polygons. This approach is extremely common because of the complexity in accurately rendering the surfaces directly. Recently, several papers presented methods to render surfaces ... | Freeform surface rendering; Isocurves | 1992 |
20 |
 | Crow, Franklin C. | The aliasing problem in computer-synthesized shaded images | This paper describes work toward improving the quality of computer-synthesized shaded images. Current (practical) hidden-surface algorithms produce an image whose precision is strictly limited by the number of picture elements. Problems caused by this limitation are described and explained in the t... | aliasing problem; shaded images; hidden-surface algorithms | 1976 |
21 |
 | Shirley, Peter S. | An anisotropic phong light reflection model | We present a new BRDF model that attempts to combine the advantages of the various empirical models currently in use. In particular, it has intuitive parameters, is anisotropic, energy-conserving, reciprocal, has an appropriate non-Lambertian diffuse term, and is well-suited for use in a Monte Carlo... | BRDF model; Anisotropic; Phong light reflection model | 2000 |
22 |
 | Keller, Robert M. | An approach to determinacy proofs | It is known that any parallel program graph composed of continuous operators itself represents a continuous function. In other words, the network is determinate in the sense that for a given input, the output is unique, independent of the timing of the constituent operators. This result is applied t... | Parallel program graph; Determinacy proofs | 1978 |
23 |
 | Khoche, Ajay | An extended cell set of self-timed designs | The high level synthesis approach described in [1] uses hopCP[2] language for behavioral descriptions. The behavioral specifications are then translated into Hop Flow Graphs (HFGs). The actions in the graph are then refined such that refined actions can be directly mapped onto asynchronous circuit b... | Self-timed designs; hopCP; Hop Flow Graphs; Asynchronous circuit blocks; Action-blocks | 1993 |
24 |
 | 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 |
25 |
 | Riloff, Ellen M. | Analyses for elucidating current question answering technology | In this paper, we take a detailed look at the performance of components of an idealized question answering system on two diff erent tasks: the TREC Question Answering task and a set of reading comprehension exams. We carry out three types of analysis: inherent properties of the data, feature analys... | TREC Question Answering task | 2001-12 |