|
Dartmouth College Computer Science
Technical Report series
|
CS home
TR home
TR search
TR listserv
|
| By author:
|
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
Y
Z
|
| By number:
|
2008,
2007,
2006,
2005,
2004,
2003,
2002,
2001,
2000,
1999,
1998,
1997,
1996,
1995,
1994,
1993,
1992,
1991,
1990,
1989,
1988,
1987,
1986
|
 1994 |
Technical Reports for 1995 |
1996 |
PCS-TR95-250: DartCVL: The Dartmouth C Vector Library
PCS-TR95-251: Disk-directed I/O for an Out-of-Core Computation
PCS-TR95-252: Content-based image retrieval: color and edges
PCS-TR95-253: Low-level Interfaces for High-level Parallel I/O
PCS-TR95-254: Expanding the Potential for Disk-Directed I/O
PCS-TR95-256: Issues and Obstacles with Multimedia Authoring (renumbered)
PCS-TR95-258: TIAS: A Transportable Intelligent Agent System
PCS-TR95-259: A Multiple Discrete Pass Algorithm on a DEC Alpha 2100
PCS-TR95-260: Simulation of a Video-on-Demand System
PCS-TR95-261: Ph.D. Thesis Proprosal: Transportable Agents
PCS-TR95-262: A 2-2/3 Approximation for the Shortest Superstring Problem
PCS-TR95-263: File-Access Characteristics of Parallel Scientific Workloads
PCS-TR95-264: Process Migration for Heterogeneous Distributed Systems
PCS-TR95-265: Structured Permuting in Place on Parallel Disk Systems
PCS-TR95-266: Complexity Analysis of Two Permutations Used by Fast Cosine Transform Algorithms
PCS-TR95-267: An API for Choreographing Data Accesses
PCS-TR95-270: Interfaces for Disk-Directed I/O
PCS-TR95-271: A Fast Parallel Implementation of the Wavelet Packet Best Basis Algorithm on the MP-2 for Real-Time MRI
PCS-TR95-272: Finding Real-Valued Single-Source Shortest Paths in o(n^3) Expected Time
PCS-TR95-273: A Performance Comparison of TCP/IP and MPI on FDDI, Fast Ethernet, and Ethernet
Want to be notified about new tech reports?
Join our mailing list.
Want to search our technical reports?
Want us to mail you a paper copy of a report?
Send your address and the TR number to reports AT cs.dartmouth.edu
Copyright notice:
The documents contained in this server are included by the
contributing authors as a means to ensure timely dissemination of
scholarly and technical work on a non-commercial basis. Copyright and
all rights therein are maintained by the authors or by other copyright
holders, notwithstanding that they have offered their works here
electronically. It is understood that all persons copying this
information will adhere to the terms and constraints invoked by each
author's copyright. These works may not be reposted without the
explicit permission of the copyright holder.