SearchBrowse

close this section of the libraryftp://ftp.cs.brown.edu (228)
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/92/cs92-24.ps.Z, 19940217
A Linear Constraint Satisfaction Approach for Abductive Reasoning Eugene Santos Jr. Department of Computer Science Brown University Providence, Rhode Island 02912 CS-92-24 April 1992 A Linear Constraint Satisfaction Approach for Abductive Reasoning1 Eugene Santos Jr. Ph.D. Dissertation Department of
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/92/cs92-19.ps.Z, 19940217
Combine and Conquer Robert F. Cohen and Roberto Tamassia Department of Computer Science Brown University Providence, Rhode Island 02912 CS-92-19 April 1992 Combine and Conquer Robert F. Cohen Roberto Tamassia Department of Computer Science Brown University Providence, Rhode Island 02912{1910
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/93/cs93-13.ps.Z, 19940217
Conceptual and Software Support for Abstract Domain Design: Generic Structural Domain and Open Product A. Cortesi1 B. Le Charlier2 P. Van Hentenryck3 Technical Report No. CS-93-13 April 1993 1Brown University Box 1910, Providence, RI 02912 2University of Namur 21 rue grandgagnage B-5000 Namur (Belgium)
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/93/cs93-38.ps.Z, 19940217
An Object-Centered Approach to Designing Programming Environments Yi-Jing Lin and Steven P. Reiss Department of Computer Science Brown University Providence, Rhode Island 02912 CS-93-38 September 1993 An Object-Centered Approach to Designing Programming Environments Yi-Jing Lin and Steven P. Reiss
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/92/cs92-07.ps.Z, 19940217
A Unified Approach to Dynamic Point Location, Ray Shooting and Shortest Paths in Planar Maps Yi-Jen Chiang, Franco P. Preparata and Roberto Tamassia Department of Computer Science Brown University Providence, Rhode Island 02912 CS-92-07 January 1992 A Unified Approach to Dynamic Point Location, Ray
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/93/cs93-14.ps.Z, 19940217
A Practical Constructive Scheme for Deterministic Shared-Memory Access A. Pietracaprina and F.P. Preparata Department of Computer Science Brown University Providence, Rhode Island 02912 CS-93-14 April 1993 A Practical Constructive Scheme for Deterministic Shared-Memory Access A. Pietracaprinayz and F.P.
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/93/cs93-51.ps.Z, 19940217
Backtracking without Trailing in CLP(
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/91/cs91-46.ps.Z, 19940217
Optimal Prefetching via Data Compression Jeffrey Scott Vitter and P. Krishnan Department of Computer Science Brown University Providence, Rhode Island 02912 CS-91-46 July 1991 Optimal Prefetching via Data Compression Jeffrey Scott Vitter Dept. of Computer Science Brown University Providence, R. I.
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/93/cs93-17.ps.Z, 19940217
Interactions: Multidatabase Support for Planning Applications Marian H. Nodine Department of Computer Science Brown University Providence, Rhode Island 02912 CS-93-17 May 1993 Interactions: Multidatabase Support for Planning Applications Marian H. Nodine Brown University Providence, RI 02912 May 13,
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/92/cs92-15.ps.Z, 19940217
A Divide and Conquer approach to Shortest Paths in Planar Layered Digraphs S. Sairam, Roberto Tamassia, and Jeffrey Scott Vitter Department of Computer Science Brown University Providence, Rhode Island 02912 CS-92-15 March 1992 A Divide and Conquer approach to Shortest Paths in Planar Layered Digraphs
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/92/cs92-01.ps.Z, 19940217
UGA Software Standards Matthias M. Wloka, Nate Huang, and D. Brookshire Conner Department of Computer Science Brown University Providence, Rhode Island 02912 CS-92-01 January 1992 UGA Software Standards Matthias M. Wlokay Nate Huangy D. Brookshire Connery January 13, 1992 c 1991 Brown University
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/93/cs93-03.ps.Z, 19940217
FIELD Support for C++ Steven P. Reiss and Scott Meyers Department of Computer Science Brown University Providence, Rhode Island 02912 CS-93-03 Febuary 1993 FIELD Support for C++y Steven P. Reiss and Scott Meyers Department of Computer Science Brown University, Box 1910 Providence, RI 02912.
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/93/cs93-05.ps.Z, 19940217
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/92/cs92-38.ps.Z, 19940217
Optimal Deterministic Sorting in Parallel Memory Hierarchies Mark H. Nodine and Jeffrey Scott Vitter Department of Computer Science Brown University Providence, Rhode Island 02912 CS-92-38 August 1992 Optimal Deterministic Sorting in Parallel Memory Hierarchies Mark H. Nodine and Jeffrey Scott Vitter
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/92/cs92-46.ps.Z, 19940217
Efficient Rendering on Massively Parallel Architectures Matthew Nicholas Pappas, Oren J. Tversky and D. Brookshire Conner Department of Computer Science Brown University Providence, Rhode Island 02912 CS-92-46 October 1992 Efficient Rendering On Massively Parallel Architectures Matthew Nicholas Pappas
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/92/cs92-53.ps.Z, 19940217
A Theory for Memory-Based Learning Jyh-Han Lin and Jeffrey Scott Vitter Department of Computer Science Brown University Providence, Rhode Island 02912 CS-92-53 November 1992 A Theory for Memory-Based Learning Jyh-Han Lin 1 Motorola Inc. Communications Systems Lab. Applied Research Paging and Wireless
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/93/cs93-16.ps.Z, 19940217
Extensible Query Processing in an Object-Oriented Database Gail Anne Mitchell Department of Computer Science Brown University Providence, Rhode Island 02912 CS-93-16 May 1993 Extensible Query Processing in an Object-Oriented Database y by Gail Anne Mitchell B. A., Cedar Crest College, 1972 M. S., The
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/92/cs92-60.ps.Z, 19940217
Open Software - UNIX/OSF/UI,Etc. Thomas W. Doeppner Jr. Department of Computer Science Brown University Providence, Rhode Island 02912 CS-92-60 December 1992 Open Software UNIX/OSF/UI, Etc. Thomas W. Doeppner Jr. Department of Computer Science Brown University Providence, RI 02912 1910 USA We discuss
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/92/cs92-61.ps.Z, 19940217
Reasoning about Time and Probability Keiji Kanazawa Department of Computer Science Brown University Providence, Rhode Island 02912 CS-92-61 May 1992 Reasoning about Time and Probability by Keiji Kanazawa B. A., Bennington College, 1985 Sc. M., Brown University, 1988 Thesis Submitted in partial
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/92/cs92-21.ps.Z, 19940217
Approximation Algorithms for Steiner Augmentations for Two-Connectivity R. Ravi Department of Computer Science Brown University Providence, Rhode Island 02912 CS-92-21 April 1992 Approximation algorithms for Steiner augmentations for two-connectivity R. Ravi Brown University
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/93/cs93-15.ps.Z, 19940217
Optimal Tracing and Replay for Debuging Shared-Memory Parallel Programs Robert H.B. Netzer Department of Computer Science Brown University Providence, Rhode Island 02912 CS-93-15 September 1993 Appears in the 3rdACM/ONR Workshop on Parallel and Distributed Debugging, San Diego, CA, May 1993 Optimal
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/92/cs92-50.ps.Z, 19940217
Constraint Query Languages Paris C. Kanellakis1 Gabriel M. Kuper2 Peter Revesz3 Technical Report No. CS-92-50 October 1992 1Brown University Box 1910, Providence, RI 02912 2IBM T.J. Watson Research Center Yorktown Heights, NY 3Brown University Box 1910, Providence, RI 02912 CONSTRAINT QUERY LANGUAGES
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/93/cs93-42.ps.Z, 19940217
A primal-dual approximation algorithm for the Steiner forest problem R. Ravi Department of Computer Science Brown University Providence, Rhode Island 02912 CS-93-42 September 1993 A primal-dual approximation algorithm for the Steiner forest problem R. Ravi
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/92/cs92-51.ps.Z, 19940217
CCEL : A Metalanguage for C++ Carolyn K. Duby, Scott Meyers and Steven P. Reiss Department of Computer Science Brown University Providence, Rhode Island 02912 CS-92-51 October 1992 CCEL : A Metalanguage for C++ Carolyn K. Duby Scott Meyers Steven P. Reiss ckd@cs.brown.edu sdm@cs.brown.edu
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/93/cs93-56.ps.Z, 19940217
Incorporating Update Rates into Today's Graphics Systems Matthias M. Wloka Department of Computer Science Brown University Providence, Rhode Island 02912 CS-93-56 December 1993 Incorporating Update Rates into Today's Graphics Systems Matthias M. Wloka CS Department Brown University Providence, RI 02912
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/93/cs93-37.ps.Z, 19940217
Facilitating Software Maintenance by Automated Detection of Constraint Violations Anir Chowdhury and Scott Meyers Department of Computer Science Brown University Providence, Rhode Island 02912 CS-93-37 September 1993 1 Facilitating Software Maintenance by Automated Detection of Constraint Violations
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/93/cs93-28.ps.Z, 19940217
The Design and Analysis of Efficient Lossless Data Compression Systems Paul Glor Howard Department of Computer Science Brown University Providence, Rhode Island 02912 CS-93-28 June 1993 The Design and Analysis of Efficient Lossless Data Compression Systems Paul Glor Howard Brown University Department of
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/93/cs93-12.ps.Z, 19940217
Constraining the Structure and Style of Object-Oriented Programs Scott Meyers1 Carolyn K. Duby2 Steven P. Reiss3 Technical Report No. CS-93-12 April 1993 1Brown University Box 1910, Providence, RI 02912 2Cadre Technologies, Inc. 222 Richmond Street,Providence,RI 02903 3Brown University Box 1910,
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/92/cs92-08.ps.Z, 19940217
Optimal Deterministic Sorting on Parallel Disks Mark H. Nodine and Jeffrey Scott Vitter Department of Computer Science Brown University Providence, Rhode Island 02912 CS-92-08 August 1992 Optimal Deterministic Sorting on Parallel Disks Mark H. Nodine and Jeffrey Scott Vitter Dept. of Computer Science
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/93/cs93-50.ps.Z, 19940217
Dissertation Proposal: Time-Critical Graphics Matthias M. Wloka Department of Computer Science Brown University Providence, Rhode Island 02912 CS-93-50 November 1993 Dissertation Proposal: Time-Critical Graphics Matthias M. Wloka CS Department Brown University Providence, R.I. 02912-1910 E-mail:
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/92/cs92-31.ps.Z, 19940217
A Framework For Digital Topology Eladio Dominguez 1 Angel Frances 2 Alberto Marguez 3 Technical Report No. CS-92-31 June 1992 1 Universidad de Zaragoza 50009 Zaragoza Sapin 2 Universidad de Zaragoza 50009 Zaragoza Spain 3 Brown University Computer Science Box 1910, Providence, RI 02912 1 A FRAMEWORK FOR
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/93/cs93-45.ps.Z, 19940217
Extensible High Performance Support for Persistence David E. Langworthy Department of Computer Science Brown University Providence, Rhode Island 02912 CS-93-45 September 1993 ObServer2: Extensible High Performance Support for Persistence Ph.D. Thesis Proposal David E. Langworthy July 25, 1993
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/92/cs92-36.ps.Z, 19940217
Dynamic Generation of Discrete Random Variates Jeffrey Scott Vitter and Wen-Chun Ni Department of Computer Science Brown University Providence, Rhode Island 02912 CS-92-36 August 1992 Dynamic Generation of Discrete Random Variates Jeffrey Scott Vitter and Wen-Chun Ni y Department of Computer Science
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/91/cs91-51.ps.Z, 19940217
Automatic Detection of C++ Programming Errors: Initial Thoughts on a lint++ Scott Meyers and Moises Lejter Department of Computer Science Brown University Providence, Rhode Island 02912 CS-91-51 August 1991 Automatic Detection of C++ Programming Errors: Initial Thoughts on a lint++ Scott Meyers and
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/92/cs92-06.ps.Z, 19940217
Dynamization of the Trapezoid Method for Planar Point Location in Monotone Subdivisions Yi-Jen Chiang and Roberto Tamassia Department of Computer Science Brown University Providence, Rhode Island 02912 CS-92-06 January 1992 Dynamization of the Trapezoid Method for Planar Point Location in Monotone
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/92/cs92-56.ps.Z, 19940217
A Data Model for Object-Oreinted Databases Manojit Sarkar and Steven P. Reiss Department of Computer Science Brown University Providence, Rhode Island 02912 CS-92-56 December 1992 A Data Model for Object-Oriented Databases Manojit Sarkar Steven P. Reiss Department of Computer Science Brown University
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/93/cs93-30.ps.Z, 19940217
Bounds on the Max-Flow Min-Cut Ratio for Directed Multicommodity Flows Philip N. Klein Serge A. Plotkin Satish Rao and Eva Tardos Department of Computer Science Brown University Providence, Rhode Island 02912 CS-93-30 September 1993 Bounds on the Max-Flow Min-Cut Ratio for Directed Multicommodity Flows
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/93/cs93-47.ps.Z, 19940217
A data structure for bicategories with application to speeding up an approximation algorithm Philip N. Klein Department of Computer Science Brown University Providence, Rhode Island 02912 CS-93-47 November 1993 A data structure for bicategories, with application to speeding up an approximation algorithm
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/92/cs92-59.ps.Z, 19940217
Supporting Reactive Planning Tasks On An Evolving Multidatabase Marian H. Nodine and Stanley B. Zdonik Department of Computer Science Brown University Providence, Rhode Island 02912 CS-92-59 December 1992 Supporting Reactive Planning Tasks on an Evolving Multidatabase Marian H. Nodine and Stanley B.
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/91/cs91-30.ps.Z, 19940217
UGA: A Unified Graphics Architecture Philip M. Hubbard, Matthias M. Wloka, and Robert C. Zeleznik Department of Computer Science Brown University Providence, Rhode Island 02912 CS-91-30 June 1991 UGA: A Unified Graphics Architecture1 Philip M. Hubbard Matthias M. Wloka Robert C. Zeleznik November 11,
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/93/cs93-49.ps.Z, 19940217
A Randomized Linear-Time Algorithm for Finding Minimum Spanning Trees Philip N. Klein1 Robert E. Tarjan2 Technical Report No. CS-93-49 November, 1993 1Brown University,Computer Science Department Box 1910, Providence, RI 02912 2Department of Computer Science Princeton University,Princeton NJ A
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/92/cs92-04.ps.Z, 19940217
Algorithms for Parallel Memory I: Two-Level Memories Jeffrey Scott Vitter1 Elizabeth A.M. Shriver2 Technical Report No. CS-92-04 August 1992 1Department of Computer Science, Box 1910, Brown University, Providence, RI 02912 2Courant Institute New York University, New York, 10012 Algorithms for Parallel
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/92/cs92-44.ps.Z, 19940217
Blocking for External Graph Searching Mark H. Nodine1 Michael T. Goodrich2 Jeffrey Scott Vitter3 Technical Report No. CS-92-44 September 1992 1Motorola Cambridge Research Center, One Kendall Square, Building 200, Cambridge, MA 02139 2Department of Computer Science, The Johns Hopkins University,
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/93/cs93-01.ps.Z, 19940217
Mob - A Parallel Heuristic For Graph-Embedding John E. Savage1 Markus G. Wloka2 Technical Report No. CS-93-01 January 1993 1Brown University Box 1910, Providence, RI 02912 2Motorola, Inc. SSDT MD EL, 510, 2100 E. Elliot Road, Tempe, AZ 85284 Mob { A Parallel Heuristic for Graph-Embedding y z x John E.
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/93/cs93-53.ps.Z, 19940217
The Thread-Monitor Library: A System for Monitoring Solaris-Threads Programs Thomas W. Doeppner Jr. Department of Computer Science Brown University Providence, Rhode Island 02912 CS-93-53 November 1993 The Thread-Monitor Library A System for Monitoring Solaris-Threads Programs* Thomas W. Doeppner Jr.
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/92/cs92-14.ps.Z, 19940217
A Formal Description of the Transportation Problem Thomas Dean and Lloyd Greenwald Department of Computer Science Brown University Providence, Rhode Island 02912 CS-92-14 March 1992 A Formal Description of the Transportation Problem Thomas Dean Lloyd Greenwald Department of Computer Science Brown
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/93/cs93-19.ps.Z, 19940217
Limits on Heterogeneous Supercomputing John E. Savage Department of Computer Science Brown University Providence, Rhode Island 02912 CS-93-19 June 1993 Limits on Heterogeneous Supercomputingy John E. Savage Brown University Department of Computer Science, Box 1910 Providence, Rhode Island 02912 Phone:
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/94/cs94-05.ps.Z, 19940217
Compiling Object-Oriented Queries Theodore W. Leung Department of Computer Science Brown University Providence, Rhode Island 02912 CS-94-05 Febuary 1994 Compiling Object-Oriented Queries A Thesis Proposal Theodore W. Leung Department of Computer Science Brown University Providence, RI 02912-1910
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/93/cs93-55.ps.Z, 19940217
Planning Under Time Constraints in Stochastic Domains Thomas Dean Leslie Pack Kaelbling Jak Kirman and Ann Nicholson Department of Computer Science Brown University Providence, Rhode Island 02912 CS-93-55 December 1993 Planning Under Time Constraints in Stochastic Domains Thomas Dean, Leslie Pack
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/93/cs93-02.ps.Z, 19940217
Design,Implementations,and Evaluation of the Constraint Language cc(FD) Pascal Van Hentenryck1 Vijay Saraswat2 Yves Deville3 Technical Report No. CS-93-02 January 1993 1Brown University Box 1910, Providence, RI 02912 2Xerox Palo alto Research Center 3333 Coyote Hill Road, Plao Alto, CA 94304 3Universite
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/93/cs93-58.ps.Z, 19940217
User-Defined Visual Languages for Querying Data Isabel F. Cruz Department of Computer Science Brown University Providence, Rhode Island 02912 CS-93-58 December 1993 User-Defined Visual Languages for Querying Data Isabel F. Cruz Department of Computer Science Brown University Providence, RI 02912-1910
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/92/cs92-02.ps.Z, 19940217
Large-Scale Sorting in Uniform Memory Hierarchies Jeffrey Scott Vitter1 Mark H. Nodine2 Technical Report No. CS-92-02 January 1992 1Department of Computer Science, Box 1910, Brown University, Providence, RI 02912 2Motorola Cambridge Research Center, One Kendall Square, Building 200, Cambridge, MA 02139
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/93/cs93-09.ps.Z, 19940217
The Aqua Data Model And Algebra Theodore W. Leung1 Gail Mitchell2 Bharathi Subramanian3 Bennet Vance4 Scott L. Vandenberg5 Stanley B. Zdonik6 Technical Report No. CS-93-09 March 1993 1Brown University Box 1910, Providence, RI 02912 2brown University Box 1910, Providence, RI 02912 3Brown University Box
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/93/cs93-07.ps.Z, 19940217
Cone Trees in the UGA Graphics System: Suggestions of a more Robust Visualization Tool Oren J. Tversky Scott S. Snibbe and Robert Zeleznik Department of Computer Science Brown University Providence, Rhode Island 02912 CS-93-07 Febuary 1993 Cone Trees in the UGA Graphics System: Suggestions for a more
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/93/cs93-31.ps.Z, 19940217
Techniques for Handling Complexity in Dynamic Belief Networks Ann Nicholson and Stuart Russell Department of Computer Science Brown University Providence, Rhode Island 02912 CS-93-31 July 1993 Techniques for handling inference complexity in Dynamic Belief Networks Ann Nicholson Department of Computer
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/92/cs92-55.ps.Z, 19940217
Experience with Techniques for Refining Data Race Detection Robert H.B.Netzer and Barton P. Miller Department of Computer Science Brown University Providence, Rhode Island 02912 CS-92-55 November 1992 Experience with Techniques for Re ning Data Race Detection Robert H. B. Netzer Barton P.Miller Dept. of
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/91/cs91-38.ps.Z, 19940217
An Architecture for Query Processing in Persistent Object Stores Gail Mitchell1 Stanley B. Zdonik2 Umeshwar Dayal3 Technical Report No. CS-91-38 June 1991 1Brown University, Department of Computer Science Box 1910, Providence, RI 02912 2Brown University, Department of Computer Science Box 1910,
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/93/cs93-21.ps.Z, 19940217
Indexing for Data Models with Constraints and Classes Paris C. Kanellakis Sridhar Ramaswamy Darren E. Vengroff and Jeffrey S. Vitter Department of Computer Science Brown University Providence, Rhode Island 02912 CS-93-21 May 1993 Indexing for Data Models with Constraints and Classes (Extended Abstract)
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/92/cs92-48.ps.Z, 19940217
Minimizing the Input/Output Bottleneck Mark Howard Nodine Department of Computer Science Brown University Providence, Rhode Island 02912 CS-92-48 October 1992 Minimizing the Input/Output Bottleneck by Mark Howard Nodine B. S., Tulane University, 1978 B. A., Tulane University, 1978 S. M., Massachusetts
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/92/cs92-37.ps.Z, 19940217
Approximation Algorithms for Geometric Median Problems Jyh-Han Lin1 Jeffrey Scott Vitter2 Technical Report No. CS-92-37 August 1992 1Motorola, Inc., Paging and Telepoint Systems Lab, 1500 N.W. 22nd Avenue, Boynton Beach, FL 33426-8292 2Department of Computer Science, Box 1910, Brown University,
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/92/cs92-58.ps.Z, 19940217
Many Birds With One Stone: Multi-Objective Approximation Algorithms R. Ravi1 M.V.Marathe2 S.S. Ravi3 D.J. Rosenkrantz4 H.B. Hunt III5 Technical Report No. CS-92-58 December 1992 1Brown University Box 1910, Providence, RI 02912 2University at Albany-Suny NY 12222 3University at Albany-Suny NY 12222
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/91/cs91-06.ps.Z, 19940217
Solving Time-Dependent Problems: A Decision-Theoretic Approach to Planning in Dynamic Environments by Mark Boddy Thesis Submitted in partial fulfillment of the requirements for the Degree of Doctor of Philosophy in the Department of Computer Science at Brown University. May 1991 c Copyright 1991 by Mark
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/92/cs92-45.ps.Z, 19940217
Combine and Conquer Robert F. Cohen Ph.D. Dissertation Department of Computer Science Brown University Providence, Rhode Island 02912 CS-92-45 October 1992 Combine and Conquer by Robert F. Cohen A. B., Brandeis University, 1981 M. S., Boston University, 1988 Sc. M., Brown University, 1990 Thesis
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/93/cs93-20.ps.Z, 19940217
Horizons of Parallel Computation Gianfranco Bilardi and Franco P. Preparata Department of Computer Science Brown University Providence, Rhode Island 02912 CS-93-20 May 1993 Horizons of Parallel Computation Gianfranco Bilardiyand Franco P. Preparataz May 28, 1993
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/89/cs89-19.ps.Z, 19940217
A Query Algebra for Object-Oriented Databases Gail M. Shaw and Stanley B. Zdonik Department of Computer Science Brown University Providence, Rhode Island 02912 CS-89-19 March 1989 A Query Algebra for Object-Oriented Databases Gail M. Shaw Stanley B. Zdonik Department of Computer Science Brown University
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/93/cs93-04.ps.Z, 19940217
Space-Time Bounds for Collision Detection Philip M. Hubbard Department of Computer Science Brown University Providence, Rhode Island 02912 CS-93-04 Febuary 1993 Space-Time Bounds for Collision Detection Philip M. Hubbard Department of Computer Science Box 1910, Brown University Providence, RI 02912
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/93/cs93-26.ps.Z, 19940217
Adaptive Message Logging for Incremental Replay of Message-Passing Programs Robert H.B. Netzer and Jian Xu Department of Computer Science Brown University Providence, Rhode Island 02912 CS-93-26 September 1993 Appears in Supercomputing 93, Portland, OR, November 1993 Adaptive Message Logging for
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/93/cs93-39.ps.Z, 19940217
Stretching the Rubber Sheet: A Metaphor for Viewing Large Layouts on Small Screens Manojit Sarkar, Scott S. Snibbe, Oren Tversky, and Steven P. Reiss Department of Computer Science Brown University Providence, Rhode Island 02912 CS-93-39 September 1993 Stretching the Rubber Sheet: A Metaphor for Viewing
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/92/cs92-54.ps.Z, 19940217
A nearly best-possible approximation algorithm for node-weighted Steiner trees Philip Klein R. Ravi Department of Computer Science Brown University Providence, Rhode Island 02912 CS-92-54 September 1993 A nearly best-possible approximation algorithm for node-weighted Steiner trees Philip Klein R. Raviy
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/93/cs93-24.ps.Z, 19940217
Exploiting Locality in Temporal Reasoning Shieu-Hong Lin and Thomas Dean Department of Computer Science Brown University Providence, Rhode Island 02912 CS-93-24 June 1993 Exploiting Locality in Temporal Reasoning Shieu-Hong Lin Thomas Dean1 Department of Computer Science Brown University, Providence, RI
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/93/cs93-22.ps.Z, 19940217
LOG: Building 3D User Interface Widgets by Demonstration Larisa Matejic Department of Computer Science Brown University Providence, Rhode Island 02912 CS-93-22 May 1993 LOG: Building 3D User Interface Widgets by Demonstration Larisa Matejicy May 20, 1993 c 1993 Brown University Computer Graphics Group.
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/92/cs92-20.ps.Z, 19940217
Undecidable Boundedness Problem for Datalog Programs Gerd G. Hillebrand1 Paris C. Kanellakis2 Harry G. Mairson3 Moshe y. Vardi4 Technical Report No. CS-92-20 April 1992 1Brown University, Department of Computer Science Box 1910, Providence, RI 02912 2Brown University, Department of Computer Science Box
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/93/cs93-54.ps.Z, 19940217
Direct Manipulation of Isosurfaces and Cutting Planes in Virtual Environments Tom Meyer1 Al Globus2 Technical Report No. CS-93-54 December, 1993 1Brown University,Computer Science Department Box 1910, Providence, RI 02912 2Computer Science Corporation,MS T045-1 NASA Ames Research Center,Moffett Field CA
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/93/cs93-35.ps.Z, 19940217
A linear-processor polylog-time algorithm for shortest paths in planar graphs Philip N. Klein and Sairam Subramanian Department of Computer Science Brown University Providence, Rhode Island 02912 CS-93-35 September 1993 A linear-processor polylog-time algorithm for shortest paths in planar graphs Philip
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/92/cs92-29.ps.Z, 19940217
Approximations with Minimum Packing Constraint Violation Jyh-Han Lin and Jeffrey Scott Vitter Department of Computer Science Brown University Providence, Rhode Island 02912 CS-92-29 June 1992 ffl-Approximations with Minimum Packing Constraint Violation 1 Jyh-Han Lin 2 Motorola Inc. Paging and Telepoint
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/92/cs92-33.ps.Z, 19940217
Method Schemas Serge Abiteboul1 Paris Kanellakis2 Sridhar Ramaswamy3 Emmanuel Waller4 Technical Report No. CS-92-33 July 1992 1INRIA,78153 Le Chesnay Cedex, France 2Brown University Computer Science Box 1910, Providence, RI 02912 3Brown University Computer Science Box 1910, Providence, RI 02912
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/91/cs91-41.ps.Z, 19940217
Object-Oriented Query Optimization: What's the Problem Gail Mitchell1 Stanley B. Zdonik2 Umeshwar Dayal3 Technical Report No. CS-91-41 June 1991 1Brown University, Department of Computer Science Box 1910, Providence, RI 02912 2Brown University, Department of Computer Science Box 1910, Providence, RI
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/93/cs93-41.ps.Z, 19940217
Steiner Trees and Beyond: Approximation Algorithms for Network Design Ramamurthy Ravi Department of Computer Science Brown University Providence, Rhode Island 02912 CS-93-41 September 1993 Steiner Trees and Beyond: Approximation Algorithms for Network Design by Ramamurthy Ravi B. Tech., Computer Science
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/93/cs93-33.ps.Z, 19940217
Supporting Graphics Using Delegation and Multi-Methods D. Brookshire Conner Department of Computer Science Brown University Providence, Rhode Island 02912 CS-93-33 September 1993 Supporting Graphics Using Delegation and Multi-Methods D. Brookshire Conner Department of Computer Science Brown University
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/92/cs92-05.ps.Z, 19940217
Algorithms for Parallel Memory II: Hierarchical Multilevel Memories Jeffrey Scott Vitter1 Elizabeth A.M. Shriver2 Technical Report No. CS-92-05 August 1992 1Department of Computer Science, Box 1910, Brown University, Providence, RI 02912 2Courant Institute New York University, New York, 10012 Algorithms
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/93/cs93-40.ps.Z, 19940217
Graphical Fisheye Views Manojit Sarkar and Marc H. Brown Department of Computer Science Brown University Providence, Rhode Island 02912 CS-93-40 September 1993 Graphical Fisheye Views Manojit Sarkar and Marc H. Brown March 17, 1992 March 23, 1993 (Revised) About the Title-Page Images The images on the
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/93/cs93-25.ps.Z, 19940217
Adaptive Independent Checkpointing for Reducing Rollback Propagation Jian Xu and Robert H.B. Netzer Department of Computer Science Brown University Providence, Rhode Island 02912 CS-93-25 September 1993 Appears in the 5th IEEE Symp. on Parallel and Distributed Processing, December 1993, Dallas, TX
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/93/cs93-23.ps.Z, 19940217
CCEL: The C++ Constraint Expression Language An Annotated Reference Manual Version 0.5 Yueh-hong Lin and Scott Meyers Department of Computer Science Brown University Providence, Rhode Island 02912 CS-93-23 May 1993 CCEL: The C++ Constraint Expression Language An Annotated Reference Manual Version 0.5
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/92/cs92-43.ps.Z, 19940217
Scheduling and Packing In The Constraint Language cc(FD) Pascal Van Hentenryck Department of Computer Science Brown University Providence, Rhode Island 02912 CS-92-43 September 1992 Scheduling and Packing In The Constraint Language cc(FD) Pascal Van Hentenryck Brown University, Box 1910, Providence, RI
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/92/cs92-03.ps.Z, 19940217
A Linear Constraint Satisfaction Approach to Cyclicity Eugene Santos Jr. Department of Computer Science Brown University Providence, Rhode Island 02912 CS-92-03 January 1992 A Linear Constraint Satisfaction Approach to Cyclicity1 Eugene Santos Jr. Department of Computer Science Box 1910, Brown
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/91/cs91-52.ps.Z, 19940217
Support for Maintaining Object-Oriented Programs Moises Lejter Scott Meyers and Steven P. Reiss Department of Computer Science Brown University Providence, Rhode Island 02912 CS-91-52 January 1992 Support for Maintaining Object-Oriented Programs Moises Lejter and Scott Meyers and Steven P. Reiss
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/92/cs92-23.ps.Z, 19940217
Fault-Tolerant and Efficient Parallel Computation Alexander Allister Shvartsman Department of Computer Science Brown University Providence, Rhode Island 02912 CS-92-23 April 1992 Fault-Tolerant and Efficient Parallel Computation by Alexander Allister Shvartsman B. S., Computer Science, Stevens Institute
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/92/cs92-42.ps.Z, 19940217
Manipulating Screen Space with StretchTools: Visualizing Large Structure on Small Screen Manojit Sarkar and Steven P. Reiss Department of Computer Science Brown University Providence, Rhode Island 02912 CS-92-42 September 1992 Manipulating Screen Space with StretchTools : Visualizing Large Structure on
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/92/cs92-47.ps.Z, 19940217
On Spline Approximations for Bayesian Computations Eugene Santos Jr. Department of Computer Science Brown University Providence, Rhode Island 02912 CS-92-47 October 1992 On Spline Approximations for Bayesian Computations1 Eugene Santos Jr. Department of Computer Science Box 1910, Brown University
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/92/cs92-26.ps.Z, 19940217
Package Routing in Tranportation Networks with fixed Vehicle Schedules: Formulation, ComplexityResults and Approximation Algorithms Department of Computer Science Brown University Providence, Rhode Island 02912 CS-92-26 June 1992 Package Routing in Transportation Networks with Fixed Vehicle Schedules:
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/91/cs91-66.ps.Z, 19940217
A Complexity Theoretic Approach to Incremental Computation S. Sairam Jeffrey S. Vitter Roberto Tamassia Department of Computer Science Brown University Providence, Rhode Island 02912{1910 Technical Report No. CS-91-66 November 1991 A Complexity Theoretic Approach to Incremental Computation S. Sairam,
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/91/cs91-44.ps.Z, 19940217
A Probabilistic Analysis of Marker-Passing Techniques for Plan Recognition Glenn Carroll and Eugene Charniak Department of Computer Science Brown University Providence, Rhode Island 02912 CS-91-44 June 1991 A Probabilistic Analysis of Marker-Passing Techniques for Plan-Recognition Glenn Carroll Eugene
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/93/cs93-18.ps.Z, 19940217
Representing Software Systems in Multiple-View Development Enivironments Scott Douglas Meyers Department of Computer Science Brown University Providence, Rhode Island 02912 CS-93-18 May 1993 Representing Software Systems in Multiple-View Development Environments Scott Douglas Meyers B.S., Stanford
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/91/cs91-37.ps.Z, 19940217
A Framework for Automatic Algorithm Animation Yi-Jing Lin Department of Computer Science Brown University Providence, Rhode Island 02912 CS-91-37 May 1991 1 A Framework for Automatic Algorithm Animation Yi-Jing Lin Department of Computer Science Brown University Providence, RI 02912 May, 1991
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/93/cs93-36.ps.Z, 19940217
Feedforward and Recurrent Neural Networks and Genetic Programs for Stock Market and Time Series Forecasting Peter C. McCluskey Department of Computer Science Brown University Providence, Rhode Island 02912 CS-93-36 September 1993 Feedforward and Recurrent Neural Networks and Genetic Programs for Stock
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/93/cs93-10.ps.Z, 19940217
Ordered Types in the Aqua Data Model Bharathi Subramanian1 Stanley B. Zdonik2 Theodore W. Leung3 Scott L. Vandenberg4 Technical Report No. CS-93-10 March 1993 1Brown University Box 1910, Providence, RI 02912 2brown University Box 1910, Providence, RI 02912 3Brown University Box 1910, Provodence, RI
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/92/cs92-57.ps.Z, 19940217
A Data Model and A Query Language for Object-Oriented Databases Manojit Sarkar and Steven P. Reiss Department of Computer Science Brown University Providence, Rhode Island 02912 CS-92-57 December 1992 A Data Model and A Query Language for Object-Oriented Databases Manojit Sarkar Steven P. Reiss
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/93/cs93-57.ps.Z, 19940217
Expressing Constraints for Data Display Specification: A Visual Approach Isabel F. Cruz Department of Computer Science Brown University Providence, Rhode Island 02912 CS-93-57 December 1993 Expressing Constraints for Data Display Specification: A Visual Approach Isabel F. Cruzy Department of Computer
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/93/cs93-43.ps.Z, 19940217
An Efficient Scheme for Dynamic Data Replication Swarup Acharya and Stanley B. Zdonik Department of Computer Science Brown University Providence, Rhode Island 02912 CS-93-43 September 1993 An Efficient Scheme for Dynamic Data Replication Swarup Acharya Stanley B. Zdonik Dept. of Computer Science Brown
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/93/cs93-32.ps.Z, 19940217
Necessary and Sufficient Conditions for Consistent Global Snapshots Robert H.B. Netzer and Jian Xu Department of Computer Science Brown University Providence, Rhode Island 02912 CS-93-32 September 1993 July 5, 1993 Necessary and Suf cient Conditions for Consistent Global Snapshots Robert H. B. Netzer
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/90/cs90-07.ps.Z, 19940217
Constructive Solid Geometry for Triangulated Polyhedra Philip M. Hubbard Department of Computer Science Brown University Providence, Rhode Island 02912 CS-90-07 September 1, 1990 Constructive Solid Geometry for Triangulated Polyhedra Philip M. Hubbard Department of Computer Science Brown University
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/92/cs92-16.ps.Z, 19940217
Two Experiments on Learning Probabilistic Dependency Grammars from Corpora Glenn Carroll and Eugene Charniak Department of Computer Science Brown University Providence, Rhode Island 02912 CS-92-16 March 1992 Two Experiments on Learning Probabilistic Dependency Grammars from Corpora Glenn Carroll and
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/92/cs92-34.ps.Z, 19940217
A Framework for Dynamic Graph Drawing R .F. Cohen1 G. Di Battista2 R. Tamassia,3 I. G. Tollis4 Technical Report No. CS-92-34 August 1992 1Brown University Computer Science Box 1910, Providence, RI 02912 2Dipartimento di Informatica e Sistemistica Universita di Roma La Sapienza, Via Salaria, 113 - Rome,
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/92/cs92-49.ps.Z, 19940217
Groundness Analysis for Prolog: Implementation and Evaluation of the Domain Prop Baudouin Le Charlier1 Pascal Van Hentenryck2 Technical Report No. CS-92-49 October 1992 1University of Namur, 21 rue Grandgagnage, B-5000 Namur (Belgium) 2Brown University Box 1910, Providence, RI 02912 Groundness Analysis
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/92/cs92-25.ps.Z, 19940217
A Universal Top-Down Fixpoint Algorithm Baudouin Le Charlier1 Pascal Van Hentenryck2 Technical Report No. CS-92-25 May 1992 1University of Namur 21 rue Grandgagnage, B-5000 Namur Belgium 2Brown University Computer Science Box 1910, Providence, RI 02912 A Universal Top-Down Fixpoint Algorithm Baudouin Le
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/92/cs92-35.ps.Z, 19940217
Generating Abstractions for Visualization Steven P. Reiss and Manojit Sarkar Department of Computer Science Brown University Providence, Rhode Island 02912 CS-92-35 August 1992 1 Generating Abstractions for Visualization1 Steven P. Reiss and Manojit Sarkar Department of Computer Science, Brown
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/92/cs92-30.ps.Z, 19940217
When cycles collapse: A general approximation technique for constrained two-connectivity problems R. Ravi and Philip Klein Department of Computer Science Brown University Providence, Rhode Island 02912 CS-92-30 June 1992 When cycles collapse: A general approximation technique for constrained
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/90/cs90-35.ps.Z, 19940217
Dynamic Expression Trees Robert F. Cohen and Roberto Tamassia Department of Computer Science Brown University Providence, Rhode Island 02912 CS-90-35 December 1990 Dynamic Expression Trees Robert F. Cohen Roberto Tamassia Department of Computer Science Brown University Providence, Rhode Island
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/93/cs93-52.ps.Z, 19940217
Type Analysis of Prolog Using Type Graphs P. Van Hentenryck1 A. Cortesi2 B. Le Charlier3 Technical Report No. CS-93-52 November, 1993 1Brown University Box 1910, Providence, RI 02912 2University of Venezia Via Torino 155, 1-30170 Mestre-VE (Italy) 3University of Mamur 21 rue Grandgagnage, B-5000 Numar
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/92/cs92-22.ps.Z, 19940217
A Systolic Array for the Sequence Alignment Problem Dzung T. Hoang Department of Computer Science Brown University Providence, Rhode Island 02912 CS-92-22 April 1992 A Systolic Array for the Sequence Alignment Problem Dzung T. Hoang Department of Computer Science Brown University Providence, RI 02912
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/94/cs94-06.ps.Z, 19940222
Taggers for Parsers Eugene Charniak Glenn Carroll John Adcock Anthony Cassandra Yoshihiko Gotoh Jeremy Katz Michael Littman and John McCann Department of Computer Science Brown University Providence, Rhode Island 02912 CS-94-06 Febuary 1994 Taggers for Parsers1 Eugene Charniak,* Glenn Carroll,* John
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/94/cs94-07.ps.Z, 19940223
Context-Sensitive Statistics for Improved Grammatical Language Models Eugene Charniak and Glenn Carroll Department of Computer Science Brown University Providence, Rhode Island 02912 CS-94-07 Febuary 1994 Context-Sensitive Statistics for Improved Grammatical Language Models Eugene Charniak Glenn Carroll
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/94/cs94-08.ps.Z, 19940223
Combining Grammars For Improved Learning Glenn Carroll, and Eugene Charniak Department of Computer Science Brown University Providence, Rhode Island 02912 CS-94-08 Febuary 1994 Combining Grammars for Improved Learning Glenn Carroll Eugene Charniak Department of Computer Science Brown University
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/94/cs94-10.ps.Z, 19940302
On the Computational Complexity of Upward and Rectilinear Planarity Testing Ashim Garg and Roberto Tamassia Department of Computer Science Brown University Providence, Rhode Island 02912 CS-94-10 March 1994 On the Computational Complexity of Upward and Rectilinear Planarity Testing (Extended Abstract)
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/93/cs93-08.ps.Z, 19940309
Space-Time Tradeoffs in Memory Hierarchies John E. Savage Department of Computer Science Brown University Providence, Rhode Island 02912 CS-93-08 Febuary 1993 Space-Time Tradeoffs in Memory Hierarchies y John E. Savage Brown University Department of Computer Science, Box 1910 Providence, Rhode Island
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/94/cs94-11.ps.Z, 19940323
Optimal Tracing and Incremental Reexecution for Debugging Long-Running Programs Robert H.B. Netzer and Mark H. Weaver Department of Computer Science Brown University Providence, Rhode Island 02912 CS-94-11 March 1994 Appears in the SIGPLAN Conference on Programming Language Design and Implementation,
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/94/cs94-12.ps.Z, 19940324
Faster Shortest-Path Algorithms for Planar Graphs Philip Klein1 Satish Rao2 Monika Rauch3 Sairam Subramanian4 Technical Report No. CS-94-12 March, 1994 1Brown University,Computer Science Department Box 1910, Providence, RI 02912 2NEC Research Institute 3Cornell University 4Brown University, Computer
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/94/cs94-15.ps.Z, 19940412
A Summery of Network Performance Benchmarking of Sun 4/490 File Servers Technical Staff Department of Computer Science Brown University Providence, Rhode Island 02912 CS-94-15 April 1994 1 A Summary of Network Performance Benchmarking of Sun 4/490 File Servers Technical Staff Computer Science
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/94/cs94-16.ps.Z, 19940412
An Abstract Interpretation Framework for (almost) Full Prolog B. Le Charlier1 S.Rossi2 P. Van Hentenryck3 Technical Report No. CS-94-16 April, 1994 1University of Namur 21 rue Grandgagnage,B-5000 Namur(Belgium) 2University of Padova 7 via Belzoni I-35131 Padova (Italy) 3Brown University, Computer
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/94/cs94-17.ps.Z, 19940414
Cardinality Analysis of Prolog C. Braem1 B. Le Charlier2 S. Modart3 P. Van Hentenryck4 Technical Report No. CS-94-17 April, 1994 1University of Namur 21 rue Grandgagnage, B-5000 Namur(Belgium) 2University of Namur 21 rue Grandgagnage,B-5000 Namur(Belgium) 3University of Namur 21 rue Grandgagnage, B-5000
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/94/cs94-18.ps.Z, 19940421
CLP(Intervals) Revisited F. Benhamon1 D. Mc Allester2 P. Van Hentenryck3 Technical Report No. CS-94-18 April, 1994 1Universite Aix-Marselle II 163, Av. de Luminy, 13288 Marselle, France 2MIT, 421 Technology Square Cambridge, MA 3Brown University, COmputer Science Department Box 1910, Providence, RI
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/94/cs94-22.ps.Z, 19940512
Storage Class Extensibility in the Brown Object Storage System David E. Langwoprthy and Stanley B. Zdonik Department of Computer Science Brown University Providence, Rhode Island 02912 CS-94-22 May 1994 Storage Class Extensibility in the Brown Object Storage System David E. Langworthy Stanley B. Zdonik
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/94/cs94-23.ps.Z, 19940512
Controlling Memory Access Concurrency in Efficient Fault-Tolerant Parallel Algorithms Paris C. Kanellakis Dimitrios Michailidis and Alex A. Shvartsman Department of Computer Science Brown University Providence, Rhode Island 02912 CS-94-23 May 1994 Controlling Memory Access Concurrency in Efficient
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/94/cs94-25.ps.Z, 19940516
An Analysis of the Core-ML Language: Expressive Power and Type Reconstruction Paris C. Kanellakis, Gerd G. Hillebrand, Harry G. Mairson Department of Computer Science Brown University Providence, Rhode Island 02912 CS-94-25 May 1994 An Analysis of the Core-ML Language: Expressive Power and Type
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/94/cs94-24.ps.Z, 19940516
Finite Model Theory in the Simply Typed Lambda Calculus Gerd G. Hillebrand Department of Computer Science Brown University Providence, Rhode Island 02912 CS-94-24 May 1994 Finite Model Theory in the Simply Typed Lambda Calculus by Gerd G. Hillebrand Dipl-Math., WWU M unster, July 1989, Sc. M., Brown
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/94/cs94-09.ps.Z, 19940523
Indexing for Data Models with Constraints and Classes Paris Kanellakis Sridhar Ramaswamy Darren Vengroff and Jeffrey Vitter Department of Computer Science Brown University Providence, Rhode Island 02912 CS-94-09 May 1994 Indexing for Data Models with Constraints and Classes Paris Kanellakis Sridhar
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/94/cs94-27.ps.Z, 19940523
Path Caching: A Technique for Optimal External Searching Sridhar Ramaswamy and Sairam Subramanian Department of Computer Science Brown University Providence, Rhode Island 02912 CS-94-27 May 1994 Path Caching: A Technique for Optimal External Searching (Extended Abstract) Sridhar Ramaswamy Brown
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/94/cs94-28.ps.Z, 19940531
Functional Programming Formalisms for OODB Methods Gerd Hillebrand, Paris Kanellakis, and Sridhar Ramaswamy Department of Computer Science Brown University Providence, Rhode Island 02912 CS-94-28 May 1994 Functional Programming Formalisms for OODB Methods Gerd Hillebrand, Paris Kanellakis, and Sridhar
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/94/cs94-21.ps.Z, 19940606
Computer Literacy for Undergraduates: A Document-Engineering Framework Peter Wegner, pw@cs.brown.edu Department of Computer Science Brown University Providence, Rhode Island 02912 CS-94-21 Draft, June 1, 1994 Computer Literacy for Undergraduates (CS2, Spring 1994) 1/30 Computer Literacy for
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/93/cs93-59.ps.Z, 19940609
Open Software: UNIX, DCE, and Competitors Thomas W. Doeppner Jr. Department of Computer Science Brown University Providence, Rhode Island 02912 CS-93-59 December 1993 Open Software: UNIX, DCE, and Competitors1 Thomas W. Doeppner Jr.2 Department of Computer Science Brown University Providence, RI
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/90/cs90-32.ps.Z, 19940610
When trees collide: An approximation algorithm for the generalized Steiner Problem on Networks Ajit Agrawal Philip Klein and R. Ravi Department of Computer Science Brown University Providence, Rhode Island 02912 CS-90-32 June 1994 When trees collide: An approximation algorithm for the generalized
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/94/cs94-29.ps.Z, 19940613
Efficient parallelism vs reliable distribution: a trade-off for concurrent computations Paris C. Kanellakis, Dimitrios Michailadis and Alex A. Shvartsman Department of Computer Science Brown University Providence, Rhode Island 02912 CS-94-29 June 1994 Efficient parallelism vs reliable distribution: a
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/94/cs94-31.ps.Z, 19940701
Constraint Programming and Database Query Languages Paris C Kanellakis and Dina Q Goldin Department of Computer Science Brown University Providence, Rhode Island 02912 CS-94-31 June 1994 Constraint Programming and Database Query Languages Paris C Kanellakis and Dina Q Goldin Brown University,
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/94/cs94-32.ps.Z, 19940711
Optimal Tracing and Replay for Debugging Message-Passing Parallel Programs Robert H. B. Netzer and Barton P. Miller Department of Computer Science Brown University Providence, Rhode Island 02912 CS-94-32 July 1994 To Appear in The Journal of Supercomputing Optimal Tracing and Replay for Debugging
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/94/cs94-19.ps.Z, 19940728
Critical-Path-Based Message Logging for Incremental Replay of Message-Passing Programs Robert H. B. Netzer, Sairam Subramanian and Jian Xu Department of Computer Science Brown University Providence, Rhode Island 02912 CS-94-19 April 1994 Appears in Intl Conference on Distributed Computing Systems,
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/94/cs94-39.ps.Z, 19940930
A Bibliography of Work Related to Reinforcement Learning Leslie Pack Kaelbling, Michael L. Littman Department of Computer Science Brown University Providence, Rhode Island 02912 CS-94-39 September 1994 A Bibliography of Work Related to Reinforcement Learning Leslie Pack Kaelbling Michael L. Littman
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/94/cs94-13.ps.Z, 19941021
Localized Temporal Reasoning Using Subgoals and Abstraction Sheiu-Hong Lin and Thomas Dean Department of Computer Science Brown University Providence, Rhode Island 02912 CS-94-13 March 1994 Localized Temporal Reasoning Using Subgoals and Abstraction Shieu-Hong Lin Thomas Dean1 Department of Computer
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/94/cs94-38.ps.Z, 19941021
CHIRON: Planning in an Open-textured Domain Kathryn E. Sanders Department of Computer Science Brown University Providence, Rhode Island 02912 CS-94-38 October 1994 CHIRON: Planning in an Open-Textured Domain by Kathryn E. Sanders A. B., Brown University, 1977 J. D., Harvard Law School, 1982 Sc. M.,
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/94/cs94-35.ps.Z, 19941021
Deliberation Scheduling for Time-Critical Scheduling in Stochastic Domains Lloyd Greenwald, Thomas Dean Department of Computer Science Brown University Providence, Rhode Island 02912 CS-94-35 September 1994 Deliberation Scheduling for Time-Critical Scheduling in Stochastic Domains Lloyd Greenwald Thomas
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/94/cs94-41.ps.Z, 19941024
Time-Critical Planning and Scheduling Research at Brown University Thomas L. Dean, Lloyd Greenwald, Leslie Pack Kaelbling Department of Computer Science Brown University Providence, Rhode Island 02912 CS-94-41 October 1994 Time-Critical Planning and Scheduling Research at Brown University Thomas L. Dean
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/94/cs94-44.ps.Z, 19941109
Predicting Real-Time Planner Preformance By Domain Charactorization Jak Kirman Department of Computer Science Brown University Providence, Rhode Island 02912 CS-94-44 October 1994 Predicting Real-Time Planner Performance by Domain Characterization by Jak Kirman B.A., Oxford University, June 1983 M.A.,
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/94/cs94-46.ps.Z, 19941206
Optimal Upward Planarity Testing of Single-Source Digraphs Paola Bertolazzi1 Carlo Mannino2 Giuseppe Di Battista3 Roberto Tamassia4 Technical Report No. CS-94-46 December, 1994 1IASI-CNR, Viale Manzoni, 30-00185 Roma, Italy 2IASI-CNR, Viale Manzoni, 30-00185 Roma Italy 3Dipartimento di Informatica e
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/94/cs94-43.ps.Z, 19941214
Broadcast Disks: Data Management for Asymmetric Communication Environments Swarup Acharya1 Rafael Alonso2 Michael Franklin3 Stanley Zdonik4 Technical Report No. CS-94-43 December, 1994 1Dept.of Computer Science,Brown University Providence, RI 02912 2Matsushita Information Technology Labs, Princeton, NJ
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/94/cs94-40.ps.Z, 19950106
The Witness Algorithm: Solving Partially Observable Markov Decision Processes Michael L. Littman Department of Computer Science Brown University Providence, Rhode Island 02912 CS-94-40 December 1994 The Witness Algorithm: Solving Partially Observable Markov Decision Processes Michael L. Littman December
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/95/cs95-01.ps.Z, 19950208
Solving Polynomial Systems Using a Branch and Prune Approach P. Van Hentenryck1 D. McAllester2 D. Kapur3 Technical Report No. CS-95-01 Febuary, 1995 1Dept.of Computer Science,Brown University Providence, RI 02912 2MIT AI Lab, 545 Technology Square Cambridge, MA 3SUNY at Albany, Dept of Computer Science
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/95/cs95-02.ps.Z, 19950213
Redundancy Elimination with a Lexicographic Solved Form J-L. Imbert1 P. Van Hentenryck2 Technical Report No. CS-95-02 Febuary, 1995 1Lab. Informatique de Clermont-Ferrand Complexe Universitaire des Cezaux F-63177 Aubiere Cedex (France) 2Dept.of Computer Science,Brown University Providence, RI 02912
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/94/cs94-20.ps.Z, 19950228
Acting Optimally in Partially Observable Stochastic Domains Anthony R. Cassandra, Leslie Pack Kaelbling and Michael L. Littman Department of Computer Science Brown University Providence, Rhode Island 02912 CS-94-20 April 1994 Acting Optimally in Partially Observable Stochastic Domains Anthony R.
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/94/cs94-14.ps.Z, 19950301
Optimal Policies for Partially Observable Markov Decision Processes Anthony R. Cassandra Department of Computer Science Brown University Providence, Rhode Island 02912 CS-94-14 August 1994 Optimal Policies for Partially Observable Markov Decision Processes Anthony R. Cassandra Department of Computer
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/95/cs95-05.ps.Z, 19950323
The Virtual Tricorder Mathias M. Wloka and Eliot Greenfield Department of Computer Science Brown University Providence, Rhode Island 02912 CS-95-05 March 1995 The Virtual Tricorder Matthias M. Wloka and Eliot Greenfield Science and Technology Center for Computer Graphics and Scientific Visualization,
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/95/cs95-06.ps.Z, 19950323
Parctically Frameless Rendering Mathias M. Wloka Robert C. Zeleznik and Timothy Miller Department of Computer Science Brown University Providence, Rhode Island 02912 CS-95-06 March 1995 Practically Frameless Rendering Matthias M. Wloka, Robert C. Zeleznik, and Timothy Miller Science and Technology
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/95/cs95-03.ps.Z, 19950324
Approximate Queries and Representations for Large Data Sequences Hagit Shatkay Department of Computer Science Brown University Providence, Rhode Island 02912 CS-95-03 March 1995 1 Introduction Domains such as Medicine, Music, Seismology and experimental sciences in general, all require non-traditional
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/95/cs95-04.ps.Z, 19950403
Parallel and Dynamic Shortest-Path Algorithms for Sparse Graphs Sairam Subramanian Department of Computer Science Brown University Providence, Rhode Island 02912 CS-95-04 May 1995 Parallel and dynamic shortest-path algorithms for sparse graphs by Sairam Subramanian M. Sc.(Tech), Computer Science, Birla
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/95/cs95-08.ps.Z, 19950425
Collision Detection for Interactive Graphics Applications Philip M. Hubbard Department of Computer Science Brown University Providence, Rhode Island 02912 CS-95-08 April 1995 Collision Detection for Interactive Graphics Applications by Philip Martyn Hubbard A. B., Harvard University, 1988 Sc. M., Brown
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/95/cs95-12.ps.Z, 19950425
LSign Reordered Viswanath Ramachandran and Pascal Van Hentenryck Department of Computer Science Brown University Providence, Rhode Island 02912 CS-95-12 April 1995 LSign Reordered Viswanath Ramachandran and Pascal Van Hentenryck Brown University, Box 1910, Providence, RI 02912 (USA)
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/94/cs94-03.ps.Z, 19950502
Optimal Shortest Path and Minimum-Link Path Queries Between Two Convex Polygons in the Presence of Obstacles Yi-Jen Chiang and Roberto Tamassia Department of Computer Science Brown University Providence, Rhode Island 02912 CS-94-03 Febuary 1994 Optimal Shortest Path and Minimum-Link Path Queries Between
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/95/cs95-09.ps.Z, 19950502
A Model for Active Entities in Software Systems Manojit Sarkar Department of Computer Science Brown University Providence, Rhode Island 02912 CS-95-09 April 1995 A Model for Active Entities in Software Systems Manojit Sarkar Computer Science Department Brown University, Providence, RI 02912-1910
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/95/cs95-14.ps.Z, 19950509
An Engine for the 3D Visualization of Program Information Steven P. Reiss Department of Computer Science Brown University Providence, Rhode Island 02912 CS-95-14 May 1995 An Engine for the 3D Visualization of Program Information May 5, 1995 1 An Engine for the 3D Visualization of Program Information
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/94/cs94-45.ps.Z, 19950509
Configuration Management in terms of Modules Yi-Jing Lin and Steven P. Reiss Department of Computer Science Brown University Providence, Rhode Island 02912 CS-94-45 May 1995 1 Configuration Management in terms of Modules * Yi-Jing Lin and Steven P. Reiss Department of Computer Science Box 1910, Brown
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/95/cs95-13.ps.Z, 19950509
Fragments: A Mechanism for low Cost Data Integration Steven P. Reiss Department of Computer Science Brown University Providence, Rhode Island 02912 CS-95-13 May 1995 Fragments: A Mechanism for Low Cost Data Integration May 5, 1995 1 Fragments: A Mechanism for Low Cost Data Integration Steven P. Reiss
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/95/cs95-07.ps.Z, 19950510
Experiments on the Practical I/O Efficiency of Geometric Algorithms: Distribution Sweep vs. Plane Sweep Yi-Jen Chiang Department of Computer Science Brown University Providence, Rhode Island 02912 CS-95-07 May 1995 Experiments on the Practical I/O Efficiency of Geometric Algorithms: Distribution Sweep
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/95/cs95-15.ps.Z, 19950510
OODB Indexing by Class-Division Sridhar Ramaswamy and Paris C. Kanellakis Department of Computer Science Brown University Providence, Rhode Island 02912 CS-95-15 May 1995 OODB Indexing by Class-Division Sridhar Ramaswamy Paris C. Kanellakis y
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/95/cs95-16.ps.Z, 19950516
Replication in Spring: A New Subcontract Joshua S. Spiewak Department of Computer Science Brown University Providence, Rhode Island 02912 CS-95-16 May 1995 Replication in Spring: A New Subcontract Joshua S. Spiewak Department of Computer Science Brown University Submitted in partial fulfillment of the
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/95/cs95-10.ps.Z, 19950605
Decomposition Techniques for Planning in Stochastic Domains Thomas Dean and Shieu-Hong Lin Department of Computer Science Brown University Providence, Rhode Island 02912 CS-95-10 June 1995 Decomposition Techniques for Planning in Stochastic Domains Thomas Dean1 Shieu-Hong Lin Department of Computer
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/94/cs94-36.ps.Z, 19950613
Real-Time Optical Flow PhD Thesis Ted Camus Department of Computer Science Brown University, Providence, RI 02912, USA. September 24, 1994 Real-Time Optical Flow by Theodore Armand Camus B.S., Rensselaer Polytechnic Institute, 1988 M.S., Brown University, 1991 Thesis Submitted in Partial Fulfillment of
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/95/cs95-17.ps.Z, 19950622
Processor-Time Tradeoffs under Bounded-Speed Message Propagation: Part I, Upper Bounds Gianfranco Bilardi1 Franco Preparata2 Technical Report No. CS-95-17 June, 1995 1Dipartimento di Elettronica e Informatica, Universita di Padova, Padova Italy 2Department of Computer Science, Brown University, 115
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/95/cs95-20.ps.Z, 19950706
Exploiting Orthogonality in Three Dimensional Graphics for Visualizing Abstract Data James Wen Department of Computer Science Brown University Providence, Rhode Island 02912 CS-95-20 June 1995 Exploiting Orthogonality in Three Dimensional Graphics for Visualizing Abstract Data James Wen Department of
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/95/cs95-23.ps.Z, 19950809
Configuration Management with Logical Structures Yi-Jing Lin and Steven P. Reiss Department of Computer Science Brown University Providence, Rhode Island 02912 CS-95-23 July 1995 1 Configuration Management with Logical Structures Yi-Jing Lin and Steven P. Reiss Department of Computer Science Box 1910,
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/95/cs95-22.ps.Z, 19950809
On the Use of Asynchrony in Achieving Extensibility and High Performance in an object Storage System David E. Langworthy Department of Computer Science Brown University Providence, Rhode Island 02912 CS-95-22 July 1995 On the Use of Asynchrony in Achieving Extensibility and High Performance in an Object
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/95/cs95-24.ps.Z, 19950822
Online Prediction Algorithms for Databases and Operating Systems P. Krishnan Department of Computer Science Brown University Providence, Rhode Island 02912 CS-95-24 August 1995 Online Prediction Algorithms for Databases and Operating Systems1 P. Krishnan2 Department of Computer Science Brown University
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/95/cs95-25.ps.Z, 19950830
Newton: Constraint Programming over Nonlinear Real Constraints Pascal Van Hentenryck and Laurent Michel Department of Computer Science Brown University Providence, Rhode Island 02912 CS-95-25 August 1995 Newton: Constraint Programming over Nonlinear Real Constraints Pascal Van Hentenryck and Laurent
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/95/cs95-26.ps.Z, 19950912
On-Line Convex Planarity Testing Giuseppe Di Battista, Roberto Tamassia, and Luca Vismara Department of Computer Science Brown University Providence, Rhode Island 02912 CS-95-26 August 1995 On-Line Convex Planarity Testing Giuseppe Di Battistay D.I.F.A. Universit a della Basilicata Via della Tecnica 3 -
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/95/cs95-28.ps.Z, 19950913
Parsing with Context-Free Grammars and Word Statistics Eugene Charniak Department of Computer Science Brown University Providence, Rhode Island 02912 CS-95-28 September 1995 Parsing with Context-Free Grammars and Word Statistics Eugene Charniak Department of Computer Science, Brown University May 23,
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/93/cs93-27.ps.Z, 19950915
Trace Size vs Parallelism in Trace-and Replay Debugging of Shared-Memory Programs Robert H. B. Netzer Department of Computer Science Brown University Providence, Rhode Island 02912 CS-93-27 September 1993 Dynamic and I/O-Efficient Algorithms for Computational Geometry and Graph Problems: Theoretical and
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/95/cs95-27.ps.Z, 19950919
Dynamic and I/O-Efficient Algorithms for Computational Geometry and Graph Problems: Theoretical and Experimental Results Yi-Jen Chiang Ph.D. Dissertation Department of Computer Science Brown University Providence, Rhode Island 02912 CS-95-27 August 1995 Dynamic and I/O-Efficient Algorithms for
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/95/cs95-21.ps.Z, 19951011
Tutorial Notes: Models and Paradigms of Interaction Peter Wegner, pw@cs.brown.edu Department of Computer Science Brown University Providence, Rhode Island 02912 CS-95-21 September 1995 OOPSLA Tutorial Notes, October 1995 Models and Paradigms of Interaction 1/67 Tutorial Notes: Models and Paradigms of
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/95/cs95-29.ps.Z, 19951011
A Statistical Syntactic Disambiguation Program and what it learns Murat Ersan and Eugene Charniak Department of Computer Science Brown University Providence, Rhode Island 02912 CS-95-29 October 1995 A Statistical Syntactic Disambiguation Program and What It Learns Murat Ersan and Eugene Charniak
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/95/cs95-32.ps.Z, 19951031
Helios: A Mathematical Modeling Language for Newton Laurent Michel and Pascal Van Hentenryck Department of Computer Science Brown University Providence, Rhode Island 02912 CS-95-32 October 1995 Helios: A Mathematical Modeling Language for Newton Laurent Michel and Pascal Van Hentenryck Brown University,
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/95/cs95-30.ps.Z, 19951115
Source to Source Optimizations of CLP(
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/95/cs95-33.ps.Z, 19951121
Helios: A Modeling Language for Nonlinear Constraint Solving and Global Optimization using Interval Analysis Pascal Van Hentenryck and Laurent Michel Department of Computer Science Brown University Providence, Rhode Island 02912 CS-95-33 November 1995 Helios: A Modeling Language for Nonlinear Constraint
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/95/cs95-31.ps.Z, 19951129
Configuration Management in Terms of Logical Structures Yi-Jing Lin Department of Computer Science Brown University Providence, Rhode Island 02912 CS-95-31 October 1995 Configuration Management in Terms of Logical Structures Yi-Jing Lin Ph.D. Dissertation Department of Computer Science Brown University
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/94/cs94-26.ps.Z, 19951213
Functional Database Query Languages as Typed Lambda Calculi of Fixed Order Gerd G. Hillebrand and Paris C. Kanellakis Department of Computer Science Brown University Providence, Rhode Island 02912 CS-94-26 May 1994 Functional Database Query Languages as Typed Lambda Calculi of Fixed Order Gerd G.
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/93/cs93-06.ps.Z, 19951213
Database Query Languages Embedded in the Typed Lambda Calculus Gerd G. Hillebrand Paris C. Kanellakis and Harry G. Mairson Department of Computer Science Brown University Providence, Rhode Island 02912 CS-93-06 Revised December 1995 Database Query Languages Embedded in the Typed Lambda Calculus Gerd G.
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/94/cs94-04.ps.Z, 19951215
The Framework for EPOQ - an Extensible Object-Oriented Query Optimizer Solveig Bjornestad Department of Computer Science Brown University Providence, Rhode Island 02912 CS-94-04 March 1994 The framework for EPOQ - an Extensible Object- Oriented Query Optimizer Solveig Bj rnestad1 Technical Report No.
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/96/cs96-02.ps.Z, 19960109
Tree-bank Grammars Eugene Charniak Department of Computer Science Brown University Providence, Rhode Island 02912 CS-96-02 January 1996 Tree-bank Grammars Eugene Charniak Department of Computer Science, Brown University January 5, 1996
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/96/cs96-06.ps.Z, 19960126
A Near-linear-time Approximation Algorithms for Maximum-leaf Spanning Tree Hsueh-I Lu and R. Ravi Department of Computer Science Brown University Providence, Rhode Island 02912 CS-96-06 January 1996 A Near-linear-time Approximation Algorithm for Maximum-leaf Spanning Tree Hsueh-I Lu hil@cs.brown.edu
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/96/cs96-04.ps.Z, 19960126
Race-Condition Detection in Parallel Computation with Semaphores Philip N. Klein Hsueh-I Lu and Robert H. B. Netzer Department of Computer Science Brown University Providence, Rhode Island 02912 CS-96-04 January 1996 Race Condition Detection in Parallel Computation with Semaphores Philip N. Klein Hsueh
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/96/cs96-05.ps.Z, 19960126
The Power of Local Optimization: Approximation Algorithms for Maximum-leaf Spanning Tree (DRAFT)* Hsueh-I Lu and R. Ravi Department of Computer Science Brown University Providence, Rhode Island 02912 CS-96-05 January 1996 The Power of Local Optimization: Approximation Algorithms for Maximum-leaf
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/96/cs96-03.ps.Z, 19960130
The Topological Structure of Asynchronous Computability Maurice Herlihy and Nir Shavit Department of Computer Science Brown University Providence, Rhode Island 02912 CS-96-03 January 1996 The Topological Structure of Asynchronous Computability Maurice Herlihy Computer Science Department Brown University
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/96/cs96-07.ps.Z, 19960130
Efficient Approximation Algorithms for Semidefinite Programs Arising from MAX CUT and COLORING Philip N. Klein and Hsueh-I Lu Department of Computer Science Brown University Providence, Rhode Island 02912 CS-96-07 January 1996 To appear in Proceedings, 28th Annual ACM Symposium on Theory of Computing
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/93/cs93-29.ps.Z, 19960130
Detecting Race Conditions in Parallel Programs that Use one Semaphore Hsueh-I Lu Philip N. Klein and Robert H. B. Netzer Department of Computer Science Brown University Providence, Rhode Island 02912 CS-93-29 June 1993 Appears in Workshop on Algorithms and Data Structures (WADS'93), August 11 13,
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/96/cs96-08.ps.Z, 19960219
Planning and Acting in Partially Observable Stochastic Domains Leslie Pack Kaelbling Michael L. Littman and Anthony R. Cassandra Department of Computer Science Brown University Providence, Rhode Island 02912 CS-96-08 February 1996 Planning and Acting in Partially Observable Stochastic Domains Leslie
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/96/cs96-10.ps.Z, 19960219
A Generalized Reinforcement-Learning Model: Convergence and Applicationa Michael L. Littman1 Csaba Szepesva`ri2 Technical Report No. CS-96-10 February, 1996 1Department of Computer Science, Brown University, 115 Waterman, Providence, RI 02912-1910, mlittman@cs.brown.edu 2Bolyal Institute of Mathematics,
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/96/cs96-09.ps.Z, 19960305
Algorithms for Sequential Decision Making Michael Lederman Littman Ph.D. Dissertation Department of Computer Science Brown University Providence, Rhode Island 02912 CS-96-09 March 1996 Algorithms for Sequential Decision Making by Michael Lederman Littman B.S., Yale University, May 1988 M.S., Yale
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/96/cs96-12.ps.Z, 19960402
Figures of Merit for Best-First Probabilistic Chart Parsing Sharon A. Caraballo and Eugene Charniak Department of Computer Science Brown University Providence, Rhode Island 02912 CS-96-12 April 1996 Figures of Merit for Best-First Probabilistic Chart Parsing Sharon A. Caraballo sc@cs.brown.edu Eugene
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/96/cs96-13.ps.Z, 19960403
Where to Draw the Line Ashim Garg Ph.D. Dissertation Department of Computer Science Brown University Providence, Rhode Island 02912 CS-96-13 Aprill 1996 Where to Draw the Line by Ashim Garg B. E., Roorkee University, 1990 Sc. M., Brown University, 1992 Thesis Submitted in partial fulfillment of the
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/96/cs96-15.ps.Z, 19960429
Hidden-Surfaces: Combining BSP Trees with Graph-Based Algorithms Timothy Miller Department of Computer Science Brown University Providence, Rhode Island 02912 CS-96-15 Aprill 1996 Hidden-Surfaces: Combining BSP Trees with Graph-Based Algorithms Timothy Miller Brown University site The Science and
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/96/cs96-14.ps.Z, 19960509
A Motion-Compensated Filter for Ultrasound Image Sequences Lee Markosian Department of Computer Science Brown University Providence, Rhode Island 02912 CS-96-14 May 1996 A Motion-Compensated Filter for Ultrasound Image Sequences Lee Markosian
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/96/cs96-17.ps.Z, 19960516
Acting under Uncertainty: Discrete Bayesian Models for Mobile-Robot Navigation A. Cassandra, L. Kaelbling, and J. Kurien Department of Computer Science Brown University Providence, Rhode Island 02912 CS-96-17 May 1996 Acting under Uncertainty: Discrete Bayesian Models for Mobile-Robot Navigation Anthony
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/96/cs96-18.ps.Z, 19960520
Real-Time Thread Package Kostadis Roussos Department of Computer Science Brown University Providence, Rhode Island 02912 CS-96-18 May 1996 Real-Time Thread Package Kostadis Roussos Brown University Honors Thesis Under the Direction of Thomas W. Doeppner Jr. May 20, 1996
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/96/cs96-19.ps.Z, 19960522
Runtime Performance Analysis of the M-to-N Scheduling Model Bryan M. Cantrill Department of Computer Science Brown University Providence, Rhode Island 02912 CS-96-19 May 1996 Runtime Performance Analysis of the M-to-N Scheduling Model Bryan M. Cantrill Dept. of Computer Science Brown University
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/95/cs95-19.ps.Z, 19960610
Efficient dynamic-programming updates in partially Observable Markov decision processes Michael L. Littman, Anthony R. Cassandra, and Leslie Pack Kaelbling Department of Computer Science Brown University Providence, Rhode Island 02912 CS-95-19 November 1995 Efficient dynamic-programming updates in
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/96/cs96-22.ps.Z, 19960625
The Rectangle of Influence Drawability Problem G. Liotta, A. Lubiw, H. Meijer and S. H. Whitesides Department of Computer Science Brown University Providence, Rhode Island 02912 CS-96-22 June 1996 The Rectangle of Influence Drawability Problem G. Liottay A. Lubiw z H. Meijer x S. H. Whitesides{
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/96/cs96-21.ps.Z, 19960625
Proximity Drawings of Outerplanar Graphs (Preliminary Version) William Lenhart and Giuseppe Liotta Department of Computer Science Brown University Providence, Rhode Island 02912 CS-96-21 June 1996 Proximity Drawings of Outerplanar Graphs (Preliminary Version) William Lenhart Department of Computer
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/96/cs96-25.ps.Z, 19960829
Output-Sensitive Reporting of Disjoint Paths Giuseppe Di Battista, Roberto Tamassia, and Luca Vismara Department of Computer Science Brown University Providence, Rhode Island 02912 CS-96-25 September 1996 Output-Sensitive Reporting of Disjoint Paths Giuseppe Di Battista Dipartimento di Discipline
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/96/cs96-27.ps.Z, 19960911
A Probabilistic Analysis of the Power of Arithmetic Filters Olivier Devillers and Franco Preparata Department of Computer Science Brown University Providence, Rhode Island 02912 CS-96-27 September 1996 A Probabilistic Analysis of the Power of Arithmetic Filters Olivier Devillersy Franco P. Preparataz
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/95/cs95-36.ps.Z, 19960926
VTRACE and Communication Performance Analysis Peng Dai and Thomas W. Doeppner Jr. Department of Computer Science Brown University Providence, Rhode Island 02912 CS-95-36 November 1995 VTRACE and Communication Performance Analysis 1 of 31 This work was supported by a grant from Sun Microsystems, Inc.
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/96/cs96-29.ps.Z, 19961003
Area Requirement of Gabriel Drawings G. Liotta R. Tamassia I. G. Tollis and Paola Vocca Department of Computer Science Brown University Providence, Rhode Island 02912 CS-96-29 October 1996 Area Requirement of Gabriel Drawings (Extended Abstract) Giuseppe Liotta gl@cs.brown.edu Center for Geometric
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/96/cs96-28.ps.Z, 19961003
Low Degree Algorithms for Computing and Checking Gabriel Graphs Giuseppe Liotta Department of Computer Science Brown University Providence, Rhode Island 02912 CS-96-28 October 1996 Low Degree Algorithms for Computing and Checking Gabriel Graphs (Extended Abstract) Giuseppe Liotta Center for Geometric
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/96/cs96-16.ps.Z, 19961028
Robust Proximity Queries in Implicit Voronoi Diagrams G. Liotta, F. P. Preparata, and R. Tamassia Department of Computer Science Brown University Providence, Rhode Island 02912 CS-96-16 October 1996 Robust Proximity Queries in Implicit Voronoi Diagrams Giuseppe Liotta Franco P. Preparata Roberto
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/96/cs96-24.ps.Z, 19961030
Drawing Directed Acyclic Graphs: An Experimental Study G. Di Battista, A. Garg, G. Liotta, A. Parise, R. Tamassia, E. Tassinari, F. Vargiu, L. Vismara Department of Computer Science Brown University Providence, Rhode Island 02912 CS-96-24 October 1996 Drawing Directed Acyclic Graphs: An Experimental
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/96/cs96-31.ps.Z, 19961104
The Dynamic Adaptation of Parallel Mesh-Based Computation Jos e G. Casta~nos and John E. Savage Department of Computer Science Brown University Providence, Rhode Island 02912 CS-96-31 October 1996
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/96/cs96-11.ps.Z, 19961115
Generalized Markov Decision Processes: Dynamic-programming and Reinforcement-learning Algorithms Csaba Szepesv ari and Michael L. Littman Department of Computer Science Brown University Providence, Rhode Island 02912 CS-96-11 November 1996 Generalized Markov Decision Processes: Dynamic-programming and
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/96/cs96-23.ps.Z, 19961118
Area Requirement of Visibility Representations of Trees G. Kant, G. Liotta, R. Tamassia and I. G. Tollis Department of Computer Science Brown University Providence, Rhode Island 02912 CS-96-23 November 1996 Area Requirement of Visibility Representations of Trees Goos Kanty Giuseppe Liottaz Roberto
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/96/cs96-33.ps.Z, 19961217
Efficient Approximation Algorithms for Some Semidefinite Programs Hsueh-I Lu Ph.D. Dissertation Department of Computer Science Brown University Providence, Rhode Island 02912 CS-96-33 December 1996 Efficient Approximation Algorithms for Some Semidefinite Programs by Hsueh-I Lu B. S., National Taiwan
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/96/cs96-34.ps.Z, 19961217
A Constraint Satisfaction Approach to a Circuit Design Problem Jean-Francois Puget and Pascal Van Hentenryck Department of Computer Science Brown University Providence, Rhode Island 02912 CS-96-34 December 1996 A Constraint Satisfaction Approach to a Circuit Design Problem Jean-Francois Puget Ilog SA,
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/96/cs96-37.ps.Z, 19970106
Expected-Frequency Interpolation Eugene Charniak Department of Computer Science Brown University Providence, Rhode Island 02912 CS-96-37 December 1996 Expected-Frequency Interpolation Eugene Charniak Department of Computer Science, Brown University December 30, 1996
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/97/cs97-03.ps.Z, 19970409
Localizer: A Modeling Language for Local Search Laurent Michel and Pascal Van Hentenryck Department of Computer Science Brown University Providence, Rhode Island 02912 CS-97-03 April 1997 Localizer A Modeling Language for Local Search Laurent Michel and Pascal Van Hentenryck Brown University, Box 1910
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/97/cs97-04.ps.Z, 19970429
Learning Hidden Markov Models with Geometric Information Hagit Shatkay and Leslie Pack Kaelbling Department of Computer Science Brown University Providence, Rhode Island 02912 CS-97-04 April 1997 Learning Hidden Markov Models with Geometric Information Hagit Shatkay Leslie Pack Kaelbling Department of
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/95/cs95-37.ps.Z, 19970501
The Fourier Transform - A Primer Hagit Shatkay Department of Computer Science Brown University Providence, Rhode Island 02912 CS-95-37 November 1995 The Fourier Transform { A Primer Hagit Shatkay Department of Computer Science Brown University Providence, RI 02912 1 Introduction The Fourier transform is
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/97/cs97-05.ps.Z, 19970523
Bounded Parameter Markov Decision Processes Robert Givan, Sonia Leach, Thomas Dean Department of Computer Science Brown University Providence, Rhode Island 02912 CS-97-05 May 1997 Bounded Parameter Markov Decision Processes Robert Givan Sonia Leach Thomas Dean Department of Computer Science, Brown
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/97/cs97-06.ps.Z, 19970527
Fast and Efficient Algorithms for text and Video Compression Dzung Tien Hoang Ph.D. Dissertation Department of Computer Science Brown University Providence, Rhode Island 02912 CS-97-06 May 1997 Fast and Efficient Algorithms for Text and Video Compression 1 Dzung Tien Hoang2 Department of Computer
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/97/cs97-10.ps.Z, 19970715
Visualizing Gometric Algorithms Over the Web J.E. Baker, I.F. Cruz, G. Liotta, and R. Tamassia Department of Computer Science Brown University Providence, Rhode Island 02912 CS-97-10 July 1997 Visualizing Geometric Algorithms over the Web James E. Baker y Isabel F. Cruz z Giuseppe Liottax Roberto
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/97/cs97-07.ps.Z, 19970715
A collaborative environment for algorithm animation on the WWWMay 10, 1997 48 CU SEE-Me: Happenings, Theater, Magic. Susan Warshauer, University of Texas at Austin. A Window on Shared Virtual Environments. Denis Amselem, SRI International. VRML Frequently Asked Questions (FAQ) A
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/97/cs97-11.ps.Z, 19970715
Checking the Convexity of Polytopes and the Planarity of Subdivisions O. Devillers, G. Liotta, F. P. Preparata, and R. Tamassia Department of Computer Science Brown University Providence, Rhode Island 02912 CS-97-11 July 1997 Checking the Convexity of Polytopes and the Planarity of Subdivisions
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/97/cs97-12.ps.Z, 19970806
RDB: A System for Incremental Replay Debugging Michael W. Shapiro Department of Computer Science Brown University Providence, Rhode Island 02912 CS-97-12 July 1997 rdb: A System for Incremental Replay Debugging Michael W. Shapiro Dept. of Computer Science Brown University mws@cs.brown.edu May 19, 1997
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/97/cs97-14.ps.Z, 19970925
Exploiting Structure for Planning and Control Shieu-Hong Lin Ph.D. Dissertation Department of Computer Science Brown University Providence, Rhode Island 02912 CS-97-14 September 1997
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/97/cs97-15.ps.Z, 19970926
Broadcast Disks: Dissemination-based Data Management for Asymmetric Communication Environments Swarup Acharya Ph.D. Dissertation Department of Computer Science Brown University Providence, Rhode Island 02912 CS-97-15 September 1997 Broadcast Disks: Dissemination-based Data Management for Asymmetric
open this document and view contentsftp://ftp.cs.brown.edu/pub/techreports/ABSTRACTS.ps.Z, 19971010
Technical Reports Department of Computer Science Brown University 1989 | Present CS-97-17 October 1997 Analysis of Mouse Movement Time based on Varying Control to Display Ratios using Fitts' Law Joseph J. LaViola Jr. This paper describes an experiment that attempts to determine what impact different