Browsing CS Technical Reports by Title
Now showing items 349-368 of 1766
-
Data Caching Tradeoffs in Client-Server DBMS Architectures
(University of Wisconsin-Madison Department of Computer Sciences, 1991) -
Data Clustering for Very Large Datasets Plus Applications
(University of Wisconsin-Madison Department of Computer Sciences, 1997) -
Data Memory Alternatives for Multiscalar Processors
(University of Wisconsin-Madison Department of Computer Sciences, 1996) -
A Data Model and Query Language for EXODUS
(University of Wisconsin-Madison Department of Computer Sciences, 1987) -
Data Modeling in DeLAB
(University of Wisconsin-Madison Department of Computer Sciences, 1988) -
Data-Driven Group Animation
(University of Wisconsin-Madison Department of Computer Sciences, 2005)We introduce Data-Driven Groups (DDGs), an animation technique for groups of discrete agents, such as flocks, herds, or small crowds. DDGs are a natural extension of human motion graphs to groups. They create motion by ... -
Data-Flow Database Machines
(University of Wisconsin-Madison Department of Computer Sciences, 1981) -
A Database Approach for Managing VLSI Design Data
(University of Wisconsin-Madison Department of Computer Sciences, 1981) -
Database Concurrency Control and Recovery in Local Broadcast Networks
(University of Wisconsin-Madison Department of Computer Sciences, 1981) -
Database Concurrency Control in Local Broadcast Networks
(University of Wisconsin-Madison Department of Computer Sciences, 1980) -
Database Machines: An Idea Whose Time Has Passed? A Critique of the Future of Database Machines
(University of Wisconsin-Madison Department of Computer Sciences, 1983) -
Database Support for Matching: Limitations and Opportunities
(University of Wisconsin-Madison Department of Computer Sciences, 2005)A match join of R and S with predicate theta is a subset of the theta join of R and S such that each tuple of R and S contributes to at most one result tuple. Match joins and their generalizations arise in many scenarios, ... -
Dataflow Query Processing Using Multiprocessor Hash-Partitioned Algorithms
(University of Wisconsin-Madison Department of Computer Sciences, 1986) -
Datamation 2001: A Sorting Odyssey
(University of Wisconsin-Madison Department of Computer Sciences, 2002) -
DataScalar Architectures and the SPSD Execution Model
(University of Wisconsin-Madison Department of Computer Sciences, 1996) -
DBMSs On Modern Processors: Where does time go?
(University of Wisconsin-Madison Department of Computer Sciences, 1999) -
Decision Problems for w-Automata
(University of Wisconsin-Madison Department of Computer Sciences, 1968) -
A Decision Procedure for Detecting Atomicity Violations for Communicating Processes with Locks
(University of Wisconsin-Madison Department of Computer Sciences, 2009)We present a new decision procedure for detecting property violations in pushdown models for concurrent programs that use lock-based synchronization, where each thread's lock operations are properly nested (a la ... -
Decision Tree Construction Via Linear Programming
(University of Wisconsin-Madison Department of Computer Sciences, 1992) -
Declarative, Temporal, and Practical Programming with Capabilities
(2013-02-26)New operating systems, such as the Capsicum capability system, allow a programmer to write an application that satisfies strong security properties by invoking security- specific system calls at a few key points in the ...