Browsing CS Technical Reports by Title
Now showing items 1346-1365 of 1772
-
Rational Mixed-Integer and Polyhedral Union Minimization Models
(University of Wisconsin-Madison Department of Computer Sciences, 1978)The minimization model concept is defined, and its applications to nonlinear optimization are described. Necessary conditions and sufficient conditions are established for functions to have minimization models of certain ... -
RD-OPT: An Efficient Algorithm for Optimizing DCT Quantization Tables
(University of Wisconsin-Madison Department of Computer Sciences, 1994) -
The RD-Tree: An Index Structure for Sets
(University of Wisconsin-Madison Department of Computer Sciences, 1994) -
RDBMS Index Support for Sparse Data Sets
(University of Wisconsin-Madison Department of Computer Sciences, 2006)Maintenance costs and storage overheads incurred by indexes often limit the number of indexes created per table in an RDBMS. For sparse data, where a table may have hundreds of attributes, indexing only a few attributes ... -
Real-time GPU-Based Voxelization and Applications
(University of Wisconsin-Madison Department of Computer Sciences, 2011)This paper proposes a new real-time voxelization algorithm using newly available GPU functionalities. Our voxelization algorithm is efficient and able to real-time transform a highly complex surface-represented scene into ... -
Real-Time, Model-Based Tracking of Three-Dimensional Objects
(University of Wisconsin-Madison Department of Computer Sciences, 1988) -
Realistic Analysis of Parallel Dynamic Programming Algorithms
(University of Wisconsin-Madison Department of Computer Sciences, 1992) -
Recency-Abstraction for Heap-Allocated Storage
(University of Wisconsin-Madison Department of Computer Sciences, 2005)In this paper, we present an abstraction for heap-allocated storage, called the recency-abstraction, that allows abstract-interpretation algorithms to recover non-trivial information for heap-allocated data objects. As an ... -
Recognition and Spatial Organization of Objects in Natural Scenes
(University of Wisconsin-Madison Department of Computer Sciences, 1978)A computer vision model for recognizing objects in real world scenes and locating them in three-dimensional space is described. It is intended for applications which require navigation through an environment and interaction ... -
Recognition Cones and Some Test Results: The Imminent Arrival of Well-Structured Parallel-Serial Computers, Positions, and Positions on Positions
(University of Wisconsin-Madison Department of Computer Sciences, 1977) -
Recognition Cones That Perceive and Describe Scenes that Move and Change Over Time
(University of Wisconsin-Madison Department of Computer Sciences, 1975)This paper describes a "recognition cone" model of the perceptual system that can input and process a continuously changing image of a scene (e.g. the successive frames of a movie or television camera). It recognizes and ... -
Recognition Cones: A Neuronal Architecture for Perception and Learning
(University of Wisconsin-Madison Department of Computer Sciences, 1987) -
Recognizing Faces from Head Rotation
(University of Wisconsin-Madison Department of Computer Sciences, 2004)A new approach for recognizing human faces is presented that uses video sequences of natural, uncontrolled head rotations to capture face motion and dynamic appearance characteristics. Unlike traditional methods for face ... -
Recognizing, Understanding, Deciding Whether to Obey, and Executing Commands
(University of Wisconsin-Madison Department of Computer Sciences, 1973)This paper examines a programmed model (called DECIDER-1) that, 1)recognizes scenes of things, among which are a)objects, and b)words that form commands (or questions or other types of statements), 2)recognizes the import ... -
Recovering Feature and Observer Position by Projected Error Refinement
(University of Wisconsin-Madison Department of Computer Sciences, 1998) -
Recovering Shape By Purposive Viewpoint Adjustment
(University of Wisconsin-Madison Department of Computer Sciences, 1991) -
Recovery Architectures for Multiprocessor Database Machines
(University of Wisconsin-Madison Department of Computer Sciences, 1985) -
Recovery of Variables and Heap Structure in x86 Executables
(University of Wisconsin-Madison Department of Computer Sciences, 2005)This paper addresses two problems that arise when analyzing executables: (1) recovering variable-like quantities in the absence of symbol-table and debugging information, and (2) recovering useful information about objects ... -
Recursive Properties of Abstract Complexity Classes
(University of Wisconsin-Madison Department of Computer Sciences, 1970)It is proven that complexity classes of abstract measures of complexity need not be recursively enumerable, However, the complement of each class is shown to be r.e. The results are extended to complexity classes determined ... -
Reducing Coherence Overheads with Multi-line Invalidation (MLI) Messages
(2013-05-31)Most multiprocessors employ coherent caches despite the overheads of doing so. As future processors will be multi-processors with elaborate cache hierarchies, the overheads of cache coherence will be an important area for ...