176 - 200 of 937
Number of results to display per page
CreatorTitleDescriptionSubjectDate
176 Distributed computation for computer animationComputer animation is a very computationally intensive task. Recent developments in image synthesis, such as shadows, reflections and motion blur enhance the quality of computer animation, but also dramatically increase the amount of CPU time needed to do it. Fortunately, the computations involved w...Distributed computation1987
177 IKS: image kernel system users' manualIKS (for Image kernel System), is an image processing system, currently being used by the Computer Vision and Image Processing group at the University of Utah. IKS provides a convenient environment for reading, writing, and manipulating images. The system consists of two types of routines. First, t...Image kernel System; IKS1987
178 Multisensor knowledge systems: interpreting 3-D structureWe describe an approach which facilitates and makes explicit the organization of the knowledge necessary to map multisensor system requirements onto an appropriate assembly of algorithms, processors, sensors, and actuators. We have previously introduced the Multisensor Kernel System and Logical Sens...Multisensors; Knowledge systems; 3-D structure; Logical Sensors1987
179 PPL quick reference guide (CMOS)This work was supported in part by Defense Research Projects Agency under Contract Number DAAK1184K0017. All opinions, findings, conclusions or recommendations expressed in this document are those of the author(s) and do not necessarily reflect the view of DARPA.CMOS1987
180 A note on the Oslo algorithmThe 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 surface1987
181 Task defined grasp force solutionsForce Control for dextrous manipulation has been approached algebraically with a great deal of success, however, the computational burden created when such approaches are applied to grasps consisting of many contacts is prohibitive. This paper describes a procedure which restricts the complexity of ...grasp force; dextrous manipulation1988
182 Specification-driven design of custom hardware in HOPWe present a language "Hardware viewed as Objects and Processes" (HOP) for specifying the structure, behavior, and timing of hardware systems. HOP embodies a simple process model for lock-step synchronous processes. Processes may be described both as a black-box and as a collection of interacting s...HOP; hardware systems; Structure; Behavior; Timing; custom hardware1988
183 Fast structured design of VLSI circuitsWe believe that a structured, user-friendly, cost-effective tool for rapid implementation of VLSI circuits which encourages students to participate directly in research projects are the key components in digital integrated circuit (IC) education. In this paper, we introduce our VLSI education activ...VLSI circuits; Rapid implementation1988
184 An optimal, parallel discrete relaxation algorithm and architecture (Revised January 1988 and August 1989)A variety of problems in artificial intelligence, operations research, symbolic logic, pattern recognition and computer vision, and robot manipulation are special cases of the Consistent Labeling Problem (CLP). The Discrete Relaxation Algorithm (DRA) is an efficient computational technique to enfor...Consistent Labeling Problem; CLP; Discrete Relaxation Algorithm; DRA1988
185 Radix-16 signed-digit divisionFor use in the context of a linearly scalable arithmetic architecture supporting high/variable precision arithmetic operations (integer or fractional), a two-stage algorithm for fixed point, radix-16 signed-digit division is presented. The algorithm uses two limited precision radix-4 quotient digit ...Radix-16; linearly scalable; arithmetic architecture1988
186 Efficient depth estimation using trinocular stereoWe present recent advancements in our passive trinocular stereo system. These include a technique for calibrating and rectifying in a very efficient and simple manner the triplets of images taken for trinocular stereovision systems. After the rectification of images, epipolar lines are parallel to t...Trinocular stereo; Stereovision1988
187 Asymptotic near optimality of the bisection methodThe bisection method is shown to possess the nearly best rate of convergence for infinitely differentiable functions having zeros of arbitrary multiplicity. If the multiplicity of zeros is bounded, methods are known which have asymptotically at least quadratic rate of convergence.Bisection method1988
188 Building databases for the computer-based memorization systemThe Computer-Based Memorization System (CBMS) consists of eight games used by students to memorize groups of related facts that are stored in an associative network. The instructional design is built into the games. Designing and implementing associative networks for the CBMS is very different from...Computer-Based Memorization System; CBMS1988
189 Design and evaluation of the rollback chip: special purpose hardware for time warpThe Time Warp mechanism offers an elegant approach to attacking difficult clock synchronization problems that arise in applications such as parallel discrete event simulation. However, because Time Warp relies on a lookahead and rollback mechanism to achieve widespread exploitation of parallelism, t...Rollback chip; Time Warp mechanism; Clock synchronization; Parallel discrete event simulation1988
190 How to search for millions of queensThe n-queens problem is a classical combinatorial problem in artificial intelligence (AI) area. Since its simplicity and regular structure, this problem has widely been chosen as a testbed to develop and benchmark new AI search problem-solving strategies in the AI community. Due to its inherent com...Combinatorial problems; n-queens; Search algorithms1988
191 Refinement estimation of B-spline curves and surfacesAn algorithm for refinement estimation for B-spline curves is presented. The algorithm uses approximations to the curvature and arc length to decide how a curve should be refined. The algorithm can also be used to produce isoparametric curves or polygonal tessellations from a Bspline surface.B-spline; Curves; Surfaces; Algorithm; Curvature; Arc length; Isoparametric curves; Polygonal tessellations1988
192 An annotated bibligraphy of multisensor integrationIn this paper we give an annotated bibliography of the multisensor integration literature.Multisensor integration; Bibligraphy1988
193 HOP: a process model for synchronous hardware semantics, and experiments in process compositionWe present a language "Hardware viewed as Objects and Processes" (HOP) for specifying the structure, behavior, and timing of hardware systems. HOP embodies a simple process model for lock-step synchronous processes. An absproc specification written in HOP describes the externally observable behavior...HOP; Synchronous hardware semantics1988
194 HOP: a process model for synchronous hardware systemsModules in HOP are black-boxes that are understood and used only in terms of their interface. The interface consists of d a t a ports, events, and a protocol specification that uses events and asserts/queries values to / from ports. Events are realized as different combinations of control wires or...HOP; Process models; Synchronous hardware systems1988
195 CAD-based computer vision: the automatic generation of recognition stragtegiesThree-dimensional model-based computer vision uses geometric models of objects and sensed data to recognize objects in a scene. Likewise, Computer Aided Design (CAD) systems are used to interactively generate three-dimensional models during these fields. Recently, the unification of CAD and vision s...1988
196 Computing offsets and tool paths with Voronoi diagramsIn this paper we describe the use of Voronoi diagrams to generate offsets for planar regions bounded by circular arcs and line segments, and then use the generated offsets as tool paths for NC machining. Two methods are presented, each producing a different type of offset. One of them generates the ...Voronoi diagrams1989
197 Abstract semantics for functional constraint programmingA denotational semantics is given for a lazy functional language with monotonic side-effects arising from the unification of singly-bound logical variables. The semantics is based on a Scott-style information system, which elegantly captures the notion of "constraint additin" inherent in unificati...Abstract semantics1989
198 Cascade: a hardware alternative to bignumsThe 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 of ...Cascade hardware; Bignums; Precision arithmetic1989
199 Translating concurrent programs into delay-insensitive circuitsPrograms written in a subset of occam are automatically translated into delay-insensitive circuits using syntax-directed techniques. The resulting circuits are improved using semantics-preserving circuit-to-circuit transformations. Since each step of the translation process can be proven correct, th...1989
200 Constant scallop height tool path generationAn approach for the automatic generation of constant scallop height tool paths is presented. An example is shown generated from a B-spline model, although it can be used with many types of sculptured surfaces. The approach utilizes surface subdivision techniques and a new algorithm for tool path gen...Scallop height; Tool path generation; B-spline model1989
176 - 200 of 937