Browse

ftp://ftp.icsi.Berkeley.edu (231)

	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1990/tr-90-009.ps.Z, 19910210 INTERNATIONAL COMPUTER SCIENCE INSTITUTE I 1947 Center Street ffl Suite 600 ffl Berkeley, California 94704 ffl 1-415-642-4274 ffl FAX 1-415-643-7684 Miniature Language Acquisition: A touchstone for cognitive science Jerome A. Feldman, George Lakoff, Andreas Stolcke1 and Susan Hollbach Weber TR-90-009
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1991/tr-91-032.ps.Z, 19910522 GAL: Networks that grow when they learn and shrink when they forget Ethem Alpayd n International Computer Science Institute May 1991 TR 91-032
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1990/tr-90-011.ps.Z, 19910528 INTERNATIONAL COMPUTER SCIENCE INSTITUTE 1947 Center Street Suite 600 Berkeley, California 94704 (415) 643-4274 FAX (415) 643-7684 A Network for Extracting the Locations of Point Clusters Using Selective Attention1 Technical Report #90-011 May 30, 1990
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1991/tr-91-031.ps.Z, 19910917 pSather monitors: Design, Tutorial, Rationale and Implementation Jerome A. Feldman Chu-Cheow Limy Franco Mazzantiz TR-91-031 September 1991
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1991/tr-91-034.ps.Z, 19910930 INTERNATIONAL COMPUTER SCIENCE INSTITUTE I 1947 Center Street ffl Suite 600 ffl Berkeley, California 94704 ffl 1-510-642-4274 ffl FAX 1-510-643-7684 Sather Language Design and Performance Evaluation Chu-Cheow Limy Andreas Stolckez TR-91-034 May 1991
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1991/tr-91-050.ps.Z, 19911014 Learning Spatial Concepts Using a Partially-Structured Connectionist Architecture Terry Regier TR-91-050 October 1991
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1991/tr-91-035.ps.Z, 19911016 HiPNeT-1: A Highly Pipelined Architecture for Neural Network Training Krste Asanovi c y Brian E. D. Kingsbury y Nelson Morgan John Wawrzynek y TR-91-035 October 1991
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1991/tr-91-030.ps.Z, 19911017 INTERNATIONAL COMPUTER SCIENCE INSTITUTE I 1947 Center Street Suite 600 Berkeley, California 94704 1-415-642-4274 FAX 1-415-643-7684 PROBABILITY ESTIMATION BY FEED-FORWARD NETWORKS IN CONTINUOUS SPEECH RECOGNITION Steve Renals, Nelson Morgan and Herv e Bourlard TR-91-030 28 August 1991
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1991/tr-91-058.ps.Z, 19911024 INTERNATIONAL COMPUTER SCIENCE INSTITUTE I 1947 Center Street ffl Suite 600 ffl Berkeley, California 94704 ffl 1-510-642-4274 ffl FAX 1-510-643-7684 Detecting Skewed Symmetries Stefan Posch TR-91-058 October 1991
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1991/tr-91-061.ps.Z, 19911101 Combinatory Differential Fields: An Algebraic Approach to Approximate Computation and Constructive Analysis Karl Aberer y TR-91-061 November 1991
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1991/tr-91-059.ps.Z, 19911106 Line Labeling Using Markov Random Fields Terry Regier TR-91-059 November 1991
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1991/tr-91-047.ps.Z, 19911118 ICSI, on leave from: Inst. f. Systemtechnik, GMD, Germany ICSI ntroduction Common Lisp was developed to consolidate the best ideas from a long line of Lisp systems and has become an important standard. The object-oriented aspects developed in CLOS were developed later and were required
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1991/tr-91-048.ps.Z, 19911203 ICSIM: An Object-Oriented Connectionist Simulator Heinz W. Schmidt , Ben Gomes ICSI, Berkeley, California
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1991/tr-91-062.ps.Z, 19911205 stract ntroduction Consider the task of writing a program P to evaluate a function f . One of the main difficulties is that when P is implemented it is difficult to verify that P (x) = f(x) for all inputs x. There are two traditional approaches to this problem, program verification and program testing.
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1991/tr-91-072.ps.Z, 19920106 SPERT: A VLIW/SIMD Microprocessor for Artificial Neural Network Computations Krste Asanovi c y James Beck Brian E. D. Kingsbury y Phil Kohn Nelson Morgan y John Wawrzynek y TR-91-072 January 1992
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1991/tr-91-070.ps.Z, 19920108 INTERNATIONAL COMPUTER SCIENCE INSTITUTE I 1947 Center Street Suite 600 Berkeley, California 94704 1-510-642-4274 FAX 1-510-643-7684 Connectionist Speech Recognition: Status and Prospects Steve Renals, Nelson Morgan, Herve Bourlard , Michael Coheny, Horacio Francoy, Chuck Wooters and Phil Kohn TR-91-070
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1991/tr-91-074.ps.Z, 19920117 INTERNATIONAL COMPUTER SCIENCE INSTITUTE I 1947 Center Street ffl Suite 600 ffl Berkeley, California 94704 ffl 1-510-642-4274 ffl FAX 1-510-643-7684 Recent Work in VLSI Elements for Digital Implementations of Artificial Neural Networks Brian E. D. Kingsbury y Bertrand Irissou y Krste Asanovi c y John
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1991/tr-91-071.ps.Z, 19920121 GDNN: A Gender-Dependent Neural Network for Continuous Speech Recognition Yochai Konig y Nelson Morgan y Claudia Chandra y TR-91-071 December 1991
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1992/tr-92-005.ps.Z, 19920127
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1992/tr-92-010.ps.Z, 19920205 r r r r s rac r : r r r , r r . r r r 3=2+ffl , r r . r r 4=3+ffl , r r . r r r r . r r r . nternational omputer cience nstitute, 7 enter t., er ele , A 7 . .A. and ept. of omputer cience, ing's ollege, trand, ondon . . e-mail: m.pellegrini oa .cc. cl.ac.u ntroduction Computing intersections of
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1992/tr-92-012.ps.Z, 19920331 Towards a Complexity Theory for Approximation Karl Aberer y and Bruno Codenotti z TR-92-012 February 1992
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1992/tr-92-022.ps.Z, 19920406 Petri Net Based Software Validation Prospects and Limitations Monika Heiner1 TR-92-022 March, 1992 1. On leave from Research Center for Innovative Computer Systems and Computer Technology (FIRST), GMD, Germany. Petri Net Based Software Validation Prospects and Limitations Monika Heiner1 International
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1992/tr-92-001.ps.Z, 19920413 REAL-TIME COMMUNICATION IN AN INTERNETWORK Domenico Ferrari The Tenet Group Computer Science Division Department of Electrical Engineering and Computer Sciences University of California and International Computer Science Institute Berkeley, California, U.S.A.
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1992/tr-92-003.ps.Z, 19920414 Rate-Controlled Static-Priority Queueing Hui Zhang Domenico Ferrari hzhang, ferrari@tenet.Berkeley.EDU Computer Science Division University of California at Berkeley Berkeley, CA 94720 TR-92-003 February 1992
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1992/tr-92-016.ps.Z, 19920417 A Framework for the Study of Pricing in Integrated Networks Colin Parris Tenet Group, Computer Science Division, UC Berkeley and International Computer Science Institute, Berkeley, CA 94720 Srinivasan Keshav AT&T Bell Laboratories 600 Mountain Ave., Murray Hill, NJ 07974 Domenico Ferrari Tenet Group,
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1992/tr-92-008.ps.Z, 19920423 n roduc ion Petri nets have been widely used to design and modeling concurrent systems, as well as certain kinds of time-dependent systems. This is due not only to their neat graphical representation but also to the fact that a great quantity of theoretical studies have been done on their
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1992/tr-92-007.ps.Z, 19920423 e e e s s s s , s . s s s s s, s . s s s s , s s , s s s . s s s s s, s s s . s s s s , s ss , s s s . s s s s s . s s , s s s s , s s, . . s s s s s s. s s s , s s , s s s s s s . ss s ss s, s ss ss s s s s - s. s , s s s, s s. ntro uction This paper presents the architecture of the LOGIDATA+ prototype
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1992/tr-92-021.ps.Z, 19920505 B. Codenottiy L. Margaraz TR-92-021 April 1992 A str ct It has been shown that certain NP-complete problems, i.e. TSP, min cut, and graph partitioning, with specific notions of neighborhood, satisfy a simple difference equation. In this paper, we extend these results by proving that TSP with 2-change,
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1992/tr-92-029.ps.Z, 19920505 Efficient Computation of Spatial Joins Oliver Gunther FAW Ulm, Postfach 2060, 7900 Ulm, Germany guenther@faw9370.faw.uni-ulm.de
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1991/tr-91-060.ps.Z, 19920511 Bruno Codenotti Mauro Leoncini Giovanni Resta TR-91-060 May 1992 stra t In this paper we address the notion of reducibility among linear algebra problems within a parallel computing environment. We prove that, though many such problems have been shown to be 1-equivalent, when approximation is taken into
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1990/tr-90-001.ps.Z, 19920518 1 The Delaunay Triangulation and Function Learning STEPHEN M. OMOHUNDRO International Computer Science Institute 1947 Center Street, Suite 600 Berkeley, California 94704 Phone: 415-643-9153 Internet: om@icsi.berkeley.edu Date, 1989
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1992/tr-92-017.ps.Z, 19920518 REFERENCES 16 Bertrand Meyer. Object-oriented Software Construction. Prentice Hall, New York, 1988. Bertrand Meyer. Eiffel: The Language. Prentice Hall, New York, 1992. Stephen M. Omohundro. The Sather Language. Technical report, International Computer Science Institute, Berkeley, Ca.,
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1989/tr-89-063.ps.Z, 19920518 1 Five Balltree Construction Algorithms STEPHEN M. OMOHUNDRO International Computer Science Institute 1947 Center Street, Suite 600 Berkeley, California 94704 Phone: 415-643-9153 Internet: om@icsi.berkeley.edu November 20, 1989
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1991/tr-91-010.ps.Z, 19920518 How Receptive Field Parameters Affect Neural Learning Bartlett W. Mel CNS Program Caltech, 216-76 Pasadena, CA 91125 Stephen M. Omohundro ICSI 1947 Center St., Suite 600 Berkeley, CA 94704
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1992/tr-92-031.ps.Z, 19920519 ntrod ction In this paper we investigate the satisfiability problem for the class 3LSSPU of multi-sorted settheoretic formulae where singleton, powerset and general union operators can occur. Our results relate to the ongoing research work in the field of Computable Set Theory. A comprehensive
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1992/tr-92-033.ps.Z, 19920519 incenz ier y is er e s i i n zz ini ns en e n er in i i s is ce i n n n n n er ern i es. e re i n r e is e ne e ns in ensi re i n er i ns eri cer in e ic c n i i ns, n ss in zz r i n i s e ne in . necess r n s cien c n i i n r n n-irr i n i is resen e , n i c en s n e i r nce e n er ern i es. : re
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1991/tr-91-011.ps.Z, 19920527 Algorithms for Sparse Rational Interpolation Dima Grigoriev 1 Marek Karpinski 2 TR-91-011 January, 1991
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1991/tr-91-014.ps.Z, 19920527 Computational Complexity of Learning Read-Once Formulas over Different Bases Lisa Hellerstein 1 Marek Karpinski 2 TR-91-014 February, 1991
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1991/tr-91-067.ps.Z, 19920527 Probabilistic Recurrence Relations for Parallel Divide-and-Conquer Algorithms Marek Karpinski 1 Wolf Zimmermann 2 TR-91-067 December, 1991
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1992/tr-92-020.ps.Z, 19920527 Read-Once Threshold Formulas, Justifying Assignments, and Generic Tranformations Nader H. Bshouty1 Thomas R. Hancock2 Lisa Hellerstein3 Marek Karpinski4 TR-92-020 March, 1992
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1991/tr-91-013.ps.Z, 19920527 Short Proofs for Nondivisibility of Sparse Polynomials under the Extended Riemann Hypothesis Dima Grigoriev 1 Marek Karpinski 2 Andrew M. Odlyzko 3 TR-91-013 February, 1991
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1991/tr-91-018.ps.Z, 19920527 Computational Complexity of Sparse Rational Interpolation Dima Grigoriev 1 Marek Karpinski 2 Michael F. Singer 3 TR-91-018 March, 1991
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1990/tr-90-037.ps.Z, 19920617 o es lts o t e ist te ro le Sandy Irani omputer Science ivision . . er eley er eley, alifornia 4 2 une 1 2 s rac In t is paper e ive a randomized on-line al orit m for t e list update pro lem. Sleator and ar an s o a deterministic al orit m, ove-to- ront, t at ac ieves competitive ratio of 2 1 for lists
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1989/tr-89-047.ps.Z, 19920623 The Transitive Closure of a Random Digraph Richard M. Karp
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1990/tr-90-049.ps.Z, 19920626 Ring Array Processor (RAP): SoftwareUser 'sManual Version 1.0 P. Kohn and J. Bilmes
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1992/tr-92-038.ps.Z, 19920716 Fuzzy Evolutionary Algorithms Hans-Michael Voigt TR-92-038 June 1992
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1992/tr-92-047.ps.Z, 19920730 ZGDV-Report 60/92 The "Melting Octree" network ICSI TR-92-047 Page - 1 An Adaptive Classification Scheme to Approximate Decision Boundaries Using Local Bayes Criteria - The "Melting Octree" Network L. M. Encarna o, M. H. Gross International Computer Science Institute (ICSI), Berkeley and Computer
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1992/tr-92-043.ps.Z, 19920731 INTERNATIONAL COMPUTER SCIENCE INSTITUTE I 1947 Center Street ffl Suite 600 ffl Berkeley, California 94704 ffl 1-510-642-4274 ffl FAX 1-510-643-7684 A Symbolic Complexity Analysis of Connectionist Algorithms for Distributed-Memory Machines Jonathan Bachrach TR-92-043 July 1992
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1992/tr-92-045.ps.Z, 19920808 1 Persistence in the Object-Oriented Database Programming Language VML Volker Turau GMD-IPSI Integrated Publication and Information Systems Institute Dolivostr. 15, D 6100 Darmstadt, FRG e-mail: turau@darmstadt.gmd.de Wolfgang Klas International Computer Science Institute 1947 Center Street, Suite 600
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1991/tr-91-049.ps.Z, 19920817 INTERNATIONAL COMPUTER SCIENCE INSTITUTE 1947 Center Street Suite 600 Berkeley, California 94704 (510) 643-4274 FAX (510) 643-7684 VISIT: An Efficient Computational Model of Human Visual Attention1 Subutai Ahmad ahmad@icsi.berkeley.edu TR-91-049 September 1991
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1992/tr-92-048.ps.Z, 19920819 A Study of Perceptually Grounded Polysemy in a Spatial Microdomain Jordan Zlatev TR-92-048 August 1992
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1992/tr-92-028.ps.Z, 19920819 1 Proposal of an External Processor Scheduling in Micro-Kernel based Operating Systems* Winfried Kalfa+ TR-92-028 May, 1992 Until now, the management of resources was a task of the operating systems kernel. The applications running on the operating system were in general, similiar to each other. Thus
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1992/tr-92-014.ps.Z, 19920820 Backwards Analysis of Randomized Geometric Algorithms Raimund Seidel Computer Science Division University of California Berkeley Berkeley CA 94720 USA August 20, 1992
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1992/tr-92-056.ps.Z, 19920905 REFERENCES 17 G. F. Italiano. Amortized efficiency of a path retrieval data structure. Theoret. Comput. Sci., 48:27381, 1986. G. F. Italiano. Finding paths and deleting edges in directed acyclic graphs. Inform. Process. Lett., 28:51, 1988. J. A. McHugh. Algorithmic Graph Theory. Prentice
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1992/tr-92-059.ps.Z, 19920911 INTERNATIONAL COMPUTER SCIENCE INSTITUTE I 1947 Center Street ffl Suite 600 ffl Berkeley, California 94704 ffl 1-510-642-4274 ffl FAX 1-510-643-7684 Learning Topology-Preserving Maps Using Self-Supervised Backpropagation on a Parallel Machine Arnfried Ossen TR-92-059 September 1992
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1992/tr-92-062.ps.Z, 19920916 The Acquisition of Lexical Semantics for Spatial Terms: A Connectionist Model of Perceptual Categorization Terry Regier TR-92-062 September 1992
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1992/tr-92-060.ps.Z, 19920921 Ring Array Processor Programmer s Guide to the RAP Libraries Michael C. Greenspon September, 1992 TR-92-060 Realization Group International Computer Science Institute Programmer s Guide to the RAP Libraries V1.0 Copyright 1992 Realization Group International Computer Science Institute Berkeley, CA USA
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1991/tr-91-053.ps.Z, 19920925 Unification with ICSIM Franz Kurfess TR-91-053 August 1991
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1991/tr-91-055.ps.Z, 19920925 Potentiality of Parallelism in Logic Franz Kurfess TR-91-055
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1992/tr-92-063.ps.Z, 19920929 Block Korkin{Zolotarev Bases and Successive Minima C.P. Schnorr TR-92-063 September 1992
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1992/tr-92-052.ps.Z, 19920929 Improved Parallel Computations with Toeplitz-like and Hankel-like Matrices Dario Bini Victor Pany TR-92-052 September 1992
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1992/tr-92-051.ps.Z, 19920929 Improved Parallel Polynomial Division and Its Extensions Dario Bini Victor Pany TR-92-051 September 1992
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1992/tr-92-069.ps.Z, 19921016 - 0 - Inductive learning of compact rule sets by using efficient hypotheses reduction Thomas Koch1 TR 92-069 October 1992
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1991/tr-91-052.ps.Z, 19921019 CHCL - A Connectionist Inference System Steffen Holldobler Franz Kurfess FG Intellektik, FB Informatik International Computer Science Institute TH Darmstadt 1947 Center Street Alexanderstrasse 10 Suite 600 D-6100 Darmstadt Berkeley, CA 94704 Germany USA xiisshoe@ddathd21.bitnet
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1991/tr-91-054.ps.Z, 19921019 Knowledge Selection with ANNs Dimitris Karagiannis Franz J. Kurfess Heinz-Wilhelm Schmidty ICSI { International Computer Science Institute, Berkeley, CA 94704 August 1991
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1992/tr-92-070.ps.Z, 19921021 On Randomized Algebraic Test Complexity Peter Burgisser1 Marek Karpinski2 Thomas Lickteig3 TR-92-070 October, 1992
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1992/tr-92-071.ps.Z, 19921021 An Efficient Parallel Algorithm for Computing a Maximal Independent Set in a Hypergraph of Dimension 3 Elias Dahlhaus1 Marek Karpinski2 Peter Kelsen3 TR-92-071 October, 1992
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1992/tr-92-066.ps.Z, 19921021 INTERNATIONAL COMPUTER SCIENCE INSTITUTE I 1947 Center Street ffl Suite 600 ffl Berkeley, California 94704 ffl 1-510-642-4274 ffl FAX 1-510-643-7684 Physical Mapping of Chromosomes: A Combinatorial Problem in Molecular Biology Farid Alizadeh Richard M. Karp Lee A. Newberg Deborah K. Weisser TR-92-066
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1992/tr-92-074.ps.Z, 19921104 When is the Assignment Bound Tight for the Asymmetric Traveling-Salesman Problem Alan Frieze Richard M. Karpy Bruce Reedz TR-92-074 November 1992
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1992/tr-92-077.ps.Z, 19921130 Polynomial Uniform Convergence and Polynomial-Sample Learnability Alberto Bertoniy, Paola Campadelliy, Anna Morpurgoyz, and Sandra Panizzay TR-92-077 November 1992
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1992/tr-92-080.ps.Z, 19921219 q 1 Simulating Threshold Circuits by Majority Circuits Mikael Goldmann Marek Karpinski y TR-92-080 December 1992
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1992/tr-92-083.ps.Z, 19930108 Invariant Signatures and Non-Interactive Zero-Knowledge Proofs are Equivalent (extended abstract) Shafi Goldwasser Rafail Ostrovskyy TR-92-083 December 1992
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1993/tr-93-002.ps.Z, 19930115 Optimization Problems: Expressibility, Approximation Properties and Expected Asymptotic Growth of Optimal Solutions Thomas Behrendt Kevin Comptony Erich Gradel TR-93-002 January 1993
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1993/tr-93-007.ps.Z, 19930205 On Removing Randomness from a Parallel Algorithm for Minimum Cuts (Extended Abstract) Michael Luby Joseph Naor y Moni Naorz TR-93-007 February 1993
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1992/tr-92-075.ps.Z, 19930214 GENETIC AND NON GENETIC OPERATORS IN ALECSYS * Marco Dorigo+ TR-92-075 - Revised Version November 1992
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1993/tr-93-010.ps.Z, 19930305 Optimal Speedup of Las Vegas Algorithms Michael Lubyy Alistair Sinclairz David Zuckermanx TR-93-010 March 1993
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1993/tr-93-009.ps.Z, 19930305 On Deterministic Approximation of DNF Michael Luby Boban Veli<=ckovi cy TR-93-009 March 1993 The best throw of the die is to throw the die away Chinese fortune cookie
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1993/tr-93-011.ps.Z, 19930310 INTERNATIONAL COMPUTER SCIENCE INSTITUTE I 1947 Center Street ffl Suite 600 ffl Berkeley, California 94704 ffl 1-510-642-4274 ffl FAX 1-510-643-7684 Graceful Adaptation of Guaranteed Performance Service Connections. Colin J. Parris, Giorgio Ventrey and Hui Zhang The Tenet Group Computer Science
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1993/tr-93-008.ps.Z, 19930312 Galileo: a Tool for Simulation and Analysis of Real-Time Networks Edward W. Knightly and Giorgio Ventre y TR-93-008 March 1993
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1993/tr-93-014.ps.Z, 19930318 Optimal Recovery and n-Widths For Convex Classes of Functions Erich Novak TR-93-014 March 16, 1993
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1993/tr-93-013.ps.Z, 19930318 Optimal Stochastic Quadrature Formulas For Convex Functions Erich Novak and Knut Petras TR-93-013 March 15, 1993
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1993/tr-93-018.ps.Z, 19930325 INTERNATIONAL COMPUTER SCIENCE INSTITUTE I 1947 Center Street ffl Suite 600 ffl Berkeley, California 94704 ffl 1-510-642-4274 ffl FAX 1-510-643-7684 Navigation Without Perception of Coordinates and Distances Armin Hemmerling TR-93-018 March 1993
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1993/tr-93-019.ps.Z, 19930402 Matchings in Lattice Graphs Claire Kenyony Dana Randallz Alistair Sinclairx TR-93-019 March 1993
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1993/tr-93-004.ps.Z, 19930416 INTERNATIONAL COMPUTER SCIENCE INSTITUTE I 1947 Center Street ffl Suite 600 ffl Berkeley, California 94704 ffl 1-510-642-4274 ffl FAX 1-510-643-7684 Mixture Models and the EM Algorithm for Object Recognition within Compositional Hierarchies Part 1: Recognition Joachim Utans utans@icsi.berkeley.edu
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1993/tr-93-020.ps.Z, 19930418 INTERNATIONAL COMPUTER SCIENCE INSTITUTE I 1947 Center Street ffl Suite 600 ffl Berkeley, California 94704 ffl 1-510-642-4274 ffl FAX 1-510-643-7684 Design Principles of Parallel Operating Systems \|A Peace Case Study\| Wolfgang Schroder-Preikschat y TR-93-020 April 1993
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1993/tr-93-022.ps.Z, 19930524 A Multivalued Evolutionary Algorithm Hans{Michael Voigt , Joachim Born y & Ivan Santibanez{Koref y TR-93-022 April 1993
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1993/tr-93-030.ps.Z, 19930616 Sensitivity of Boolean Functions,
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1993/tr-93-034.ps.Z, 19930719 INTERNATIONAL COMPUTER SCIENCE INSTITUTE I 1947 Center Street ffl Suite 600 ffl Berkeley, California 94704 ffl 1-510-642-4274 ffl FAX 1-510-643-7684 On Lines Missing Polyhedral Sets in 3-Space Marco Pellegrini Dept. of Computer Science, King's College London TR-93-034 July 1993
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1993/tr-93-027.ps.Z, 19930723 A Stochastic Model of Actions and Plans for Anytime Planning under Uncertainty Sylvie Thi ebauxz Joachim Hertzbergx William Shoaff{ Moti Schneiderk TR-93-027 May 1993 Thanks to Gerd Brewka, Marie-Odile Cordier, Tom Gordon, Gerd Grosse, Eric Jacopin, Jurgen Paulokat, Eric Rutten, Josef Schneeberger, and
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1993/tr-93-033.ps.Z, 19930723 Turning an Action Formalism Into a Planner\| A Case Study Joachim Hertzbergz Sylvie Thi ebauxx TR-93-033 July 1993
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1993/tr-93-040.ps.Z, 19930813 Efficient PRAM Simulation on a Distributed Memory Machine Richard M. Karp University of California at Berkeley and International Computer Science Institute, Berkeley, CA Michael Lubyy International Computer Science Institute, Berkeley, CA and UC Berkeley Friedhelm Meyer auf der Heidez Heinz Nixdorf
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1993/tr-93-039.ps.Z, 19930823 INTERNATIONAL COMPUTER SCIENCE INSTITUTE I 1947 Center Street ffl Suite 600 ffl Berkeley, California 94704 ffl 1-510-642-4274 ffl FAX 1-510-643-7684 Building Convex Space Partitions Induced by Pairwise Interior-Disjoint Simplices Marco Pellegrini Dept. of Computer Science, King's College London
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1993/tr-93-045.ps.Z, 19930824 Sather Iters: Object-Oriented Iteration Abstraction Stephan Murer, Stephen Omohundro, and Clemens Szyperski The International Computer Science Institute 1947 Center St, Suite 600 Berkeley, CA 94704 Email: fmurer, om, szyperskig@icsi.berkeley.edu TR-93-045 August 1993
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1993/tr-93-044.ps.Z, 19930824 INTERNATIONAL COMPUTER SCIENCE INSTITUTE I 1947 Center Street ffl Suite 600 ffl Berkeley, California 94704 ffl 1-510-642-4274 ffl FAX 1-510-643-7684 An application of a neural net for fuzzy abductive reasoning Matthias Kaiser TR-93-044 August 1993
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1993/tr-93-047.ps.Z, 19930827 Source-to-Source Code Generation Based on Pattern Matching and Dynamic Programming Weimin Chen , Volker Turau TR-93-047 August, 1993
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1993/tr-93-041.ps.Z, 19930916 Optimal Parallelization of Las Vegas Algorithms Michael Lubyy Wolfgang Ertelz TR-93-041 September 1993
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1993/tr-93-050.ps.Z, 19930921 INTERNATIONAL COMPUTER SCIENCE INSTITUTE I 1947 Center Street ffl Suite 600 ffl Berkeley, California 94704 ffl 1-510-642-4274 ffl FAX 1-510-643-7684 Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization y Farid Alizadehz TR-93-050 September 1, 1993
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1993/tr-93-055.ps.Z, 19930923 rac epartment of omputer cience, niversity of alifornia at erkeley. upported in part by an A h ellowship and by grant 13 32. mail . niversity of dinburgh and nternational omputer cience nstitute, erkeley. upported in part by grant 3 3 of the cience and ngineering esearch ouncil, and by sprit orking roup
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1993/tr-93-046.ps.Z, 19930927 INTERNATIONAL COMPUTER SCIENCE INSTITUTE I 1947 Center Street ffl Suite 600 ffl Berkeley, California 94704 ffl 1-510-642-4274 ffl FAX 1-510-643-7684 A Performance Analysis of the CNS-1 on Large, Dense Backpropagation Networks Connectionist Network Supercomputer Silvia M. Muller
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1993/tr-93-056.ps.Z, 19931019 Dynamic Join and Leave for Real-Time Multicast Wolfgang Effelsberg, Eberhard Muller-Menrad International Computer Science Institute 1947 Center Street Berkeley, California 94704 effelsberg@pi4.informatik.uni-mannheim.de TR-93-056 October 1993
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1993/tr-93-063-titlepage.ps.Z, 19931027 A Parallel Object-Oriented System for Realizing Reusable and Efficient Data Abstractions Chu-Cheow Lim TR-93-063 October 1993
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1993/tr-93-063.ps.Z, 19931027 iii Acknowledgements I would like to thank my advisors Abhiram Ranade and Jerry Feldman for providing the advice, support and encouragement throughout the years, and for directing me to the Sather project in the first place. I would like to acknowledgement the financial support from the International
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1993/tr-93-052.ps.Z, 19931028 The Structural Complexity Column by Juris HARTMANIS Cornell University, Department of Computer Science Ithaca, NY 14853, USA RECENT PROGRESS IN INFORMATION{BASED COMPLEXITY J. F. Traub1 H. Wo zniakowski1:2 1Department of Computer Science Columbia University New York, New York 10027 2Institute of Applied
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1993/tr-93-064.ps.Z, 19931103 Engineering a Programming Language: The Type and Class System of Sather Clemens Szypersky Stephen Omohundroy Stephan Murerz TR-93-064 November 1993
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1993/tr-93-066.ps.Z, 19931104 Recovering Guaranteed Performance Service Connections from Single and Multiple Faults Anindo Banerjea, Colin J. Parris, and Domenico Ferrari. Tenet Group Computer Science Division, UC Berkeley and International Computer Science Institute, 1947 Center St. , Suite 600 Berkeley, CA 94704-1105. Tel:
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1993/tr-93-068.ps.Z, 19931118 INTERNATIONAL COMPUTER SCIENCE INSTITUTE I 1947 Center Street ffl Suite 600 ffl Berkeley, California 94704 ffl 1-510-642-4274 ffl FAX 1-510-643-7684 Lexical Modeling in a Speaker Independent Speech Understanding System Charles Clayton Wooters TR-93-068 November 1993
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1993/tr-93-072.ps.Z, 19931124 Software Protection and Simulation on Oblivious RAMs Oded Goldreich Rafail Ostrovskyy TR-93-072 November 1993
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1993/tr-93-038.ps.Z, 19931125 INTERNATIONAL COMPUTER SCIENCE INSTITUTE I 1947 Center Street ffl Suite 600 ffl Berkeley, California 94704 ffl 1-510-642-4274 ffl FAX 1-510-643-7684 Exploitation of Structured Gating Connections for the Normalization of a Visual Pattern Alessandro Sperduti TR-93-038
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1993/tr-93-059.ps.Z, 19931126 INTERNATIONAL COMPUTER SCIENCE INSTITUTE I 1947 Center Street ffl Suite 600 ffl Berkeley, California 94704 ffl 1-510-642-4274 ffl FAX 1-510-643-7684 Constructive Deterministic PRAM Simulation on a Mesh-Connected Computer A. Pietracaprinay G. Puccizx J.F. Sibeyn{ TR-93-059 October 1993
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1993/tr-93-023.ps.Z, 19931127 TRAINING AGENTS TO PERFORM SEQUENTIAL BEHAVIOR* Marco Colombetti+ Marco Dorigo# TR-93-023 September 1993
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1993/tr-93-067.ps.Z, 19931202 A Software Reuse System for C Codes Le van Huu TR-93-067 December 2, 1993
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1993/tr-93-028.ps.Z, 19931202 pSather: Layered Extensions to an Object-Oriented Language for Efficient Parallel Computation Stephan Murer Jerome A. Feldmany Chu-Cheow Limz Martina-Maria Seidelx TR-93-028 (2nd revised edition) December 1993
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1993/tr-93-070.ps.Z, 19931207 An Alphabet{Independent Optimal Parallel Search for Three Dimensional Patterns Marek Karpinski1 Wojciech Rytter2 TR{93{070 November, 1993
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1993/tr-93-071.ps.Z, 19931207 Lower Bounds on Testing Membership to a Polyhedron by Algebraic Decision Trees Dima Grigoriev1 Marek Karpinski2 Nicolai Vorobjov3 TR{93{071 November, 1993
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1993/tr-93-042.ps.Z, 19931207 Lower Bounds on Complexity of Testing Membership to a Polygon for Algebraic and Randomized Decision Trees Dima Grigoriev1 Marek Karpinski2 TR{93{042 August, 1993
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1993/tr-93-057.ps.Z, 19931209 Second Order Backpropagation \| Efficient Computation of the Hessian Matrix for Neural Networks Ra ul Rojas TR-93-057 28 September 1993
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1993/tr-93-049.ps.Z, 19931209 i er ei k ri ian in el a er T A tra t A new definition is given for the average growth of a function f : IN with respect to a probability measure on . This allows us to define meaningful average case distributional complexity classes for arbitrary time bounds (previously, one could not guarantee
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1993/tr-93-082.ps.Z, 19931209 INTERNATIONAL COMPUTER SCIENCE INSTITUTE I 1947 Center Street ffl Suite 600 ffl Berkeley, California 94704 ffl 1-510-642-4274 ffl FAX 1-510-643-7684 All-to-all Broadcast on the CNS-1 Silvia M. Mullery TR-93-082 December 1993
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1993/tr-93-048.ps.Z, 19931209 e u lo ari ic ace orl e or s. space complexity, sublogarithmic complexity bounds, alternating Turing machines, halting computations, complementation of languages, complexity hierachies, closure properties, context-free languages, bounded languages. S S s e t lassifi ations. 68 05, 68 10, 68 25, 68 45 1
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1993/tr-93-069.ps.Z, 19931210 On the Definition of Speedup Wolfgang Ertel TR-93-069 December 1993
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1993/tr-93-081.ps.Z, 19931213 On Valve Adjustments that Interrupt all s-t-Paths in a Digraph U l r i c h H u c k e n b e c k 1) TR{93{081 December, 1993
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1993/tr-93-080.ps.Z, 19931215 Dynamic Programming in a Generalized Decision Model U l r i c h H u c k e n b e c k 1) TR{93{080 December, 1993
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1993/tr-93-074.ps.Z, 19931221 How and When to Be Unique Extended Abstract Shay Kutteny Rafail Ostrovskyz Boaz Patt-Shamirx TR-93-074 November, 1993
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1993/tr-93-075.ps.Z, 19931221 Matching nuts and bolts (Extended Abstract) Noga Alon y Manuel Blum z Amos Fiat x Sampath Kannan { Moni Naork Rafail Ostrovsky TR-93-075 Novemeber, 1993
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1993/tr-93-076.ps.Z, 19931221 Any Non-Private Boolean Function Is Complete For Private Multi-Party Computations Eyal Kushilevitz Silvio Micaliy Rafail Ostrovskyz TR-93-076 Novemeber, 1993
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1994/tr-94-001.ps.Z, 19940112 INTERNATIONAL COMPUTER SCIENCE INSTITUTE I 1947 Center Street ffl Suite 600 ffl Berkeley, California 94704 ffl 1-510-642-4274 ffl FAX 1-510-643-7684 Surface Learning with Applications to Lipreading Christoph Bregler and Stephen Omohundro TR-94-001 January 1994
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1994/tr-94-002.ps.Z, 19940112 INTERNATIONAL COMPUTER SCIENCE INSTITUTE I 1947 Center Street ffl Suite 600 ffl Berkeley, California 94704 ffl 1-510-642-4274 ffl FAX 1-510-643-7684 Eigenlips" for Robust Speech Recognition Christoph Bregler and Yochai Konig TR-94-002 January 1994
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1994/tr-94-006.ps.Z, 19940127 On Variable Ordering of Ordered Functional Decision Diagrams Bernd Becker Rolf Drechslery Michael Theobaldy TR-94-006
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1994/tr-94-004.ps.Z, 19940127 INTERNATIONAL COMPUTER SCIENCE INSTITUTE I 1947 Center Street ffl Suite 600 ffl Berkeley, California 94704 ffl 1-510-642-4274 ffl FAX 1-510-643-7684 Near or Far Hermann Hartig TR-94-004
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1994/tr-94-005.ps.Z, 19940127 On the Relation Between BDDs and FDDs (Extended Abstract) Bernd Becker Rolf Drechslery Ralph Werchnery TR-94-005 Fachbereich 20 - Informatik, J.W.Goethe-Universitat, D-60054 Frankfurt, and International Computer Science Institute, Berkeley, CA 94707; email: becker@informatik.uni-frankfurt.de y
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1994/tr-94-008.ps.Z, 19940129 A Hybrid Fault Simulator for Synchronous Sequential Circuits Rolf Kriegery Bernd Becker Martin Keimy TR-94-008
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1994/tr-94-009.ps.Z, 19940203 INTERNATIONAL COMPUTER SCIENCE INSTITUTE I 1947 Center St. ffl Suite 600 ffl Berkeley, California 94704-1198 ffl (510) 643-9153 ffl FAX (510) 643-7684 A Performance Analysis of CNS-1 on Sparse Connectionist Networks Silvia M. Mullery and Benedict Gomesz TR-94-009 February 1994
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1994/tr-94-012.ps.Z, 19940303 Contents 1 Introduction 1 1.1 Introduction to Stochastic Speech Modeling : : : : : : : : : : : : : : : : 1 1.2 What is wrong with traditional HMMs : : : : : : : : : : : : : : : : : : 2 1.3 Preview : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 3 2 Related Work 3 2.1 Introduction to
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1993/tr-93-058.ps.Z, 19940303 INTERNATIONAL COMPUTER SCIENCE INSTITUTE I 1947 Center St. ffl Suite 600 ffl Berkeley, California 94704-1198 ffl (510) 643-9153 ffl FAX (510) 643-7684 Towards a cognitively based approach of a description of spatial deixis Matthias Kaiser TR{93-058 11.03.1993
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1993/tr-93-043.ps.Z, 19940309 Finite Branching Processes and AND/OR Tree Evaluation Richard M. Karp Yanjun Zhangy TR-93-043 March 1994
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1994/tr-94-014.ps.Z, 19940323 Integration of Bottom{Up and Top{Down Cues for Visual Attention Using Non{Linear Relaxation Ruggero Milanese Harry Wechsler Sylvia Gil Jean{Marc Bost Thierry Pun TR-94-014 March 1994
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1994/tr-94-013.ps.Z, 19940325 Processing Joins with User-Defined Functions Volker Gaede and Oliver Gunther Institut fur Wirtschaftsinformatik Humboldt-Universitat zu Berlin Spandauer Str. 1 10178 Berlin, Germany fgaede,guentherg@wiwi.hu-berlin.de
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1994/tr-94-015.ps.Z, 19940331 INTERNATIONAL COMPUTER SCIENCE INSTITUTE I 1947 Center St. ffl Suite 600 ffl Berkeley, California 94704-1198 ffl (510) 643-9153 ffl FAX (510) 643-7684 Designing and Integrating User Interfaces of Geographic Database Applications Agn es Voisard TR-94-015 March 1994
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1994/tr-94-010.ps.Z, 19940331 A Customisable Memory Management Framework Giuseppe Attardi Tito Flagella y TR-94-010 February 1994
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1994/tr-94-017.ps.Z, 19940418 Black Box Cryptanalysis of Hash Networks based on Multipermutations C.P. Schnorr Fachbereich Mathematik/Informatik Universitat Frankfurt Postfach 111932 60054 Frankfurt a.M. e-mail: schnorr@informatik.uni-frankfurt.de S. Vaudenay D ep. Math. Inf. ENS Paris 45 Rue d'Ulm 75230-05 Paris e-mail:
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1994/tr-94-019.ps.Z, 19940420 A Preliminary Study of the Semantics of Reduplication Terry Regier TR-94-019 April 1994
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1994/tr-94-016.ps.Z, 19940425 A stable integer relation algorithm Preliminary Version Carsten Rossner and Claus P. Schnorry FB Mathematik / Informatik, Universitat Frankfurt, Postfach 11 19 32, 60054 Frankfurt am Main, Germany TR-94-016 April 1994
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1994/tr-94-007.ps.Z, 19940429 INTERNATIONAL COMPUTER SCIENCE INSTITUTE I 1947 Center St. ffl Suite 600 ffl Berkeley, California 94704-1198 ffl (510) 643-9153 ffl FAX (510) 643-7684 Precise n-gram Probabilities from Stochastic Context-free Grammars Andreas Stolcke Jonathan Segaly TR-94-007 January 1994 (Revised April 1994)
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1994/tr-94-003.ps.Z, 19940430 INTERNATIONAL COMPUTER SCIENCE INSTITUTE I 1947 Center St. ffl Suite 600 ffl Berkeley, California 94704-1198 ffl (510) 643-9153 ffl FAX (510) 643-7684 Best-first Model Merging for Hidden Markov Model Induction Andreas Stolcke Stephen M. Omohundroy TR-94-003 January 1994 Revised April 1994
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1994/tr-94-021.ps.Z, 19940509 arsi ral r s i i lic a c i is r ac s hristel e e I I, er ele , -11 , . . . I, - 12 aar ruc en, . . . e- ail: e e icsi. er ele .e u - - 21 a 1 bstract In t is a er e s est c inin s ic an s s ic a r ac es in r er t i ast arsers ase n c nte t- ree ra ars. - ase arsers e n n in rti cia Inte i ence I an
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1994/tr-94-022.ps.Z, 19940525 INTERNATIONAL COMPUTER SCIENCE INSTITUTE I 1947 Center St. ffl Suite 600 ffl Berkeley, California 94704-1198 ffl (510) 643-9153 ffl FAX (510) 643-7684 On the Relationship between Synthesizing and Tagging Hans Werner Guesgen TR-94-022 May 1994
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1994/tr-94-026.ps.Z, 19940606 INTERNATIONAL COMPUTER SCIENCE INSTITUTE 1947 Center St. ffl Suite 600 ffl Berkeley, California 94704-1198 ffl (510) 643-9153 ffl FAX (510) 643-7684 A Formal Framework for Weak Constraint Satisfaction Based on Fuzzy Sets Hans Werner Guesgen TR-94-026 June 1994
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1994/tr-94-032.ps.Z, 19940803 Detection of Side_Effects in Function Procedures Robert Griesemer International Computer Science Institute, Berkeley gri@icsi.berkeley.edu TR-94-032 August 1994
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1994/tr-94-036.ps.Z, 19940803 On finding a minimal enclosing parallelogram Christian Schwarz Jurgen Teichy Emo Welzlz Brian Evansy TR-94-036 August 1994
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1994/tr-94-031.ps.Z, 19940816 INTERNATIONAL COMPUTER SCIENCE INSTITUTE I 1947 Center St. ffl Suite 600 ffl Berkeley, California 94704-1198 ffl (510) 643-9153 ffl FAX (510) 643-7684 Massively Parallel Real-Time Reasoning with Very Large Knowledge Bases: An Interim Report D. R. Mani Lokendra Shastriy TR-94-031 August 1994
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1994/tr-94-025.ps.Z, 19940819 Fast and Efficient Parallel Algorithms for Problems in Control Theory Bruno Codenottiy Biswa N. Dattaz Karabi Dattaz Mauro Leoncinix TR-94-025 August 1994
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1994/tr-94-044.ps.Z, 19940825 INTERNATIONAL COMPUTER SCIENCE INSTITUTE I 1947 Center St. ffl Suite 600 ffl Berkeley, California 94704-1198 ffl (510) 643-9153 ffl FAX (510) 643-7684 Feature Binding through Synchronized Neuronal Oscillations: A Preliminary Study Ruggero Milanese TR-94-044 August 1994
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1994/tr-94-035.ps.Z, 19940825 Output Sets, Halting Sets and an Arithmetical Hierarchy for Ordered Subrings of the Real Numbers under Blum/Shub/Smale Computation Rose Saint John TR-94-035 15 August 1994
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1994/tr-94-034.ps.Z, 19940825 Design and Analysis of a High-Performance Packet Multiplexer for Multiservice Networks with Delay Guarantees Jorg Liebeherry Dallas E. Wregey TR-94-034 August 1994
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1994/tr-94-018.ps.Z, 19940825 1 GRASP PLANNING & FORCE COMPUTATION FOR DEXTROUS OBJECT MANIPULATION WITH MULTI-FINGER ROBOT HANDSG nter W hlkeINTERNATIONAL COMPUTER SCIENCE INSTITUTE 1947 Center St., Suite 600, Berkeley, California 94704-1198, USA Technical Report TR-94-018 (revised version)August 1994Abstract This paper deals with
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1994/tr-94-033.ps.Z, 19940826 Exact Admission Control for Networks with Bounded Delay Services Jorg Liebeherry Dallas E. Wregey Domenico Ferrari TR-94-033 August 1994
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1994/tr-94-046.ps.Z, 19940906 INTERNATIONAL COMPUTER SCIENCE INSTITUTE I 1947 Center St. ffl Suite 600 ffl Berkeley, California 94704-1198 ffl (510) 643-9153 ffl FAX (510) 643-7684 Object Oriented Design of a BP Neural Network Simulator and Implementation on the Connection Machine (CM-5) J.M.Adamo y D.Anguita z TR-94-46 September
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1994/tr-94-048.ps.Z, 19940907 Comparison of Rate-Controlled Static Priority and Stop-and-Go Hui Zhangy and Edward W. Knightly z y Lawrence Berkeley Laboratory z ICSI and EECS Department, U.C. Berkeley TR-94-048
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1994/tr-94-038.ps.Z, 19940917 INTERNATIONAL COMPUTER SCIENCE INSTITUTE I 1947 Center St. ffl Suite 600 ffl Berkeley, California 94704-1198 ffl (510) 643-9153 ffl FAX (510) 643-7684 MBP on T0: mixing floating- and fixed-point formats in BP learning Davide Anguita y Benedict A. Gomes z TR-94-038 August 1994
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1994/tr-94-045.ps.Z, 19940920 INTERNATIONAL COMPUTER SCIENCE INSTITUTE I 1947 Center St. ffl Suite 600 ffl Berkeley, California 94704-1198 ffl (510) 643-9153 ffl FAX (510) 643-7684 Development of Parallel BLAS with ARCH Object-Oriented Parallel Library, Implementation on CM-5 J.M. Adamo y TR-94-045 September 1994
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1994/tr-94-041.ps.Z, 19941019 Approaching the 5=4{Approximation for Rectilinear Steiner Trees Piotr Berman1 Ulrich Fossmeier2 Marek Karpinski3 Michael Kaufmann4 Alexander Zelikovsky5 TR{94{041 August, 1994
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1994/tr-94-042.ps.Z, 19941019 Counting Curves and Their Projections Joachim von zur Gathen1 Marek Karpinski2 Igor Shparlinski3 TR{94{042 August, 1994
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1994/tr-94-043.ps.Z, 19941019 On the Computational Complexity of Matching on Chordal and Strongly Chordal Graphs Elias Dahlhaus1 Marek Karpinski2 TR{94{043 August, 1994
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1994/tr-94-051.ps.Z, 19941026 Evaluation of resource sharing benefits Amit Gupta, Wingwai Howe, Mark Moran, Quyen Nguyen famit,whowe,moran,nguyenqg@tenet.Berkeley.EDU Tenet Group University of California at Berkeley, & International Computer Science Institute TR-94-051 October 1994
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1994/tr-94-050.ps.Z, 19941026 Scalable resource reservation for multi-party real-time communication Amit Gupta, Wingwai Howe, Mark Moran, Quyen Nguyen famit,whowe,moran,nguyenqg@tenet.Berkeley.EDU Tenet Group University of California at Berkeley, & International Computer Science Institute TR-94-050 October 1994
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1994/tr-94-053.ps.Z, 19941028 INTERNATIONAL COMPUTER SCIENCE INSTITUTE I 1947 Center St. ffl Suite 600 ffl Berkeley, California 94704-1198 ffl (510) 643-9153 ffl FAX (510) 643-7684 Software Reliability via Run-Time Result-Checking Manuel Blumy Hal Wassermanz TR-94-053 October 1994
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1994/tr-94-054.ps.Z, 19941031 Therapy Plan Generation in Complex Dynamic Environments Oksana Arnoldy and Klaus P. Jantkez TR-94-054 October 1994
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1994/tr-94-055.ps.Z, 19941101 INTERNATIONAL COMPUTER SCIENCE INSTITUTE I 1947 Center St. ffl Suite 600 ffl Berkeley, California 94704-1198 ffl (510) 643-9153 ffl FAX (510) 643-7684 Counting in Lattices: Combinatorial Problems from Statistical Mechanics Dana Randall TR-94-055 October 1994
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1994/tr-94-057.ps.Z, 19941104 1 Information Theory and Noisy Computation William S. Evans1 TR-94-057 November, 1994
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1994/tr-94-058.ps.Z, 19941109 Hierarchical Encoding of MPEG Sequences Using Priority Encoding Transmission (PET) Christian Leicher The International Computer Science Institute Berkeley,CA Lehrstuhl f r Kommunikationsnetze Technische Universit t M nchen TR-94-058 November 1994 - i -
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1994/tr-94-063.ps.Z, 19941128 I I I I I r . r r - - - A stract (2 + ffl)- (1 ffl2) (1) - (1 + ffl)- (( )(( ) ffl)2) 2- ( 2 ( )) ( 2 2 + 3 1:5) (2 + ffl)- ( ffl) ntroduction Computing the connectivity of a graph is a fundamental problem with applications to chip design, system reliability, and communications networks. Since in many
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1994/tr-94-056.ps.Z, 19941129 INTERNATIONAL COMPUTER SCIENCE INSTITUTE I 1947 Center St. ffl Suite 600 ffl Berkeley, California 94704-1198 ffl (510) 643-9153 ffl FAX (510) 643-7684 Multi-level Architecture of object-oriented Operating Systems Sven Graupner, Winfried Kalfa, Frank Schubert TR-94-056 November 1994
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1994/tr-94-062.ps.Z, 19941206 INTERNATIONAL COMPUTER SCIENCE INSTITUTE I 1947 Center St. ffl Suite 600 ffl Berkeley, California 94704-1198 ffl (510) 643-9153 ffl FAX (510) 643-7684 Sather 1.0 Tutorial Michael Philippsen phlipp @ icsi.berkeley.edu TR-94-062 Version 0.1, December 1994
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1994/tr-94-066.ps.Z, 19941230 INTERNATIONAL COMPUTER SCIENCE INSTITUTE I 1947 Center St. ffl Suite 600 ffl Berkeley, California 94704-1198 ffl (510) 643-9153 ffl FAX (510) 643-7684 Side Effect Free Functions in Object-Oriented Languages Roberto Ierusalimschy Noemi Rodriguez TR-94-066 December 1994
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1995/tr-95-001.ps.Z, 19950110 Polynomial Bounds for VC Dimension of Sigmoidal Neural Networks Marek Karpinski1 Angus Macintyre2 TR{95{001 January 1995
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1990/tr-90-047.ps.Z, 19950123 The Ring Array Processor (RAP): Algorithms and Architecture Nelson Morgan International Computer Science Institute 1947 Center Street, Suite 600 Berkeley, CA94704-1105, USA BACKGROUND In our speech recognition research, we have been experimenting with layered "neural" algorithms as probabilistic
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1995/tr-95-003.ps.Z, 19950125 Understanding Radio Broadcasts On Soccer: The Concept `Mental Image' and Its Use in Spatial Reasoning Jorg R.J. Schirra TR-95-003 January 1995
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1994/tr-94-069.ps.Z, 19950201 A HIGH PERFORMANCE TOTALLY ORDERED MULTICAST PROTOCOL Brian Whetten, University of California at Berkeley (whetten@cs.berkeley.edu) Todd Montgomery, West Virginia University (tmont@cerc.wvu.edu) Simon Kaplan, University of Illinois at Champaign-Urbana (kaplan@cs.uiuc.edu)
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1994/tr-94-071.ps.Z, 19950214 Improved Randomized On-Line Algorithms for the List Update Problem Susanne Albers TR-94-071
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1995/tr-95-006.ps.Z, 19950223 A Fast Parallel Cholesky Decomposition Algorithm for Tridiagonal Symmetric Matrices Ilan Bar-Ony Bruno Codenottiz Mauro Leoncinix TR-95-006 February 1995
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1995/tr-95-007.ps.Z, 19950223 INTERNATIONAL COMPUTER SCIENCE INSTITUTE I 1947 Center St. ffl Suite 600 ffl Berkeley, California 94704-1198 ffl (510) 643-9153 ffl FAX (510) 643-7684 Characterization of Video Traffic Rahul Garg rahul@cs.berkeley.edu The Tenet Group Computer Science Division Department of Electrical Engineering and
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1994/tr-94-047.ps.Z, 19950306 Traffic Characterization and Switch Utilization using a Deterministic Bounding Interval Dependent Traffic Model Edward W. Knightly y and Hui Zhang z y ICSI and EECS Department, U.C. Berkeley z School of Computer Science, CMU TR-94-047
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1995/tr-95-009.ps.Z, 19950316 INTERNATIONAL COMPUTER SCIENCE INSTITUTE I 1947 Center St. ffl Suite 600 ffl Berkeley, California 94704-1198 ffl (510) 643-9153 ffl FAX (510) 643-7684 Adaptive Parameter Pruning in Neural Networks Lutz Prechelt TR-95-009 March 1995
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1995/tr-95-013.ps.Z, 19950328 Communication Performance Models Stefan B cking International Computer Science Institute, Berkeley TR-95-013 March 1995
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1995/tr-95-010.ps.Z, 19950331 1.757 and 1.267-Approximation Algorithms for the Network and Rectilinear Steiner Tree Problems Marek Karpinski Alexander Zelikovsky y TR-95-010 March 1995
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1993/tr-93-065.ps.Z, 19950422 INTERNATIONAL COMPUTER SCIENCE INSTITUTE I 1947 Center St. ffl Suite 600 ffl Berkeley, California 94704-1198 ffl (510) 643-9153 ffl FAX (510) 643-7684 An Efficient Probabilistic Context-Free Parsing Algorithm that Computes Prefix Probabilities Andreas Stolcke TR-93-065 November 1993 (Revised April 1995)
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1995/tr-95-016.ps.Z, 19950428 INTERNATIONAL COMPUTER SCIENCE INSTITUTE I 1947 Center St. ffl Suite 600 ffl Berkeley, California 94704-1198 ffl (510) 643-9153 ffl FAX (510) 643-7684 A Combined BIT and TIMESTAMP Algorithm for the List Update Problem Susanne Albers, Bernhard von Stengel, Ralph Werchner TR-95-016 April 27, 1995 Email:
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1995/tr-95-020.ps.Z, 19950509 Average Case Analysis of Dynamic Graph Algorithms 25 R. E. Tarjan. Data Structures and Network Algorithms, volume 44 of CBMS-NSF Regional Conference Series in Applied Mathematics. Society for Industrial and Applied Mathematics, Philadelphia, Pennsylvania, 1983. R. Thurimella. Techniques for
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1995/tr-95-024.ps.Z, 19950530 INTERNATIONAL COMPUTER SCIENCE INSTITUTE I 1947 Center St. ffl Suite 600 ffl Berkeley, California 94704-1198 ffl (510) 643-9153 ffl FAX (510) 643-7684 Applying Large Vocabulary Hybrid HMM-MLP Methods to Telephone Recognition of Digits and Natural Numbers Kristine W. Ma TR-95-024 May 1995
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1995/tr-95-026.ps.Z, 19950601 Differential Evolution Design of an IIR-Filter with Requirements for Magnitude and Group Delay by Rainer Storn1) TR-95-026 June 1995
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1995/tr-95-023.ps.Z, 19950608 INTERNATIONAL COMPUTER SCIENCE INSTITUTE 1947 Center St. Suite 600 Berkeley, California 94704-1198 (510) 643-9153 FAX (510) 643-7684 Properties of Stochastic Perceptual Auditory-event-based Models for Automatic Speech Recognition Su-Lin Wu TR-95-023 May 1995
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1995/tr-95-031.ps.Z, 19950711 Parallel Sorting With Limited Bandwidth Micah Adler John W Byersy Richard M Karpz TR-TR-95-031 July 1995
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1994/tr-94-070.ps.Z, 19950724 INTERNATIONAL COMPUTER SCIENCE INSTITUTE I 1947 Center St. ffl Suite 600 ffl Berkeley, California 94704-1198 ffl (510) 643-9153 ffl FAX (510) 643-7684 Automatic Alignment of Array Data and Processes To Reduce Communication Time on DMPPs Michael Philippsen phlipp @ icsi.berkeley.edu TR-94-070 July 1995
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1995/tr-95-033.ps.Z, 19950727 Smoothing and Multiplexing Tradeoffs for Deterministic Performance Guarantees to VBR Video Edward W. Knightlyy and Paola Rossaro yAlso with EECS Department, U.C. Berkeley TR-95-033
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1995/tr-95-030.ps.Z, 19950728 INTERNATIONAL COMPUTER SCIENCE INSTITUTE I 1947 Center St. ffl Suite 600 ffl Berkeley, California 94704-1198 ffl (510) 643-9153 ffl FAX (510) 643-7684 Growing a Hypercubical Output Space in a Self-Organizing Feature Map H.-U. Bauer , Th. Villmann y TR-95-030 July 1995 Permanent Adress: Institut fur
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1995/tr-95-035.ps.Z, 19950803 Pairwise Independence and Derandomization Michael Luby and Avi Wigderson July, 1995 International Computer Science Institute TR-95-035
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1995/tr-95-039.ps.Z, 19950808 Average Case Analyses of List Update Algorithms, with Applications to Data Compression Susanne Albers Michael Mitzenmachery TR-95-039
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1995/tr-95-038.ps.Z, 19950808 _____________________________________________________ + Dipartimento di Matematica ed Applicazioni, University of Palermo, Via Archirafi 34 - 90123 Palermo, ITALY digesu@ipamat.math.unipa.it, isgro@ipamat.math.unipa.it * ICSI, USA - digesu@icsi.berkeley.edu # Department of Computing and Electrical
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1995/tr-95-036.ps.Z, 19950809 New Approximation Algorithms for the Steiner Tree Problems Marek Karpinski Alexander Zelikovsky y TR-95-036 August 1995
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1995/tr-95-042.ps.Z, 19950822 Complexity and Real Computation: A Manifesto Lenore Blumy Felipe Cuckerzk Mike Shubxk Steve Smale{k TR-95-042
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1995/tr-95-044.ps.Z, 19950823 INTERNATIONAL COMPUTER SCIENCE INSTITUTE I 1947 Center St. ffl Suite 600 ffl Berkeley, California 94704-1198 ffl (510) 643-9153 ffl FAX (510) 643-7684 Complexity of Searching an Immobile Hider in a Graph Bernhard von Stengel and Ralph Werchner TR-95-044 August 22, 1995 Email: fstengel,
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1995/tr-95-047.ps.Z, 19950824 The Implementation of PET Bernd Lamparter Malik Kalfane TR-95-047 August 1995
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1995/tr-95-046.ps.Z, 19950824 PET - Priority Encoding Transmission: A New, Robust and Efficient Video Broadcast Technology Bernd Lamparter Andres Albanese Malik Kalfane Michael Luby TR-95-046 August 1995
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1995/tr-95-049.ps.Z, 19950828 INTERNATIONAL COMPUTER SCIENCE INSTITUTE I 1947 Center St. ffl Suite 600 ffl Berkeley, California 94704-1198 ffl (510) 643-9153 ffl FAX (510) 643-7684 Imperative Concurrent Object-Oriented Languages: An Annotated Bibliography Michael Philippsen phlipp @ icsi.berkeley.edu TR-95-049 Version 0, August 1995
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1995/tr-95-050.ps.Z, 19950828 INTERNATIONAL COMPUTER SCIENCE INSTITUTE I 1947 Center St. ffl Suite 600 ffl Berkeley, California 94704-1198 ffl (510) 643-9153 ffl FAX (510) 643-7684 Imperative Concurrent Object-Oriented Languages Michael Philippsen phlipp @ icsi.berkeley.edu TR-95-050 Part I, Version 0, August 1995
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1995/tr-95-011.ps.Z, 19950829 Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems Sanjeev Arora David Karger y Marek Karpinski z TR-95-011 March 1995
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1995/tr-95-048.ps.Z, 19950830 An XOR-Based Erasure-Resilient Coding Scheme Johannes Blomer , Malik Kalfaney, Richard Karp Marek Karpinskiz, Michael Lubyx, David Zuckerman{ TR-95-048 August 1995 Copyright c International Computer Science Institute. All rights reserved. Patent Pending.
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1995/tr-95-041.ps.Z, 19950831 INTERNATIONAL COMPUTER SCIENCE INSTITUTE I 1947 Center St. ffl Suite 600 ffl Berkeley, California 94704-1198 ffl (510) 643-9153 ffl FAX (510) 643-7684 Dealing with negated knowledge and inconsistency in a neurally motivated model of memory and reflexive reasoning Lokendra Shastri and Dean Jeffrey
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1995/tr-95-051.ps.Z, 19950831 INTERNATIONAL COMPUTER SCIENCE INSTITUTE I 1947 Center St. ffl Suite 600 ffl Berkeley, California 94704-1198 ffl (510) 643-9153 ffl FAX (510) 643-7684 A Security Architecture for Tenet Scheme 2 Rolf Oppliger Amit Gupta Mark Moran Riccardo Bettati TR-95-051 August 1995
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1995/tr-95-052.ps.Z, 19950908 INTERNATIONAL COMPUTER SCIENCE INSTITUTE I 1947 Center St. ffl Suite 600 ffl Berkeley, California 94704-1198 ffl (510) 643-9153 ffl FAX (510) 643-7684 Reactive Local Search for the Maximum Clique Problem R. Battiti M. Protasi y TR-95-052 September 1995
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1995/tr-95-053.ps.Z, 19950914 INTERNATIONAL COMPUTER SCIENCE INSTITUTE I 1947 Center St. ffl Suite 600 ffl Berkeley, California 94704-1198 ffl (510) 643-9153 ffl FAX (510) 643-7684 Efficient Implementation of Multi-Methods through static analysis Volker Turau Weimin Cheny TR-95-053 September 1995
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1995/tr-95-055.ps.Z, 19950925 INTERNATIONAL COMPUTER SCIENCE INSTITUTE 1947 Center St. ffl Suite 600 ffl Berkeley, California 94704-1198 ffl (510) 643-9153 ffl FAX (510) 643-7684 Noisy Information and Computational Complexity: A Short Survey Leszek Plaskota TR-95-055 September 1995
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1995/tr-95-056.ps.Z, 19950925 INTERNATIONAL COMPUTER SCIENCE INSTITUTE 1947 Center St. ffl Suite 600 ffl Berkeley, California 94704-1198 ffl (510) 643-9153 ffl FAX (510) 643-7684 How to benefit from noise Leszek Plaskota TR-95-056 September 1995
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1995/tr-95-054.ps.Z, 19950925 INTERNATIONAL COMPUTER SCIENCE INSTITUTE I 1947 Center St. ffl Suite 600 ffl Berkeley, California 94704-1198 ffl (510) 643-9153 ffl FAX (510) 643-7684 Elementary Proofs of some Results on Representations of p-groups M.A. Shokrollahi TR-95-054 September 1995
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1995/tr-95-059.ps.Z, 19951013 INTERNATIONAL COMPUTER SCIENCE INSTITUTE I 1947 Center St. ffl Suite 600 ffl Berkeley, California 94704-1198 ffl (510) 643-9153 ffl FAX (510) 643-7684 Fault handling for multi-party real-time communication Amit Gupta and Kurt Rothermel famit,rothermelg@icsi.berkeley.edu The Tenet Group University of
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1995/tr-95-063.ps.Z, 19951207 I I I I I e e . e e e e , - - - stract ntroduction A phoneme-based speaker independent continuous speech recognition system has been developed by the Realization Group at ICSI. Acoustic information is first processed by a features extractor. The system then utilizes a MLP (Multilayer Perceptron) to
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1995/tr-95-068.ps.Z, 19951213 A Lower Bound for Randomized Algebraic Decision Trees Dima Grigoriev Marek Karpinskiy Friedhelm Meyer auf der Heide z Roman Smolenskyx TR-95-068 December 1995
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1995/tr-95-066.ps.Z, 19951213 An Exponential Lower Bound on the Size of Algebraic Decision Trees for MAX Dima Grigoriev Marek Karpinskiy Andrew C. Yaoz TR-95-066 November 1995
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1996/tr-96-003.ps.Z, 19960104 1 INTERNATIONAL COMPUTER SCIENCE INSTITUTE I 1947 Center St. ffl Suite 600 ffl Berkeley, California 94704-1198 ffl (510) 643-9153 ffl FAX (510) 643-7684 Ramification and Causality Michael Thielscher TR-96-003 January 1996
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1995/tr-95-070.ps.Z, 19960105 A Quality of Service Management Architecture (QoSMA): A preliminary study Marco Alfano alfano@icsi.berkeley.edu TR-95-070 December 1995 International Computer Science Institute Berkeley, California
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1995/tr-95-062.ps.gz, 19960106 INTERNATIONAL COMPUTER SCIENCE INSTITUTE I 1947 Center St. ffl Suite 600 ffl Berkeley, California 94704-1198 ffl (510) 643-9153 ffl FAX (510) 643-7684 The Supervisor Synthesis Problem for Unrestricted CTL is NP-complete Marco Antoniottiy Bud Mishraz TR-95-062 November 1, 1995 y International Computer
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1996/tr-96-004.ps.Z, 19960108 The Rank of Sparse Random Matrices over Finite Fields Johannes Blomer , Richard Karpy, Emo Welzlz
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1996/tr-96-006.ps.Z, 19960209 INTERNATIONAL COMPUTER SCIENCE INSTITUTE I 1947 Center St. ffl Suite 600 ffl Berkeley, California 94704-1198 ffl (510) 643-9153 ffl FAX (510) 643-7684 Managing ABR Capacity in Reservation-based Slotted Networks Roya Ulrich and Pieter Kritzinger fulrich@icsi.berkeley.edu, psk@cs.uct.ac.zag The Networks
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1996/tr-96-009.ps.Z, 19960222 1 INTERNATIONAL COMPUTER SCIENCE INSTITUTE I 1947 Center St. ffl Suite 600 ffl Berkeley, California 94704-1198 ffl (510) 643-9153 ffl FAX (510) 643-7684 Explicit and Implicit Indeterminism: Reasoning About Uncertain and Contradictory Specifications of Dynamic Systems Sven-Erik Bornscheuer and Michael
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1996/tr-96-010.ps.Z, 19960226 INTERNATIONAL COMPUTER SCIENCE INSTITUTE I 1947 Center St. ffl Suite 600 ffl Berkeley, California 94704-1198 ffl (510) 643-9153 ffl FAX (510) 643-7684 On Interpolating Polynomials over Finite Fields M.A. Shokrollahi TR-96-010 February 1996
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1996/tr-96-013.ps.Z, 19960420 INTERNATIONAL COMPUTER SCIENCE INSTITUTE I 1947 Center St. ffl Suite 600 ffl Berkeley, California 94704-1198 ffl (510) 643-9153 ffl FAX (510) 643-7684 The Voice Mail Digits and Their Performance on ICSI's Hybrid HMM/ANN System Rainer Klisch TR-96-013 April 1996
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1996/tr-96-014.ps.Z, 19960511 INTERNATIONAL COMPUTER SCIENCE INSTITUTE I 1947 Center St. ffl Suite 600 ffl Berkeley, California 94704-1198 ffl (510) 643-9153 ffl FAX (510) 643-7684 A Remark on Matrix Rigidity M.A. Shokrollahi, D.A. Spielman, and V. Stemann TR-96-014 May 1996
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1996/tr-96-011.ps.Z, 19960604 INTERNATIONAL COMPUTER SCIENCE INSTITUTE I 1947 Center St. ffl Suite 600 ffl Berkeley, California 94704-1198 ffl (510) 643-9153 ffl FAX (510) 643-7684 A DSOM hierarchical model for reflexive processing: an application to visual trajectory classification Claudio M. Privitera and Lokendra Shastri
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1996/tr-96-019.ps.Z, 19960607 An Introduction to Modular Process Nets Dietmar Wikarski1 TR-96-019 April 1996 1. On leave from Fraunhofer Institute for Software Engineering and Systems Engineering (ISST) Berlin, Germany An Introduction to Modular Process Nets Dietmar Wikarski International Computer
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1996/tr-96-020.ps.Z, 19960620 INTERNATIONAL COMPUTER SCIENCE INSTITUTE I 1947 Center St. ffl Suite 600 ffl Berkeley, California 94704-1198 ffl (510) 643-9153 ffl FAX (510) 643-7684 Parallel Balanced Allocations Volker Stemann TR-96-020 June 1996
	ftp://ftp.icsi.Berkeley.edu/pub/techreports/1996/tr-96-022.ps.Z, 19960627 Determining Priority Queue Performance from Second Moment Traffic Characterizations Edward W. Knightly TR-96-022 June 1996