Tech Report Index By Number

CS-08-06: GestureBar: A Training-Free Approach to Disclosing\\ and Teaching Gestures
CS-08-05: Incentivizing Outsourced Computation
CS-08-01: Plan-based Complex Event Detection across Distributed Sources
CS-07-10: No-Regret Learning in Convex Games
CS-07-09: Length-Lex Open Constraints
CS-07-08: Transactional Boosting: A Methodology for Highly-Concurrent Transactional Objects
CS-07-07: Towards Fast Decentralized Construction of \\ Locality-Aware Overlay Networks
CS-07-06: XFlow: Internet-scale Distributed Stream Processing
CS-07-05: Adapting to a Stochastically Changing Environment: The Dynamic Multi-Armed Bandits Problem
CS-07-04: A Generative Discourse-New Model for Text Coherence
CS-07-03: Denoising Archival Films using a Learned Bayesian Model
CS-07-01: Towards Fast Decentralized Construction of Locality-Aware Overlay Networks
CS-06-15: Heuristics for the Deterministic Bidding Problem: Lessons from TAC Travel
CS-06-14: Learning Invariant Features Using Inertial Priors
CS-06-12: ASM Relational Transducer Security Policies
CS-06-10: Bounds for Regret-Matching Algorithms
CS-06-09: Randomized Filtering Algorithms
CS-06-08: HumanEva: Synchronized Video and Motion Capture Dataset for Evaluation of Articulated Human Motion
CS-06-07: Flexible, Secure and Private Point-based Trust Management
CS-06-06: A Cutting-Plane Algorithm for Learning from Ambiguous Examples
CS-06-05: Extensible Profile-driven Data Dissemination
CS-06-04: Towards Reasonability Properties for Access-Control Policy Languages with Extended XACML Analysis
CS-06-02: Length-Lex Ordering for Set CSPs
CS-06-01: Blackwell's Approachability Theorem: A Generalization in a Special Case
CS-05-16: Bid Determination in Simultaneous Auctions
CS-05-15: Parsing and Disfluency Modeling
CS-05-14: A Heightfield on an Isometric Grid
CS-05-13: Hierarchical Expectation Refinement for Learning Generative Perception Models
CS-05-12: Real-time Silhouette Intersection by Maintaining the Distribution of Occupancy
CS-05-11: Extensible Data-driven Classification of Robot Sensor Data
CS-05-10: Fluid Inking: Modeless Integration of Gestures with Inking
CS-05-09: Comparative Evaluation of Desktop and Cave Environments for Learning Hypercube Rotations
CS-05-08: Correlated Q-Learning
CS-05-07: A Direct Proof of the Existense of Correlated Equilibrium Policies in General-Sum Markov Games
CS-05-06: No False Positives: Window-aware Load Shedding for Data Streams
CS-05-05: The Soundness and Completeness of Margrave with Respect to a Subset of XACML
CS-05-04: Look-That-There: Exploiting Gaze in Virtual Reality Interactions
CS-05-03: Volume Rendering with Animation of Gulf Stream Currents
CS-05-02: A Comparison of a Cave and A Fish Tank VR system for Counting Biological Features in a Volume
CS-05-01: Generalized and Practical Role-Based Cascaded Delegation
CS-04-17: Aggregate Group Signature and Anonymous Delegation
CS-04-16: Customizable Presentations
CS-04-15: The Dense Estimation of Motion and Appearance in Layers
CS-04-14: The Orgins of the Turing Thesis Myth
CS-04-13: Window-aware Load Shedding for Data Streams
CS-04-12: Gaussian Process Classification for Segmenting and Annotating Sequences
CS-04-11: Fluid Inking: Using Punctuation to Allow Modeless Combination of Marking andGesturing
CS-04-10: SemCast: Semantic Multicast for Content-based Data Dissemination
CS-04-09: Varieties of Regret in Online Prediction
CS-04-08: The Design of the Borealis Stream Processing Engine
CS-04-07: Constraint-Based Combinators for Local Search
CS-04-06: Visualization of the interaction of multiple sclerosis lesions with adjacent white matter fibers using streamtubes and streamsurfaces
CS-04-05: High-Availability Algorithms for Distributed Stream Processing
CS-04-04: Evaluating and Tuning Motion Graphs for Character Animation
CS-04-03: Animation Sketching: An Approach to Accessible Animation
CS-04-02: Using Graphics Hardware to Accelerate Progressive Refinement Radiosity
CS-04-01: Scheduling Abstractions for Local Search
CS-03-27: CaveSculpture:\\ Creating sculpture from CavePaintings
CS-03-26: Using CavePainting to Create Scientific Visualizations
CS-03-25: Visualizing Vortices in Simulated Air Flow around Bat Wings during Flight
CS-03-24: SciVL: A Desciptive Language for 2D\\ Multivariate Scientific Visualization Synthesis
CS-03-23: Gaussian Process Classification for Segmenting and Annotating Sequences
CS-03-22: The Value of Consensus in Online Stochastic Scheduling
CS-03-21: Iterative Relaxations for Iterative Flattening in Cumulative Scheduling
CS-03-20: FrTime: Functional Reactive Programming in PLT Scheme
CS-03-19: Fast, Practical and Robust Shadows
CS-03-17: A Comparison of Stream-Oriented High-Availability Algorithms
CS-03-16: A Simple and Deterministic Competitive\\ Algorithm for Online Facility Location
CS-03-14: Detecting Features Through Concept Analysis
CS-03-11: Safe and Tight Linear Estimators for Global Optimization
CS-03-10: Dynamic Vehicle Routing with Stochastic Requests
CS-03-09: Efficient Data Storage in Large Nanoarrays
CS-03-08: Video-Based Tracking of 3D Human Motion Using Multiple Cameras
CS-03-07: A Constraint-Based Approach to Open Feature Verification
CS-03-06: Control Abstractions for Local Search
CS-03-05: Differential Geometry of Implicit Surfaces in 3-Space - A Primer
CS-03-04: On the Complexity of the Robust Spanning Tree Problem with Interval Data
CS-03-03: Load Shedding in a Data Stream Manager
CS-03-01: A Simulated Annealing Approach to the Traveling Tournament Problem
CS-02-18: Hierarchical Clustering of Streamtubes
CS-02-17: Directly Rendering Spectral Elements Using Texture Shaders
CS-02-16: Simulation and Visualization of Air Flow Around Bat Wings During Flight
CS-02-15: Visualization of Contact Areas and Ligament Paths in Joints
CS-02-14: Color Rapid Prototyping for Scientific Visualization: Diffusion Tensor MRI Visualization and Topographical Exploration of Mars
CS-02-13: A Semantics for Pointcuts and Advice in Higher-Order Languages
CS-02-12: Load Shedding in a Data Stream Manager
CS-02-08: Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers
CS-02-07: The Predictive Tracking Algorithm Testing Suite: A Tool for Developing and Analyzing Predictive Tracking Algorithms
CS-02-06: Precisely A(alpha)-stable One-Leg Multistep Methods
CS-02-05: A Simple Tabu Search for Warehouse Location
CS-02-04: Monitoring Streams - A New Class of Data Management Applications
CS-02-02: Shifted Slope-Comparison Multistep Formulas for ODEs
CS-02-01: Monitoring Streams - A New Class of DBMS Applications
CS-01-09: Index Structures and Algorithms for Efficient Profile Matching
CS-01-06: A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows
CS-01-05: A Constraint Satisfaction Approach for Enclosing Solutions to Parametric Ordinary Differential Equations
CS-01-04: Optimal Pruning in Parametric Differential Equations
CS-01-03: Immersive Hierarchical Visualization and Steering for Spectral/hp Element Methods
CS-01-02: Localizer++: An Open Library for local Search
CS-01-01: A Constraint Satisfaction Approach to Parametric Differential Equations
CS-00-08: Ordered Multicast and Distributed Swap
CS-00-07: OPL++: A Modeling Layer for Constraint Programming Libraries
CS-00-06: Parallel Adaptive Unstructured Computation
CS-00-03: Using Pyramids in Mixed Meshes - Point Placement and Basis Functions
CS-00-02: Linear Algebra in Very High-Dimension Vector Spaces: Algorithms and Data Structures for Implementing Exact and Approximate Solution Methods
CS-99-15: Whole-Hand and Speech Input in Virtual Environments
CS-99-14: Behavior and Expressiveness of Persistent Turing Machines
CS-99-13: Mathematical Models of Interactive Computing
CS-99-12: A Maximum-Entropy-Inspired Parser
CS-99-11: A Survey of Hand Posture and Gesture Recognition Techniques and Technology
CS-99-10: Parallel Refinement of Unstructured Meshes
CS-99-09: A Discussion of Cybersickness in Virtual Environments
CS-99-08: The Coach's Playbook
CS-99-07: An Experimental Study of SBH with Gapped Probes
CS-99-04: Turn-Regularity and Optimal Area Drawings of Orthogonal Representations
CS-99-03: Notes on methods based on maximum-likelihood estimation for learning the parameters of the mixture of Gaussians model
CS-99-02: Finding Parts in Very Large Corpora
CS-99-01: Introduction to Integer-Coordinate Crystalline Meshes
CS-98-11: Learning Models for Robot Navigation
CS-98-10: Improving Behavior Efficiency in Virtual Worlds
CS-98-09: Lightning: A System for Reusing Ray Trace Data for Fast Lighting of 3D Scenes
CS-98-07: Persistence as a Form of Interaction
CS-98-06: Getting Useful Gender Statistics from English Text
CS-98-05: New Techniques for Replay Debugging
CS-98-04: Edge-Based Best-First Chart Parsing
CS-98-03: Job-Shop Scheduling in Localizer
CS-98-02: Localizer
CS-97-18: A Case Study in Algorithm Engineering for Geometric Computing
CS-97-17: Analysis of Mouse Movement Time based on Varying Control to Display Ratios using Fitts' Law
CS-97-15: Broadcast Disks: Dissemination-based Data Management for Asymmetric Communication Environments
CS-97-14: Exploiting Structure for Planning and Control
CS-97-12: RDB: A System for Incremental Replay Debugging
CS-97-11: Checking the Convexity of Polytopes and the Planarity of Subdivisions
CS-97-10: Visualizing Geometric Algorithms Over the Web
CS-97-07: A Collaborative Environment for Algorithm Animation on the WWW
CS-97-06: Fast and Efficient Algorithms for Text and Video Compression
CS-97-05: Bounded Parameter Markov Decision Processes
CS-97-04: Learning Hidden Markov Models with Geometric Information
CS-97-03: Localizer: A Modeling Language for Local Search
CS-96-37: Expected-Frequency Interpolation
CS-96-34: A Constraint Satisfaction Approach to a Circuit Design Problem
CS-96-33: Efficient Approximation Algorithms for Some Semidefinite Programs
CS-96-31: The Dynamic Adaptation of Parallel Mesh-Based Computation
CS-96-29: Area Requirement of Gabriel Drawings
CS-96-28: Low Degree Algorithms for Computing and Checking Gabriel Graphs
CS-96-27: A Probabilistic Analysis of the Power of Arithmetic Filters
CS-96-25: Output-Sensitive Reporting of Disjoint Paths
CS-96-24: Drawing Directed Acyclic Graphs: An Experimental Study (Preliminary Version)
CS-96-23: Area Requirement of Visibility Representations of Trees
CS-96-22: The Rectangle of Influence Drawability Problem
CS-96-21: Proximity Drawings of Outerplanar Graphs (Preliminary Version)
CS-96-19: Runtime Performance Analysis of the M-to-N Scheduling Model
CS-96-18: Real-Time Thread Package
CS-96-17: Acting Uncertainty: Discrete Bayesian Models for Mobile-Robot Navigation
CS-96-16: Robust Proximity Queries in Implicit Voronoi Diagrams
CS-96-15: Hidden-Surfaces: Combining BSP Trees with Graph-Based Algorithms
CS-96-14: A Motion-Compensated Filter for Ultrasound Image Sequences
CS-96-13: Where to Draw the Line
CS-96-12: Figures of Merit for Best-First Probabilistic Chart Parsing
CS-96-11: Generalized Markov Decision Processes: Dynamic-programming and Reinforcement-learning Algorithms
CS-96-10: A Generalized Reinforcement-Learning Model: Convergence and Applications
CS-96-09: Algorithms for Sequential Decision Making
CS-96-08: Planning and Acting in Partially Observable Stochastic Domains
CS-96-07: Efficient Approximation Algorithms for Semidefinite Programs Arising from MAX CUT and COLORING
CS-96-06: A Near-linear-time Approximation Algorithm for Maximum-leaf Spanning Tree
CS-96-05: The Power of Local Optimizations: Approximation Algorithms for Maximun-leaf Spanning Tree (DRAFT)*
CS-96-04: Race-Condition Detection in Parallel Computation with Semaphores
CS-96-03: The Topological Structure of Asynchronous Computability
CS-96-02: Tree-bank Grammars
CS-95-37: The Fourier Transform - A Primer
CS-95-36: VTRACE and Communication Performance Analysis
CS-95-33: Helios: A Modeling Language for Nonlinear Constraint Solv ing and Global Optimization using Interval Analysis
CS-95-32: Helios: A Mathematical Modeling Language for Newton
CS-95-31: Configuration Management in Terms of Logical Structures
CS-95-30: Source to Source Optimizations of CLP($\Re_{Lin}$)
CS-95-29: A Statistical Syntactic Disambiguation Program and What it Learns
CS-95-28: Parsing with Context-Free Grammars and Word Statistics
CS-95-27: Dynamic and I/O-Efficient Algorithms for Computational Geometry and Graph Problems: Theoretical and Experimental Results
CS-95-26: On-Line Convex Planarity Testing
CS-95-25: Newton: Constraint Programming over Nonlinear Real Constraints
CS-95-24: Online Prediction Algorithms for Databases and Operating Systems
CS-95-23: Configuration Management with Logical Structures
CS-95-22: On the use of Asynchrony in achieving Extensibility and High Performance in an object Storage System
CS-95-21: Tutorial Notes: Models and Paradims of Interaction
CS-95-20: Exploiting Orthogonality in Three Dimensional Graphics for Visualizing Abstract Data
CS-95-19: Efficient dynamic-programming updates in partially observable Markov decision processes
CS-95-17: Processor-Time Tradeoffs under Bounded-Speed Message Propagation: Part I, Upper Boundes
CS-95-16: Replication in Spring: A New Subcontract
CS-95-15: OODB Indexing by Class-Division
CS-95-14: An Engine for the 3D Visualization of Program Information
CS-95-13: Fragments: A Mechanism for Low Cost Data Integration
CS-95-12: LSign Reordered
CS-95-10: Decomposition Techniques for Planning in Stochastic Domains
CS-95-09: A Model for Active Entities in Software Systems
CS-95-08: Collision Detection for Interactive Graphics Applications
CS-95-07: Experiments on the Practical I/O Efficiency of Geometric Algorithms: Distribution Sweep vs. Plane Sweep
CS-95-06: Practically Frameless Rendering
CS-95-05: The Virtual Tricorder
CS-95-04: Parallel and Dynamic Shortest-Path Algorithms for Sparse Graphs
CS-95-03: Approximate Queries and Representations for Large Data Sequences
CS-95-02: Redundancy Elimination with a Lexicographic Solved Form
CS-95-01: Solving Polynomial Systems Using a Branch and Prune Approach
CS-94-46: Optimal Upward Planarity Testing of Single-Source Digraphs
CS-94-45: Configuration Management in terms of Modules
CS-94-44: Predicting Real-Time Planner Preformance by Domain Characterization
CS-94-43: Broadcast Disks: Data Management for Asymmetric Communication Environments
CS-94-41: Time-Critical Planning and Scheduling Research at Brown University
CS-94-40: The Witness Algorithm: Solving Partially Observable Markov Decision Processes
CS-94-39: A Bibliography of Work Related to Reinforcement Learning
CS-94-38: CHIRON: Planning in an Open-Textured Domain
CS-94-36: Real-Time Optical Flow
CS-94-35: Deliberation Scheduling for Time-Critical Scheduling in Stochastic Domains
CS-94-34: External-Memory Graph Algorithms (extended abstract)
CS-94-32: Optimal Tracing and Replay for Debugging Message-Passing Parallel Programs
CS-94-31: Constraint Programming and Database Query Languages
CS-94-29: Efficient Parallelism vs Reliable Distribution: a Trade-off for Concurrent Computations
CS-94-28: Functional Programming Formalisms for OODB Methods
CS-94-27: Path Caching: A Technique for Optimal External Searching
CS-94-26: Functional Database Query Languages as Typed Lambda Calculi of Fixed Order
CS-94-25: An Analysis of the Core-ML Language: Expressive Power and Type Reconstruction
CS-94-24: Finite Model Theory in the Simply Typed Lambda Calculus
CS-94-23: Controlling Memory Access Concurrency in Efficient Fault-Tolerant Parallel Algorithms
CS-94-22: Storage Class Extensibility in the Brown Object Storage System
CS-94-21: Computer Literacy for Undergraduates: A Document-Engineering Framework
CS-94-20: Acting Optimally in Partially Observable Stochastic Domains
CS-94-19: Critical-Path-Based Message Logging for Incremental Replay of Message-Passing Programs
CS-94-18: CLP (Intervals) Revisited
CS-94-17: Cardinality Analysis of Prolog
CS-94-16: An Abstract Interpretation Framework for (almost) Full Prolog
CS-94-15: A Summmary of Network Performance Benchmarking of Sun 4/490File Servers
CS-94-14: Optimal Policies for Partially Observable Markov Decision Processes
CS-94-13: Localized Temporal Reasoning Using Subgoals and Abstraction
CS-94-12: Faster Shortest-Path Algorithms for Planar Graphs
CS-94-11: Optimal Tracing and Incremental Reexecution for Debugging Long-Running Programs
CS-94-10: On the Computational Complexity of Upward and Rectilinear Planarity Testing
CS-94-09: Indexing for Data Models with Constraints and Classes
CS-94-08: Combining Grammars For Improved Learning
CS-94-07: Context-Sensitive Statistics for Improved Grammatical Language Models
CS-94-06: Taggers for Parsers
CS-94-05: Compiling Object-Oriented Queries
CS-94-04: The Framework for EPOQ - an Extensible Object- Oriented Query Optimizer
CS-94-03: Optimal Shortest Path and Minimum-Link Path Queries Between Two Convex Polygons in the Presence of Obstacles
CS-93-59: Open Software: UNIX, DCE, and Competitors
CS-93-58: User-Defined Visual Languages for Querying Data
CS-93-57: Expressing Constraints for Data Display Specification: A Visual Approach
CS-93-56: Incorporating Update Rates into Today's Graphics Systems
CS-93-55: Planning Under Time Constraints in Stochastic Domains
CS-93-54: Direct Manipulation of Isosurfaces and Cutting Planes in Virtual Environments
CS-93-53: The Thread-Monitor Library: A System Monitoring Solaris-Threads Programs
CS-93-52: Type Analysis of Prolog Using Type Graphs
CS-93-51: Backtracking Without Trailing in CLP(${\Re}_{\rm Lin}$)
CS-93-50: Time-Critical Graphics
CS-93-49: A Randomized Linear-Time Algorithm for Finding Minimum Spanning Trees
CS-93-47: A Data Structure for Bicategories with Application to Speeding Up an Approximation Algorithm
CS-93-45: Extensible High-Performance Support for Persistence
CS-93-43: An Efficient Scheme for Dynamic Data Replication
CS-93-42: A Primal-Dual Approximation Algorithm for the Steiner Forest
CS-93-41: Steiner Trees and Beyond: Approximation Algorithms for Network Design
CS-93-40: Graphical Fisheye Views
CS-93-39: Stretching the Rubber Sheet: A Metaphor for Viewing Large Layouts on Small Screens
CS-93-38: An Object-Centered Approach to Designing Programming Environments
CS-93-37: Facilitating Software Maintenance by Automated Detection of Constraint Violations
CS-93-36: Feedforward and Recurrent Neural Networks and Genetic Programs for Stock and Time Series Forecasting
CS-93-35: A Linear-Processor Polylog-Time Algorithm for Shortest Paths in Planar Graphs
CS-93-33: Supporting Graphics Using Delegation and Multi-Methods
CS-93-32: Necessary and Sufficient Conditions for Consistent Global Snapshots
CS-93-31: Techniques for Handling Inference Complexity in Dynamic Belief Networks
CS-93-30: Bounds on the Max-Flow Min-Cut Ratio for Directed Multicommodity Flows
CS-93-29: Detecting Race Conditions in Parallel Programs That Use One Semaphore
CS-93-28: The Design and Analysis of Efficient Lossless Data Compression Systems
CS-93-27: Trace Size vs. Parallelism in Trace-and-Replay Debugging of Shared-Memory Programs
CS-93-26: Adaptive Message Logging for Incremental Replay of Message-Passing Programs
CS-93-25: Adaptive Independent Checkpointing for Reducing Rollback Propagation
CS-93-24: Exploiting Locality in Temporal Reasoning
CS-93-23: CCEL: The C++ Constraint Expression Language: An Annotated Reference Manual, Version 0.5
CS-93-22: LOG: Building 3D User Interface Widgets By Demonstration
CS-93-21: Indexing for Data Models with Constraints and Classes
CS-93-20: Horizons of Parallel Computation
CS-93-19: Limits on Heterogeneous Supercomputing
CS-93-18: Representing Software Systems in Multiple-View Development Environments
CS-93-17: Interacctions: Multidatabase Support for Planning Applications
CS-93-16: Extensible Query Processing in an Object-Oreinted Database
CS-93-15: Optimal Tracing and Replay for Debugging Shared-Memory Parallel Programs
CS-93-14: A Practical Constructive Scheme for Deterministic Shared-Memory Acess
CS-93-13: Conceptual and Software Support for Abstract Domain Design: Generic Structural Domain and Open Product
CS-93-12: Constraining the Structure and Style of Object-Oriented Programs
CS-93-10: Ordered Types in the Aqua Data Model
CS-93-09: The Aqua Data Model And Algebra
CS-93-08: Space-Time Tradeoffs in Memory Hierarchies
CS-93-07: Cone Trees in the UGA Graphics System: Suggestions for a More Robust Visualization Tool
CS-93-06: Database Query Languages Embedded in the Typed Lambda Calculus
CS-93-05: Abstract Interpretation of Prolog Based on OLDT Resolution
CS-93-04: Space-Time Bounds for Collision Detection
CS-93-03: FIELD Support for C++
CS-93-02: Design, Implementation, and Evaluation of the Constraint Language cc(FD)
CS-93-01: Mob --- A Parallel Heuristic for Graph-Embedding
CS-92-61: Reasoning about Time and Probability
CS-92-60: Open Software UNIX/OSF/UI, Etc.
CS-92-59: Supporting Reactive Planning Tasks on an Evolving Multidatabase
CS-92-58: Many Birds With One Stone: Multi-Objective Approximation Algorithms
CS-92-57: A Data Model and A Query Language for Object-Oreinted Databases
CS-92-56: A Data Model for Object-Oriented Databases
CS-92-55: Experience with Techniques for Refining Data Race Detection
CS-92-54: A Nearly best-possible approximation algorithm for node-weighted Steiner trees
CS-92-53: A Theory for Memory-Based Learning
CS-92-51: CCEL: A Metalanguage for C++
CS-92-50: Constraint Query Languages
CS-92-49: Groundness Analysis for Prolog: Implementation and Evaluation of the Domain Prop
CS-92-48: Minimizing the Input/Output Bottleneck
CS-92-47: On Spline Approximations for Bayesian Computations
CS-92-46: Efficient Rendering on Massively Parallel Architectures
CS-92-45: Combine and Conquer
CS-92-44: Blocking for External Graph Searching
CS-92-43: Scheduling and Packing in the Constraint Language cc(FD)
CS-92-42: Manipulating Screen Space with {\em StretchTools}: Visualizing Large Structures on Small Screens
CS-92-38: Optimal Deterministic Sorting in Parallel Memory Hierarchies
CS-92-37: Approximation Algorithms for Geometric Median Problems
CS-92-36: Dynamic Generation of Discrete Random Variates
CS-92-35: Generating Abstractions for Visualization
CS-92-34: A Framework for Dynamic Graph Drawing
CS-92-33: Method Schemas
CS-92-31: A Framework for Digital Topology
CS-92-30: When Cycles Collapse: A General Approximation Technique for Constrained Two-Connectivity Problems
CS-92-29: Approximations with Minimum Packing Constraint Violation
CS-92-28: A Simplified Technique for Hidded-Line Elimination in Terrains
CS-92-26: Package Routing in Transportation Networks with Fixed Vehicle Schedules: Formulation, Complexity Results and Approximation Algorithms
CS-92-25: A Universal Top-Down Fixpoint Algorithm
CS-92-24: A Linear Constraint Satisfaction Approach for Abductive Reasoning
CS-92-23: Fault-Tolerant and Efficient Parallel Computation
CS-92-22: A Systolic Array for the Sequence Alignment Problem
CS-92-21: Approximation Algorithms for Steiner Augmentations for Two-Connectivity
CS-92-20: Undecidable Boundedness Problem For Datalog Program
CS-92-19: Combine and Conquer
CS-92-18: Practical Implementations of Arithmetic Coding
CS-92-17: Analysis of Arithmetic Coding for Data Compression
CS-92-16: Two Experiments on Learning Probabilistic Dependency Grammars from Corpora
CS-92-15: A Divide-and-Conquer Approach to Shortest Paths in Planar Layered Digraphs
CS-92-14: A Formal Description of the Transportation Problem
CS-92-13: Register Allocation Using Control Trees
CS-92-12: Reexecution in Abstract Interpretation of Prolog
CS-92-11: A Note on Redundant Linear Constraints
CS-92-10: Interactive Animation of Fault-Tolerant Parallel Algorithms
CS-92-09: How to Write-All Efficiently Even with Contaminated Memory
CS-92-08: Optimal Deterministic Sorting on Parallel Disks
CS-92-07: A Unified Approach to Dynamic Point Location, Ray Shooting and Shortest Paths in Planar Maps
CS-92-06: Dynamization of the Trapezoid Method for Planar Point Location in Monotone Subdivisions
CS-92-05: Algorithms for Parallel Memory II: Hierarchical Multilevel Memories
CS-92-04: Algorithms for Parallel Memory I: Two-Level Memories
CS-92-03: A Linear Constraint Satisfaction Approach to Cyclicity
CS-92-02: Large-Scale Sorting in Uniform Memory Hierarchies
CS-92-01: UGA Software Standards
CS-91-67: Generic Abstract Interpretation Algorithms for Prolog: Two Optimization Techniques and Their Experimental Evaluation
CS-91-66: A Complexity-Theoretic Approach to Incremental Computation
CS-91-65: A Generic Arc Consistency Algorithm and Its Specializations
CS-91-64: InterActions: Multidatabase Support for Planning Applications
CS-91-63: The Whole Transaction Model for Heterogeneous Multidatabases
CS-91-62: Constraint Satifaction Using Constraint Logic Programming
CS-91-61: Graphical Fisheye Views of Graphs
CS-91-60: Network Design and Network Cut Dualities: Approximation Algorithms and Applications
CS-91-59: Combinatorial Optimization 1990: Lecture Notes
CS-91-58: Approximating Concurrent Flow with Uniform Demands and Capacities: An Implementation
CS-91-57: A Probabilistic Framework for Explanation
CS-91-56: A Parallel Randomized Approximation Scheme for Shortest Paths
CS-91-55: Experimental Evaluation of a Generic Abstract Interpretation Algorithm for Prolog
CS-91-54: Parallel Algorithms with Processor Failures and Delays
CS-91-53: On Coefficients of Powers of Functions
CS-91-52: Support for Maintaining Object-Oriented Programs
CS-91-51: Automatic Detection of C{\tt ++}Programming Errors: Initial Thoughts on a {\sf lint{\tt ++}}
CS-91-50: A System for Multiparadigm Development of Software Systems
CS-91-48: Parallel Algorithms for Chordal Graphs
CS-91-47: New Methods for Lossless Image Compression Using Arithmetic Coding
CS-91-46: Optimal Prefetching via Data Compression
CS-91-45: Practical Implementations of Arithmetic Coding
CS-91-44: A Probabilistic Analysis of Marker-Passing Techniques for Plan Recognition
CS-91-43: Faster Approximation Algorithms for the Unit-Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts
CS-91-42: Generating Function Algorithms for Symbolic Computation
CS-91-41: Object-Oriented Query Optimization: What's the Problem?
CS-91-40: A Simplified Technique for Hidden-Line Elimination in Terrains
CS-91-39: A Closed-Form Evaluation for Datalog Queries with Integer-Order Constraints
CS-91-38: An Architecture for Query Processing in Persistent Object Stores
CS-91-37: A Framework for Automatic Algorithm Animation
CS-91-36: Efficient Parallel Algorithms on Restartable Fail-stop Processors
CS-91-35: Parallel VLSI Synthesis
CS-91-34: Programmable Systolic Arrays
CS-91-32: On the Use of Annotations for Integrating the Source in a Program Development Environment
CS-91-31: Trends in Epistemology
CS-91-30: UGA: A Unified Graphics Architecture
CS-91-29: Saddle Point Techniques in Asymptotic Coding Theory
CS-91-28: An Operating System Development Environment
CS-91-27: Conflict, Queueing, and Deadlocks in Cooperative Transaction Hierarchies
CS-91-26: RelType: Relaxed Typing for Intelligent Hypermedia Representations
CS-91-25: Transaction Control For Cooperative Applications
CS-91-24: Dynamic Algorithms in Computational Geometry
CS-91-23: Efficient Handling of Disequations in CLP Over Linear Rational Arithmetic
CS-91-22: Constant Propagation with Conditional Branches
CS-91-21: Efficiently Computing Static Single Assignment Form and the Control Dependence Graph
CS-91-20: Greed Sort: An Optimal External Sorting Algorithm for Multiple Disks
CS-91-19: Approximating Fill in Solving Sparse Linear Systems
CS-91-18: Ordering Problems Approximated: Register Sufficiency, Single-Processor Scheduling and Interval Graph
CS-91-17: An Approximate Max-flow Min-cut Relation for Multicommodity Flow and its Applications
CS-91-16: Multi-Dimensional Input Devices and Interaction Techniques for a Modeler-Animator
CS-91-15: Fido: A Cache That Learns To Fetch
CS-91-14: A Structured Neural Network Approach to Robust Parsing
CS-91-13: Cost-Based Abduction and Linear Constraint Satisfaction
CS-91-12: Probabilistic Abduction for Plan Recognition
CS-91-11: A New Admissible Heuristic for Minimal-Cost Proofs
CS-91-10: An Object-Oriented Framework for the Integration of Interactive Animation Techniques
CS-91-09: Paradigms of Interpretation and Modeling
CS-91-08: Planning in an Open-Textured Domain
CS-91-07: Parallel Graph-Embedding and the Mob Heuristic
CS-91-06: Solving Time-Dependent Problems: A Decision-Theoretic Approach to Planning in Dynamic Environments
CS-91-05: Constraint Logic Programming
CS-91-04: The Lark Project: Design of a Highly Parallel Programmable Logic Array
CS-91-03: Analysis of Arithmetic Coding for Data Compression
CS-91-02: Fully Dynamic Techniques for Reachability in Planar sT-graphs
CS-91-01: Perspectives on Object-Oriented Design
CS-90-37: CI2 --- A Logic for Plural Representation
CS-90-36: Efficient Arc Consistency Algorithm for a Class of CSP Problems
CS-90-35: Dynamic Expression Trees
CS-90-34: A Probabilistic Approach to Language Understanding
CS-90-33: Sum Amusements: A Case Study from the Analysis of Algorithms
CS-90-32: When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
CS-90-31: Constraint Query Languages
CS-90-30: A Denotational Semantics of Inheritance and its Correctness
CS-90-29: Predictive Caching
CS-90-28: Computer Science Curriculum for the Year 2000
CS-90-27: ObServer: A Storage System for Object-Oriented Applications
CS-90-26: Unification and ML Type Reconstruction
CS-90-25: A Generic Abstract Interpretation Algorithm and its Complexity Analysis (extended abstract)
CS-90-24: The Cardinality Operator: A New Logical Connective for Constraint Logic Programming
CS-90-23: Operational Semantics of Constraint Logic Programming over Finite Domains
CS-90-22: Algorithms for Parallel Memory II: Hierarchical Multilevel Memories
CS-90-21: Algorithms for Parallel Memory I: Two-Level Memories
CS-90-20: Towards Megaprogramming
CS-90-19: A Method for the Specification and Parsing of Visual Languages
CS-90-18: Resolving Ambiguity in Nonmonotonic Reasoning
CS-90-17: A Logic-Programming Approach to All-Paths Parsing
CS-90-16: Parallelism, Preprocessing, and Reachability: A Hybrid Algorithm for Directed Graphs
CS-90-15: An Approach to Uncertainty in VLSI Design
CS-90-14: On Irrelevance and Partial Assignments to Belief Networks
CS-90-13: A Probabilistic Approach to Text Understanding
CS-90-12: VLSI Placement Using Uncertain Costs
CS-90-11: Classifying and Detecting Plan-Based Misconceptions for Robust Plans
CS-90-10: Area Requirement and Symmetry Display of Planar-Upward Drawings
CS-90-09: Applications of Pyramid Structures to Multiscale Optical Flow
CS-90-08: A Preference-Based Approach to Inheritance
CS-90-07: Constructive Solid Geometry for Triangulated Polyhedra
CS-90-06: Analysis of Pointers and Structures
CS-90-05: Fault-Tolerant Computing on Trees
CS-90-04: Greed Sort: An Optimal External Sorting Algorithm for Multiple Disks
CS-90-03: Cooperative Transaction Hierarchies
CS-90-02: Probabilistic Semantics for Cost-Based Abduction
CS-90-01: Complexity Issues in Learning by Neural Nets
CS-89-51: Interacting with the FIELD Environment
CS-89-50: Output-Sensitive Generation of the Perspective View of Isothetic Parallelepipeds
CS-89-49: Achieving Optimal CRCW PRAM Fault-Tolerance
CS-89-48: Conceptual Evolution of Object-Oriented Programming
CS-89-47: Efficient Point Location in a Convex Spatial Cell Complex
CS-89-46: The Representation of Noun Phrases In Logical Form
CS-89-45: Parallel Transitive Closure and Point Location in Planar Structures
CS-89-44: Decision-Theoretic Control of Inference for Time-Critical Applications
CS-89-43: Improved Methods for Modeling Uncertainty in RC Timing Analysis
CS-89-42: Clovers: The Dynamic Behavior of Types and Instances
CS-89-41: Heuristics for Parallel Graph-Partitioning
CS-89-40: Polymorphic Unification of ML Typing
CS-89-39: Elements of Relational Database Theory
CS-89-38: Modeling Uncertainty in RC Timing Analysis
CS-89-37: An Annotated Compendium of Naturally Occurring Plan-Based Misconceptions
CS-89-36: Constant Propagation with Conditional Branches
CS-89-35: Efficient Parallel Algorithms Can Be Made Robust
CS-89-34: The Brown Workstation Environment: A User Interface Design Toolkit
CS-89-33: A Denotational Semantics of Inheritance
CS-89-32: The B-SYS Programmable Systolic Array
CS-89-31: On-Line Planarity Testing
CS-89-30: TANGO: A Framework and System for Algorithm Animation
CS-89-29: Matcher Neural Networks
CS-89-28: Dynamic Planar Graph Embedding
CS-89-27: Coping with Uncertainty in Map Learning
CS-89-26: Object Identity As A Query Language Primitive
CS-89-25: Plan-Related Negation in Story Understanding
CS-89-24: Dynamic Planar Point Location with Optimal Query Time
CS-89-23: A Logic for Emotions: A Basis for Reasoning About Commonsense Psychological Knowledge
CS-89-22: General Methods for the Analysis of the Maximum Size of Data Structures
CS-89-21: A Data Structure for Arc Insertion and Regular Path Finding
CS-89-20: Optimal Parallel Algorithms for Transitive Closure and Point Location in Planar Structures
CS-89-19: A Query Algebra for Object-Oriented Databases
CS-89-18: I/O Overhead and Parallel VLSI Architectures for Lattice Computations
CS-89-17: Implementing a Learning System for Subsumption Architectures
CS-89-16: Classifying and Detecting Plan-Based Misconceptions
CS-89-15: Towards a Unified Method of Sharing in Object-Oriented Programming
CS-89-14: Skeptical Inheritance: Computing the Intersection of Credulous Extensions
CS-89-13: Investigations of Model-Preference Defaults
CS-89-12: Motivated Action Theory: A Formal Theory of Causal Reasoning
CS-89-11: An Efficient Algorithm for Incremental Data-Flow Analysis
CS-89-10: Representations of Graphs on a Cylinder
CS-89-09: Algorithms for Drawing Graphs: An Annotated Bibliography
CS-89-08: An Architecture for Programmable Systolic Arrays
CS-89-07: Simulating Switch-Level Networks with Uncertain Transistor Strengths and Node Sizes
CS-89-06: Parsing in a Visual Language Environment
CS-89-05: Representing Visual Programs with Object-Graphs
CS-89-04: A Model for Reasoning About Persistence and Causation
CS-89-03: Solving Time-Dependent Planning Problems
CS-89-02: Creating Graphical Languages in Garden
CS-89-01: Annotating Software With Arbitrary Performance Characteristics
CS-88-22: BAGS: The Brown Animation Generation System
CS-88-21: Parallel Constraint Graph Generation
CS-88-20: The TANGO Algorithm Animation System
CS-88-19: A Threads Tutorial - Fortran Version
CS-88-18: Integration Mechanisms in the FIELD Environment
CS-88-17: Learning in Parallel
CS-88-16: An Efficient Method of Computing Static Single Assignment Form
CS-88-15: A Shared View of Sharing: The Treaty of Orlando
CS-88-14: Supercomputing with VLSI

Page Owner: John Bazik

Last Modified: Tue Jul 8 08:47:00 2008

Inside Search:

Tech Report Index By Number