Browse

ftp://cs.rutgers.edu (142)

	ftp://cs.rutgers.edu/pub/technical-reports/ml-tr-36.ps.Z, 19920810 The Computational Complexity of the Candidate-Elimination Algorithm Haym Hirsh Computer Science Department Hill Center for the Mathematical Science Busch Campus Rutgers University New Brunswick, NJ 08903 hirsh@cs.rutgers.edu Abstract Mitchell's original work on version spaces (Mitchell, 1982) presen
	ftp://cs.rutgers.edu/pub/technical-reports/lcsr-tr-185.ps.Z, 19920810 On Strong Separations from AC0? Eric Allendery Department of Computer Science Rutgers University New Brunswick, NJ 08903 allender@cs.rutgers.edu Vivek Gorez Department of Computer Science Rutgers University New Brunswick, NJ 08903 gore@paul.rutgers.edu July 29, 1992 ?A preliminary version of this pa
	ftp://cs.rutgers.edu/pub/technical-reports/lcsr-tr-187.ps.Z, 19920810 Depth Reduction for Circuits of Unbounded Fan-In? Eric Allendery Department of Computer Science Rutgers University New Brunswick, NJ 08903 Ulrich Hertrampf Institut f?ur Informatik Universit?at W?urzburg D-8700 W?urzburg Federal Republic of Germany December 12, 1991 ?The results in this paper were o
	ftp://cs.rutgers.edu/pub/technical-reports/lcsr-tr-188.ps.Z, 19920810 A uniform circuit lower bound for the permanent Eric Allender? Department of Computer Science Rutgers University New Brunswick, NJ 08903 Vivek Gorey Department of Computer Science Rutgers University New Brunswick, NJ 08903 July 23, 1992 Abstract We show that uniform families of ACC circuits of subex
	ftp://cs.rutgers.edu/pub/technical-reports/lcsr-tr-189.ps.Z, 19920810 Almost-Everywhere Complexity Hierarchies for Nondeterministic Time? Eric Allendery Department of Computer Science, Rutgers University New Brunswick, NJ, USA 08903 Richard Beigelz Department of Computer Science, Yale University 51 Prospect St. P. O. Box 2158, Yale Station New Haven, CT, USA 06520-215
	ftp://cs.rutgers.edu/pub/technical-reports/lcsr-tr-186.ps.Z, 19920810 Applications of Time-Bounded Kolmogorov Complexity in Complexity Theory Eric Allender? Department of Computer Science Rutgers University New Brunswick, NJ 08903, USA allender@cs.rutgers.edu Abstract. This paper presents one method of using time-bounded Kolmogorov complexity as a measure of the compl
	ftp://cs.rutgers.edu/pub/technical-reports/lcsr-tr-184.ps.Z, 19920810 The complexity of computing maximal word functions? Eric Allender y Rutgers University New Brunswick, New Jersey Danilo Bruschi z Universit?a degli Studi Milano, Italy Giovanni Pighizzini x Universit?a degli Studi Milano, Italy Abstract Maximal word functions occur in data retrieval applications and
	ftp://cs.rutgers.edu/pub/technical-reports/cap-tr-8.ps.Z, 19920813 Artificial Intelligence Research Issues in Computational Simulation of Physical System Behavior Andrew Gelsey gelsey@cs.rutgers.edu CAP-TR-8 March 1992 Abstract Computational simulation is an important tool for predicting the behavior of physical systems. Many powerful simulation programs exist toda
	ftp://cs.rutgers.edu/pub/technical-reports/cap-tr-9.ps.Z, 19920814 1 Model Generation from Physical Principles: A Progress Report Ringo Ling Louis Steinberg Department of Computer Science Rutgers University New Brunswick, NJ 08904 ling@cs.rutgers.edu, lou@cs.rutgers.edu Abstract This paper describes a framework and a system for generating mathematical models (i.e.
	ftp://cs.rutgers.edu/pub/technical-reports/dcs-tr-292.ps.Z, 19921015 LOWER AND UPPER BOUNDS FOR INCREMENTAL ALGORITHMS BY ARTHUR MICHAEL BERMAN A dissertation submitted to the Graduate School\|New Brunswick Rutgers, The State University of New Jersey in partial fulfillment of the requirements for the degree of Doctor of Philosophy Graduate Program in Computer Science
	ftp://cs.rutgers.edu/pub/technical-reports/dcs-tr-294.ps.Z, 19921118 LECTURE NOTES ON THE NEW AKS SORTING NETWORK V. Chv?atal Computer Science Department, Rutgers University New Brunswick, NJ 08903, USA 1 Abstract Ajtai, Koml?os, and Szemer?edi constructed sorting networks with N wires of depth O(log N ). They were not concerned with the value of the proportionality
	ftp://cs.rutgers.edu/pub/technical-reports/lcsr-tr-174.ps.Z, 19921202 INTERPROCEDURAL ALIASING IN THE PRESENCE OF POINTERS BY WILLIAM ALEXANDER LANDI A dissertation submitted to the Graduate School\|New Brunswick Rutgers, The State University of New Jersey in partial fulfillment of the requirements for the degree of Doctor of Philosophy Graduate Program in Computer Sci
	ftp://cs.rutgers.edu/pub/technical-reports/lcsr-tr-180.ps.Z, 19921208 COMPOSITION OF IMAGE ANALYSIS PROCESSES THROUGH OBJECT-CENTERED HIERARCHICAL PLANNING BY LEIGUANG GONG A dissertation submitted to the Graduate School\|New Brunswick Rutgers, The State University of New Jersey in partial fulfillment of the requirements for the degree of Doctor of Philosophy Graduate
	ftp://cs.rutgers.edu/pub/technical-reports/dcs-tr-291.ps.Z, 19921208 An Efficient Algorithm for Ordering Random Genomic Clones Kyungsook Han kshan@cs.rutgers.edu Michiel Noordewier noordewi@cs.rutgers.edu Computer Science Department Rutgers University Piscataway, NJ 08855 Fax: 908-932-0537 July 2, 1992 Abstract We propose an algorithm which efficiently constructs a p
	ftp://cs.rutgers.edu/pub/technical-reports/dcs-tr-295.ps.Z, 19921214 Description Logics are not just for the Flightless-Birds: A New Look at the Utility and Foundations of Description Logics Alex Borgida Dept. of Computer Science Rutgers University New Brunswick, NJ 08904 June 1992 Abstract This paper presents some of the underlying principles of description logics (
	ftp://cs.rutgers.edu/pub/technical-reports/lcsr-tr-194.ps.Z, 19930129 REFERENCES 20 + B B B + - - - B B Figure 11. Construction for B?(2; 3) >= 20. According to Equation (10), B(3; 3) = 28. An arrangement achieving this bound must simultaneously achieve (3) = 6 type I vertices, (3) = 6 type II vertices and 4(3+3)?8 = 16 type III vertices. Surprisingly, this can be
	ftp://cs.rutgers.edu/pub/technical-reports/dcs-tr-297.ps.Z, 19930202 LOWER BOUNDS FOR UNIFORM CONSTANT DEPTH CIRCUITS BY VIVEK KASHINATH GORE A dissertation submitted to the Graduate School\|New Brunswick Rutgers, The State University of New Jersey in partial fulfillment of the requirements for the degree of Doctor of Philosophy Graduate Program in Computer Science Wr
	ftp://cs.rutgers.edu/pub/technical-reports/cap-tr-13.ps.Z, 19930510 Constrained REDO: An Alternative to REPLAY C. W. Liew L. I. Steinberg Department of Computer Science Rutgers University New Brunswick NJ 08903 Email: liew@cs.rutgers.edu, lou@cs.rutgers.edu Phone: (908)932-5229 January 26, 1993 Area/subarea: Case Based Reasoning/Design Abstract Design optimization p
	ftp://cs.rutgers.edu/pub/technical-reports/cap-tr-16.ps.Z, 19930510 Appeared: AAAI Fall Symposium, 1992 Modeling and Simulation for Automated Yacht Design Andrew Gelsey Computer Science Department Rutgers University New Brunswick, NJ 08903 gelsey@cs.rutgers.edu Abstract Computational simulation is an important tool for predicting the behavior of physical systems. Ma
	ftp://cs.rutgers.edu/pub/technical-reports/cap-tr-2.ps.Z, 19930510 Combining Innovation and Perspiration Louis Steinberg Department of Computer Science Rutgers University New Brunswick, NJ 08903 USA lou@cs.rutgers.edu Accepted for presentation at the WORKSHOP ON ARTIFICIAL INTELLIGENCE IN DESIGN IJCAI-91 Sidney, Australia, August 15, 1991 ABSTRACT For many design p
	ftp://cs.rutgers.edu/pub/technical-reports/cap-tr-6.ps.Z, 19930510 PROGRESS REPORT FOR YEAR 2 OF THE RESEARCH GRANT ON AI AND DESIGN: COMPUTER AIDED PRODUCTIVITY (CAP) AND PLAN FOR YEAR 3 Saul Amarel, PI Louis Steinberg, Co-PI Tom Ellman Andrew Gelsey Haym Hirsh Jerry Richter 1. Introduction During the current period, a major part of our effort was directed towards
	ftp://cs.rutgers.edu/pub/technical-reports/lcsr-tr-204.ps.Z, 19930512 Regularities in Software Systems By: Naftaly H. Minsky April 1993 1 Computer Science Department Rutgers University New Brunswick, NJ 08903 Net Address: minsky@cs.rutgers.edu 1Work supported in part by NSF grant No. CCR-8807803. 1 Abstract Regularities, or the conformity to unifying principles, are
	ftp://cs.rutgers.edu/pub/technical-reports/cap-tr-18.ps.Z, 19930726 MSG: A Computer System for Automated Modeling of Heat Transfer Sui-ky Ringo Ling Louis Steinberg Department of Computer Science Rutgers University New Brunswick, NJ 08903 Yogesh Jaluria Department of Mechanical and Aerospace Engineering Rutgers University New Brunswick, NJ 08903 Abstract The task of
	ftp://cs.rutgers.edu/pub/technical-reports/cap-tr-15.ps.Z, 19930726 Approximation Operators in Distributed Modeling Sui-ky Ringo Ling & Louis Steinberg Department of Computer Science Rutgers University New Brunswick, NJ 08904 ling@cs.rutgers.edu, lou@cs.rutgers.edu Abstract Computer programs which do any task which requires reasoning about physical systems need
	ftp://cs.rutgers.edu/pub/technical-reports/dcs-tr-295a.ps.Z, 19930811 On the Relationship between Description Logic and Predicate Logic Queries LCSR-TR-295-A Alex Borgida? Dept. of Computer Science Rutgers University New Brunswick, NJ 08903 borgida@cs.rutgers.edu Tel: 908-249-5062 December 1992 Revised June 1993 Abstract Description Languages (DLs) are descendants of
	ftp://cs.rutgers.edu/pub/technical-reports/lcsr-tr-209.ps.Z, 19930811 The frame problem in object-oriented specifications: an exhibition of problems and approaches ? Alex Borgida borgida@cs.rutgers.edu Technical Report LCSR-TR-209 Dept. of Computer Science Rutgers University New Brunswick, NJ 08903 October 2, 1992 Abstract We present first a series of examples involvi
	ftp://cs.rutgers.edu/pub/technical-reports/lcsr-tr-200.ps.Z, 19930922 Synthesis of Abstraction Hierarchies for Constraint Satisfaction by Clustering Approximately Equivalent Objects? Thomas Ellman Department of Computer Science Hill Center for Mathematical Sciences Rutgers University, New Brunswick, NJ 08903 ellman@cs.rutgers.edu LCSR-TR-200 Abstract Abstraction techn
	ftp://cs.rutgers.edu/pub/technical-reports/cap-tr-11.ps.Z, 19930922 Intelligent Model Selection for Hillclimbing Search in Computer-Aided Design? Thomas Ellman John Keane Mark Schwabacher Department of Computer Science Hill Center for Mathematical Sciences Rutgers University New Brunswick, NJ 08903 fellman,keane,schwabacg@cs.rutgers.edu CAP-TR-11 Abstract Models of
	ftp://cs.rutgers.edu/pub/technical-reports/lcsr-tr-198.ps.Z, 19930922 Hillclimbing in a Hierarchy of Abstraction Spaces Thomas Ellman Saibal Patra Department of Computer Science Hill Center for Mathematical Sciences Rutgers University New Brunswick, New Jersey 08903 (908) 932 - 4184 fellman,patrag@cs.rutgers.edu LCSR-TR-198 Abstract Hillclimbing search has been shown
	ftp://cs.rutgers.edu/pub/technical-reports/lcsr-tr-199.ps.Z, 19930922 Abstraction via Approximate Symmetry? Thomas Ellman Department of Computer Science Rutgers University New Brunswick, NJ 08903 ellman@cs.rutgers.edu LCSR-TR-199 Abstract Abstraction techniques are important for solving constraint satisfaction problems with global constraints and low solution density.
	ftp://cs.rutgers.edu/pub/technical-reports/cap-tr-7.ps.Z, 19930922 The Rutgers CAP Project Design Associate? Thomas Ellman John Keane Mark Schwabacher Department of Computer Science Rutgers University fellman,keane,schwabacg@cs.rutgers.edu CAP-TR-7 August 1992 Abstract The Design Associate is intended to be an interactive environment that supports decision-making,
	ftp://cs.rutgers.edu/pub/technical-reports/dcs-tr-306.ps.Z, 19940131 FOUNDATIONS OF RECURRENT NEURAL NETWORKS BY HAVA (EVE) TOVA SIEGELMANN A dissertation submitted to the Graduate School\|New Brunswick Rutgers, The State University of New Jersey in partial fulfillment of the requirements for the degree of Doctor of Philosophy Graduate Program in Computer Science Writ
	ftp://cs.rutgers.edu/pub/technical-reports/lcsr-tr-197-a.ps.Z, 19940308 To appear in the Proceedings of the Sixth USENIX C++ Technical Conference Static Type Determination for C++? Hemant D. Pandey Barbara G. Ryder Tata Research Development and Department of Computer Science Design Centre Rutgers University 1 Mangaldas Road, Pune-411050, India New Brunswick, NJ 08903 ry
	ftp://cs.rutgers.edu/pub/technical-reports/lcsr-tr-220.ps.Z, 19940525 Law-Governed Regularities in Software Systems By: Naftaly H. Minsky January 1994 1 Computer Science Department Rutgers University New Brunswick, NJ 08903 Tel: 908-932-2085 Net Address: minsky@cs.rutgers.edu 1Work supported in part by NSF grant No. CCR-9308773. 1 Abstract Regularities, or the confor
	ftp://cs.rutgers.edu/pub/technical-reports/cap-tr-21.ps.Z, 19940824 Intelligent Automated Quality Control for Computational Simulation Andrew Gelsey gelsey@cs.rutgers.edu CAP-TR-21 August 1994 Abstract Computational simulation of physical systems generally requires human experts to set up a simulation, run it, evaluate the quality of the simulation output, and repea
	ftp://cs.rutgers.edu/pub/technical-reports/lcsr-tr-228.ps.Z, 19941011 Explaining Subsumption in Description Logics Deborah L. McGuinness Dept. of Computer Science Rutgers University and AT&T Bell Laboratories Murray Hill, NJ 07974 USA dlm@research.att.com Alex Borgida Dept. of Computer Science Rutgers University New Brunswick, NJ 08903 borgida@cs.rutgers.edu Septe
	ftp://cs.rutgers.edu/pub/technical-reports/hpcd-tr-13.ps.Z, 19941102 FEEDBACK DIRECTED OPTIMIZATION BY CHUN WAI LIEW A dissertation submitted to the Graduate School\|New Brunswick Rutgers, The State University of New Jersey in partial fulfillment of the requirements for the degree of Doctor of Philosophy Graduate Program in Computer Science Written under the direction
	ftp://cs.rutgers.edu/pub/technical-reports/lcsr-tr-229.ps.Z, 19941107 Initializing Neural Networks using Decision Trees Arunava Banerjee Department of Computer Science Rutgers University New Brunswick, NJ 08903 arunava@cs.rutgers.edu Abstract Existing approaches to the inductive learning problem include Symbolic and Connectionist algorithms. While the Symbolic approac
	ftp://cs.rutgers.edu/pub/technical-reports/lcsr-tr-232.ps.Z, 19941115 Integrating Qualitative and Quantitative Shape Recovery Sven J. Dickinson Rutgers University Center for Cognitive Science (RuCCS) and Department of Computer Science Rutgers University P. O. Box 1179 Piscataway, NJ 08855-1179 Dimitri Metaxas Department of Computer and Information Science University o
	ftp://cs.rutgers.edu/pub/technical-reports/lcsr-tr-231.ps.Z, 19941115 A Computational Model of View Degeneracy and its Application to Active Focal Length Control David Wilkes Department of Computer Science University of Toronto Sven J. Dickinson Rutgers University Center for Cognitive Science (RuCCS) and Department of Computer Science Rutgers University John K. Tsotso
	ftp://cs.rutgers.edu/pub/technical-reports/lcsr-tr-238.ps.Z, 19950119 Modular Implementation of Individual Reasoning in protodl \| the Extensible Description Logic Management System. Alex Borgida Daniel Kudenko Dept. of Computer Science Rutgers University New Brunswick, NJ 08903 fborgida,kudenkogcs.rutgers.edu December 1994 Abstract This is the second report in a serie
	ftp://cs.rutgers.edu/pub/technical-reports/dcs-tr-319.ps.Z, 19950126 Finding pattern matchings for permutations Louis Ibarra Dept. of Computer Science Hill Center, Busch Campus Rutgers University Piscataway, NJ 08855 ibarra@paul.rutgers.edu January 19, 1995 Abstract Given a permutation P of f1; : : : ; kg and T of f1; : : : ; ng, the pattern matching problem for perm
	ftp://cs.rutgers.edu/pub/technical-reports/ml-tr-38.ps.Z, 19950131 The Problem with Noise and Small Disjuncts Gary M. Weiss AT&T Bell Labs/Rutgers University gweiss@paul.rutgers.edu Abstract Systems that learn from examples often create a disjunctive concept definition. The disjuncts in the concept definition which cover only a few training examples are referre
	ftp://cs.rutgers.edu/pub/technical-reports/ml-tr-39.ps.Z, 19950131 Learning with Small Disjuncts Gary M. Weiss Rutgers University/AT&T Bell Labs gweiss@paul.rutgers.edu Abstract Systems that learn from examples often create a disjunctive concept definition. The disjuncts in the concept definition which cover only a few training examples are referred to as small
	ftp://cs.rutgers.edu/pub/technical-reports/dcs-tr-318.ps.Z, 19950131 MAPPING TECHNIQUES AND PERFORMANCE ANALYSIS FOR AN INTERCONNECTION CACHED MULTIPROCESSOR NETWORK BY VIPUL GUPTA A dissertation submitted to the Graduate School\|New Brunswick Rutgers, The State University of New Jersey in partial fulfillment of the requirements for the degree of Doctor of Philosophy
	ftp://cs.rutgers.edu/pub/technical-reports/dcs-tr-320.ps.Z, 19950202 DATAMAN project: Towards a Mosaic-like Location- Dependant Information Service for Mobile Clients Arup ACHARYA, Tomasz IMIELINSKI and B. R. BADRINATH Department of Computer Science, Rutgers University, New Brunswick, NJ 08903 Introduction a The goal of the DATAMAN project is to develop primitives an
	ftp://cs.rutgers.edu/pub/technical-reports/cap-tr-17.ps.Z, 19950209 Learning Prototype-Selection Rules for Case-Based Iterative Design Mark Schwabacher Haym Hirsh Thomas Ellman Department of Computer Science Rutgers University New Brunswick, NJ 08903 Abstract The first step for most case-based design systems is to select an initial prototype from a database of previ
	ftp://cs.rutgers.edu/pub/technical-reports/lcsr-tr-239.ps.Z, 19950227 Unshareable Dynamic Objects and How to Resolve a Conflict Between Encapsulation and Pointers Naftaly H. Minsky? Computer Science Department Rutgers University New-Brunswick, NJ 08903 Tel: (908) 445-2085; e-mail: minsky@cs.rutgers.edu January 1995 Abstract This paper introduces the concept of an unsh
	ftp://cs.rutgers.edu/pub/technical-reports/hpcd-tr-25.ps.Z, 19950314 Using Feedback To Improve VLSI Designs? C. W. Liew Department of Computer Science Rutgers University Piscataway NJ 08855 liew@cs.rutgers.edu February 26, 1995 Abstract VLSI HLS design is a typical design optimization problem with a focus on generating good solutions. Typical expert design systems in
	ftp://cs.rutgers.edu/pub/technical-reports/hpcd-tr-26.ps.Z, 19950328 Tree codes for vortex dynamics: Application of a programming framework Sandeep Bhatt Pangfeng Liu Bell Communications Research, Morristown NJ 07960, and Computer Science, Rutgers University, Piscataway NJ 08855. Victor Fernandez Norman Zabusky Mechanical and Aerospace Engineering, Rutgers University
	ftp://cs.rutgers.edu/pub/technical-reports/hpcd-tr-23.ps.Z, 19950410 From Proceedings, 12th National Conference on Artificial Intelligence (1994), pp. 1224{1230 Intelligent Automated Grid Generation for Numerical Simulations Ke-Thia Yao Computer Science Department Rutgers University New Brunswick, NJ 08903, USA kyao@cs.rutgers.edu (908) 932-5263 Andrew Gelsey Compute
	ftp://cs.rutgers.edu/pub/technical-reports/lcsr-tr-235.ps.Z, 19950411 Constructing Piecewise Linear Homeomorphisms Diane Souvaine? and Rephael Wengery November 4, 1994 Abstract Let P = fp1; : : : ; png and Q = fq1; : : : ; qng be two point sets lying in the interior of rectangles in the plane. We show how to construct a piecewise linear homeomorphism of size O(n2) bet
	ftp://cs.rutgers.edu/pub/technical-reports/hpcd-tr-27.ps.Z, 19950413 ARPA Inlet Design Group Report No. 4 TEST CASES FOR NPARC Sam Gao Department of Computer Science Rutgers University - The State University of New Jersey Piscataway, NJ 08855-0909 1 Objective In order to insure efficient and accurate utilization of the NPARC2D code, test computations for a superso
	ftp://cs.rutgers.edu/pub/technical-reports/dcs-tr-321.ps.Z, 19950417 TRACTABLE REASONING IN KNOWLEDGE REPRESENTATION SYSTEMS BY MUKESH DALAL A dissertation submitted to the Graduate School\|New Brunswick Rutgers, The State University of New Jersey in partial fulfillment of the requirements for the degree of Doctor of Philosophy Graduate Program in Computer Science Wri
	ftp://cs.rutgers.edu/pub/technical-reports/lcsr-tr-241.ps.Z, 19950420 Lattice Frameworks for Multisource and Bidirectional Data Flow Problems STEPHEN P. MASTICOLA Siemens Corporate Research THOMAS J. MARLOWE Seton Hall University BARBARA G. RYDER Rutgers University Multisource data flow problems involve information which may enter nodes independently through different
	ftp://cs.rutgers.edu/pub/technical-reports/hpcd-tr-28.ps.Z, 19950425 Learning When Reformulation is Appropriate for Iterative Design Mark Schwabacher Thomas Ellman Haym Hirsh Gerard Richter Department of Computer Science Hill Center for the Mathematical Sciences Busch Campus Rutgers, The State University of New Jersey Piscataway, New Jersey 08855 fschwabac, ellman, h
	ftp://cs.rutgers.edu/pub/technical-reports/hpcd-tr-29.ps.Z, 19950501 Inductive Learning of Feature-Tracking Rules for Scientific Visualization Arunava Banerjee Haym Hirsh Thomas Ellman Department of Computer Science Hill Center for the Mathematical Sciences Busch Campus Rutgers, The State University of New Jersey Piscataway, New Jersey 08855 farunava,hirsh,ellmang@cs
	ftp://cs.rutgers.edu/pub/technical-reports/lcsr-tr-240.ps.Z, 19950502 DNA Sequence Classification Using Compression-Based Induction David Loewenstern, Haym Hirsh, Peter Yianilosy, and Michiel Noordewier *Department of Computer Science, Rutgers University, New Brunswick, NJ 08903, USA yNEC Research Institute, 4 Independence Way, Princeton, NJ 08540, USA Abstract Indu
	ftp://cs.rutgers.edu/pub/technical-reports/lcsr-tr-168.ps.Z, 19950525 A Safe Approximate Algorithm for Interprocedural Pointer Aliasing? William Landiy Barbara G. Rydery Abstract Aliasing occurs at some program point during execution when two or more names exist for the same location. In a language which allows pointers, the problem of determining the set of pairs of
	ftp://cs.rutgers.edu/pub/technical-reports/lcsr-tr-244.ps.Z, 19950525 Function Pointers in C - An Empirical Study Anand Shah and Barbara G. Ryder May 24, 1995 Abstract Interprocedural analysis requires a statically determinable call multigraph to represent the program. Programs that use function pointers or function-valued variables present a difficult problem for sta
	ftp://cs.rutgers.edu/pub/technical-reports/lcsr-tr-245.ps.Z, 19950601 May 1995 APPROXIMATE MINIMUM-COST MULTICOMMODITY FLOWS IN ~O("?2KNM) TIME Michael D. Grigoriadis and Leonid G. Khachiyan LCSR-TR-245 Department of Computer Science Hill Center for the Mathematical Sciences Rutgers University New Brunswick, NJ 08903. APPROXIMATE MINIMUM-COST MULTICOMMODITY FLOWS IN
	ftp://cs.rutgers.edu/pub/technical-reports/lcsr-tr-246.ps.Z, 19950605 Recognition by Functional Parts Ehud Rivlin Department of Computer Science Technion{Israel Institute of Technology Haifa, Israel Sven J. Dickinson Center for Cognitive Science and Department of Computer Science Rutgers University P.O. Box 1179 Piscataway, NJ 08855 Azriel Rosenfeld Center for Automat
	ftp://cs.rutgers.edu/pub/technical-reports/lcsr-tr-247.ps.Z, 19950606 PUBLISHING IN WIRELESS AND WIRELINE ENVIRONMENTS BY SUBRAMANIYAM R VISWANATHAN A dissertation submitted to the Graduate School\|New Brunswick Rutgers, The State University of New Jersey in partial fulfillment of the requirements for the degree of Doctor of Philosophy Graduate Program in Computer Scie
	ftp://cs.rutgers.edu/pub/technical-reports/ml-tr-40.ps.Z, 19950627 EXPLOITING KNOWLEDGE OF UNCERTAINTY: INDUCTION OF CLASSIFIERS BY THE INCREMENTAL COMBINATION OF PROBABILISTIC EVIDENCE BY STEVEN W. NORTON A dissertation submitted to the Graduate School\|New Brunswick Rutgers, The State University of New Jersey in partial fulfillment of the requirements for the degr
	ftp://cs.rutgers.edu/pub/technical-reports/lcsr-tr-248.ps.Z, 19950717 APPROXIMATION SCHEMES FOR MAXIMUM CARDINALITY MATCHING ? BAHMAN KALANTARI and ALI SHOKOUFANDEH Department of Computer Science Rutgers University, New Brunswick, NJ 08903 Abstract Let G = (V; E) be an undirected graph. Given an odd number k = 2l + 1, a matching M is said to be k-optimal if it does no
	ftp://cs.rutgers.edu/pub/technical-reports/dcs-tr-322.ps.Z, 19950717 ON THE COMPLEXITY OF MATRIX BALANCING? B. Kalantari, L. Khachiyan, and A. Shokoufandeh Department of Computer Science Rutgers University, New Brunswick, NJ 08903 Abstract An n ? n matrix with nonnegative entries is said to be balanced if for each i = 1; : : : ; n, the sum of the entries of its i-th
	ftp://cs.rutgers.edu/pub/technical-reports/hpcd-tr-22.ps.Z, 19950719 NPARC Simulation and Redesign of the NASA P2 Hypersonic Inlet Andrew Gelsey? and Doyle D. Knighty and Song Gaoz and Mark Schwabacherx Rutgers, the State University of New Jersey New Brunswick, NJ 08903 Copyright c 1995 by Andrew Gelsey, Doyle D. Knight, Song Gao, and Mark Schwabacher. Published by t
	ftp://cs.rutgers.edu/pub/technical-reports/hpcd-tr-21.ps.Z, 19950720 A Computational Environment for Exhaust Nozzle Design Andrew Gelsey and Don Smith (gelsey@cs.rutgers.edu, dsmith@cs.rutgers.edu) Computer Science Department Rutgers University New Brunswick, NJ 08903 Computing in Aerospace 10, San Antonio, TX, March 1995 AIAA-95-1016-CP Copyright c 1995 by Andrew Ge
	ftp://cs.rutgers.edu/pub/technical-reports/lcsr-tr-249.ps.Z, 19950726 Defining Flow Sensitivity in Data Flow Problems Thomas J. Marlowe? Barbara G. Rydery Michael G. Burkez July 17, 1995 Abstract Since Banning first introduced flow sensitivity in 1978, the term has been used to indicate hard or complex data flow problems, but there is no consensus as to its precise me
	ftp://cs.rutgers.edu/pub/technical-reports/lcsr-tr-251.ps.Z, 19950808 1. Introduction. Let f : f0; 1gn ! f0; 1g be a monotone Boolean function of n variables: x >= x0 =) f(x) >= f(x0) for any x; x0 2 f0; 1gn: Denote by c = ^ I2C _ i2I xi (1:1) the irredundant conjunctive normal form (CNF) of f , where C is the set of the prime implicates I ? f1; : : : ; ng of f
	ftp://cs.rutgers.edu/pub/technical-reports/lcsr-tr-252.ps.Z, 19950822 August 1995 ON THE FREQUENCY OF THE MOST FREQUENTLY OCCURRING VARIABLE IN DUAL MONOTONE DNFs ? V. Gurvichy and L. Khachiyan LCSR-TR-252 Department of Computer Science Hill Center for the Mathematical Sciences Rutgers University New Brunswick, NJ 08903. ? Supported in part by ONR grant N00014-92-J-13
	ftp://cs.rutgers.edu/pub/technical-reports/lcsr-tr-253.ps.Z, 19950912 A BASIC FAMILY OF ITERATION FUNCTIONS FOR POLYNOMIAL ROOT FINDING AND ITS CHARACTERIZATIONS Bahman Kalantari ? Department of Computer Science Rutgers University, New Brunswick, NJ 08903 Iraj Kalantari Department of Mathematics Western Illinois University, Macomb, IL, 61455 Rahim Zaare-Nahandiy Depar
	ftp://cs.rutgers.edu/pub/technical-reports/hpcd-tm-2.ps.Z, 19951031 Notes on the Technical Sessions of the Second HPCD Workshop July 20-21, 1995 Rutgers University New Brunswick, NJ John Keane Mark Schwabacher October 24, 1995 1 1 Welcoming Remarks { Joseph Seneca, Uni- versity VP for Academic Affairs 1.1 Summary of Presentation Dr. Seneca addressed two important d
	ftp://cs.rutgers.edu/pub/technical-reports/hpcd-tr-36.ps.Z, 19951109 Automated Redesign of the NASA P8 Hypersonic Inlet Using Numerical Optimization Vijay Shukla?, Andrew Gelseyy, Mark Schwabacherz Donald Smithx and Doyle D. Knight{ Rutgers, the State University of New Jersey New Brunswick, NJ 08903 Abstract The NASA P8 hypersonic inlet has been redesigned using an a
	ftp://cs.rutgers.edu/pub/technical-reports/hpcd-tr-20.ps.Z, 19951115 A Search Space Toolkit Andrew Gelsey Don Smith Mark Schwabacher Khaled Mohamed Rasheed Shehata Keith Miyake Computer Science Department Rutgers University New Brunswick, NJ 08903 USA (908) 445-4869 (FAX -5691) {gelsey,dsmith,schwabac,shehata,kmiyake}@cs.rutgers.edu Abstract The Search Space Toolkit
	ftp://cs.rutgers.edu/pub/technical-reports/hpcd-tr-37.ps.Z, 19960103 Intelligent Automated Grid Generation for Numerical Simulations Ke-Thia Yao Andrew Gelsey kyao@cs.rutgers.edu gelsey@cs.rutgers.edu Computer Science Department Rutgers University New Brunswick, NJ 08903, USA Abstract Numerical simulation of partial differential equations (PDEs) plays a crucial role
	ftp://cs.rutgers.edu/pub/technical-reports/lcsr-tr-250-a.ps.Z, 19960109 Laboratory of Computer Science Research Technical Report LCSR-TR-250-A, October 1995 Static Type Determination and Aliasing for C++? Hemant D. Pande Barbara G. Ryder Department of Computer Science Rutgers University Hill Center, Busch Campus Piscataway, NJ 08855 email: fpande,ryderg@cs.rutgers.edu p
	ftp://cs.rutgers.edu/pub/technical-reports/hpcd-tr-38.ps.Z, 19960117 Intelligent Gradient-Based Search of Incompletely Defined Design Spaces Mark Schwabacher Andrew Gelsey schwabac@cs.rutgers.edu gelsey@cs.rutgers.edu Computer Science Department Rutgers University New Brunswick, NJ 08903 USA (908) 445{3213, FAX {5691 Abstract Gradient-based numerical optimization of
	ftp://cs.rutgers.edu/pub/technical-reports/lcsr-tr-256.ps.Z, 19960122 TWO APPROACHES TO THE HIERARCHICAL SOLUTION OF CONSTRAINT SATISFACTION PROBLEMS BY SUNIL KUMAR MOHAN A dissertation submitted to the Graduate School\|New Brunswick Rutgers, The State University of New Jersey in partial fulfillment of the requirements for the degree of Doctor of Philosophy Graduate Pr
	ftp://cs.rutgers.edu/pub/technical-reports/lcsr-tr-257-part3of3.ps.Z, 19960125 Portability Library This document contains a complete description of the Portability Library (PL.) Along with a description of the library and an annotated list of primitives, there is a section on how to use the library. A non-trivial example program is also included as well as a reference section.
	ftp://cs.rutgers.edu/pub/technical-reports/lcsr-tr-257-part1of3.ps.Z, 19960125 Laboratory of Computer Science Research Technical Report LCSR-TR-257, January 1996 The FM and PL Libraries Documentation Javier Elices Department of Computer Science Rutgers University Hill Center, Busch Campus Piscataway, NJ 08855 email: elices@cs.rutgers.edu Abstract Building complex SPMD code in
	ftp://cs.rutgers.edu/pub/technical-reports/lcsr-tr-257-part2of3.ps.Z, 19960125 Fast Messages Communication Library This document contains a complete description of the Fast Messages (FM) communications library. Along with a description of the library and an annotated list of primitives, there is a section on how to use the library and another on how to customize certain intern
	ftp://cs.rutgers.edu/pub/technical-reports/hpcd-tr-34.ps.Z, 19960202 Using Modeling Knowledge to Guide Design Space Search Andrew Gelsey Mark Schwabacher Don Smith gelsey@cs.rutgers.edu schwabac@cs.rutgers.edu dsmith@cs.rutgers.edu Computer Science Department Rutgers University New Brunswick, NJ 08903 USA (908) 445{2001, FAX {5691 Abstract Automated search of a space
	ftp://cs.rutgers.edu/pub/technical-reports/lcsr-tr-259.ps.Z, 19960304 Laboratory of Computer Science Research Technical Report LCSR-TR-259, March 1996 Program Decomposition for Pointer-induced Aliasing Analysis? Sean Zhang Barbara G. Ryder Department of Computer Science Rutgers University New Brunswick, NJ 08903 William Landi Siemens Corporate Research Inc 755 College
	ftp://cs.rutgers.edu/pub/technical-reports/lcsr-tr-260.ps.Z, 19960313 COMPILE TIME ANALYSIS OF C AND C++ SYSTEMS BY HEMANT D. PANDE A dissertation submitted to the Graduate School\|New Brunswick Rutgers, The State University of New Jersey in partial fulfillment of the requirements for the degree of Doctor of Philosophy Graduate Program in Computer Science Written under
	ftp://cs.rutgers.edu/pub/technical-reports/lcsr-tr-255.ps.Z, 19960319 August 1995 Rev. November 1995 APPROXIMATE STRUCTURED OPTIMIZATION BY CYCLIC BLOCK-COORDINATE DESCENT Jorge Villavicencio and Michael D. Grigoriadis LCSR-TR-255 Department of Computer Science Hill Center for the Mathematical Sciences Rutgers University New Brunswick, NJ 08903. APPROXIMATE STRUCTURE
	ftp://cs.rutgers.edu/pub/technical-reports/lcsr-tr-261.ps.Z, 19960411 REFINING THE PARALLEL HYBRID ALGORITHM FOR DATA FLOW ANALYSIS BY JAVIER ELICES A thesis submitted to the Graduate School\|New Brunswick Rutgers, The State University of New Jersey in partial fulfillment of the requirements for the degree of Master of Science Graduate Program in Computer Science Writt
	ftp://cs.rutgers.edu/pub/technical-reports/lcsr-tr-262.ps.Z, 19960424 GPS-Based Addressing and Routing Tomasz Imielinski and Julio C. Navas fimielins,navasg@cs.rutgers.edu Computer Science Department Rutgers, The State University Piscataway, NJ 08855 March 7, 1996 LCSR-TR-262 Abstract In the near future GPS will be widely used, thus allowing a broad variety of locatio
	ftp://cs.rutgers.edu/pub/technical-reports/lcsr-tr-263.ps.Z, 19960506 Mobile Computing - DataMan Project Perspective Tomasz Imielinski Rutgers University 1 Introduction The objective of mobile computing is to develop system and application level software for small, battery powered terminals equipped with the wireless network connection. There is a rapidly growing inte
	ftp://cs.rutgers.edu/pub/technical-reports/lcsr-tr-264.ps.Z, 19960506 An O(n log n) Algorithm for finding Dissimilar Strings Sarmad Abbasi 1 Department of Computer Science, Rutgers University, Piscataway NJ 08855, U.S.A. Anirvan Sengupta Theory Group, Bell Laboratories, Lucent Technologies, Murray Hill, NJ 07974 U.S.A. Let ? be a finite alphabet and x 2 ?n. A string y
	ftp://cs.rutgers.edu/pub/technical-reports/lcsr-tr-267.ps.Z, 19960516 MODEL-BASED REFINEMENT OF SEARCH HEURISTICS BY MICHAEL W. BARLEY A dissertation submitted to the Graduate School\|New Brunswick Rutgers, The State University of New Jersey in partial fulfillment of the requirements for the degree of Doctor of Philosophy Graduate Program in Computer Science Written un
	ftp://cs.rutgers.edu/pub/technical-reports/hpcd-tr-44.ps.Z, 19960606 Multi-Level Modeling for Engineering Design Optimization Thomas Ellman John Keane Mark Schwabacher Ke-Thia Yao Department of Computer Science, Hill Center for Mathematical Sciences Rutgers University, Piscataway, NJ 08855 fellman,keane,schwabac,kyaog@cs.rutgers.edu HPCD-TR-44 June 1996 Abstract Phys
	ftp://cs.rutgers.edu/pub/technical-reports/hpcd-tr-40.ps.Z, 19960606 Intelligent Intercessors in Analysis Models for Automated Design John Keane Thomas Ellman Department of Computer Science Rutgers University New Brunswick, NJ fkeane, ellmang@cs.rutgers.edu January, 1996 Abstract Systems for automated design optimization of complex real-world objects can, in principl
	ftp://cs.rutgers.edu/pub/technical-reports/hpcd-tr-42.ps.Z, 19960606 A Transformation System for Interactive Reformulation of Design Optimization Strategies Thomas Ellman John Keane Takahiro Murata Mark Schwabacher Department of Computer Science, Hill Center for Mathematical Sciences Rutgers University, Piscataway, New Jersey 08855 fellman,keane,murata,schwabacg@cs.r
	ftp://cs.rutgers.edu/pub/technical-reports/hpcd-tr-43.ps.Z, 19960606 Reformulation of Design Optimization Strategies Thomas Ellman John Keane Takahiro Murata Arunava Banerjee Department of Computer Science, Hill Center for Mathematical Sciences Rutgers University, Piscataway, New Jersey 08855 fellman,keane,murata,arunavag@cs.rutgers.edu HPCD-TR-43 January 1996 Abstra
	ftp://cs.rutgers.edu/pub/technical-reports/hpcd-tr-41.ps.Z, 19960607 Extensions to the Franz, Inc.'s Allegro Common Lisp Foreign Function Interface John Keane Department of Computer Science Rutgers University New Brunswick, NJ keane@cs.rutgers.edu January, 1996 Abstract As provided by Franz, Inc., the foreign function interface of Allegro Common Lisp has a number of
	ftp://cs.rutgers.edu/pub/technical-reports/lcsr-tr-266.ps.Z, 19960613 May 1996 ON THE COMPLEXITY OF SEMIDEFINITE PROGRAMS ? L. Porkolab y and L. Khachiyan z LCSR-TR-266 Department of Computer Science Hill Center for the Mathematical Sciences Rutgers University New Brunswick, NJ 08903. ? Research supported by NSF grants CCR-9208371, CCR-9208539 and ONR grant N0014-92-J
	ftp://cs.rutgers.edu/pub/technical-reports/lcsr-tr-258.ps.Z, 19960626 January 1996 Revised June 1996 APPROXIMATE LAGRANGIAN DECOMPOSITION WITH A MODIFIED KARMARKAR LOGARITHMIC POTENTIAL Jorge Villavicencio and Michael D. Grigoriadis LCSR-TR-258 Department of Computer Science Hill Center for the Mathematical Sciences Rutgers University New Brunswick, NJ 08903. APPROXI
	ftp://cs.rutgers.edu/pub/technical-reports/hpcd-tr-45.ps.Z, 19960716 THE USE OF ARTIFICIAL INTELLIGENCE TO IMPROVE THE NUMERICAL OPTIMIZATION OF COMPLEX ENGINEERING DESIGNS BY MARK A. SCHWABACHER A dissertation submitted to the Graduate School\|New Brunswick Rutgers, The State University of New Jersey in partial fulfillment of the requirements for the degree of Doctor
	ftp://cs.rutgers.edu/pub/technical-reports/lcsr-tr-270.ps.Z, 19960731 Exporting Environment Awareness to Mobile Applications Girish Welling and B. R. Badrinath Dept. of Computer Science Rutgers University, New Brunswick, NJ 08903, USA. fwelling,badrig@cs.rutgers.edu Abstract In mobile computing, factors such as add-on hardware components and heterogeneous networks res
	ftp://cs.rutgers.edu/pub/technical-reports/lcsr-tr-271.ps.Z, 19960808 SOFTWARE SUPPORT FOR PARALLEL PROCESSING OF IRREGULAR AND DYNAMIC COMPUTATIONS BY JIA JIAO A dissertation submitted to the Graduate School\|New Brunswick Rutgers, The State University of New Jersey in partial fulfillment of the requirements for the degree of Doctor of Philosophy Graduate Program in C
	ftp://cs.rutgers.edu/pub/technical-reports/lcsr-tr-272.ps.Z, 19960820 REDUCING RANDOMNESS IN COMPUTATION VIA EXPLICIT CONSTRUCTIONS BY SHIYU ZHOU A dissertation submitted to the Graduate School\|New Brunswick Rutgers, The State University of New Jersey in partial fulfillment of the requirements for the degree of Doctor of Philosophy Graduate Program in Computer Science
	ftp://cs.rutgers.edu/pub/technical-reports/lcsr-tr-275.ps.Z, 19960912 DARWIN-E: AN ENVIRONMENT FOR IMPOSING REGULARITY ON OBJECT-ORIENTED SOFTWARE BY PARTHA PRATIM PAL A dissertation submitted to the Graduate School\|New Brunswick Rutgers, The State University of New Jersey in partial fulfillment of the requirements for the degree of Doctor of Philosophy Graduate Progr
	ftp://cs.rutgers.edu/pub/technical-reports/lcsr-tr-277.ps.Z, 19961008 EXPLAINING REASONING IN DESCRIPTION LOGICS BY DEBORAH L. MCGUINNESS A dissertation submitted to the Graduate School\|New Brunswick Rutgers, The State University of New Jersey in partial fulfillment of the requirements for the degree of Doctor of Philosophy Graduate Program in Computer Science Written
	ftp://cs.rutgers.edu/pub/technical-reports/lcsr-tr-279.ps.Z, 19961017 DESIGN AND IMPLEMENTATION OF INDIRECT PROTOCOLS FOR MOBILE WIRELESS ENVIRONMENTS BY AJAY V. BAKRE A dissertation submitted to the Graduate School\|New Brunswick Rutgers, The State University of New Jersey in partial fulfillment of the requirements for the degree of Doctor of Philosophy Graduate Progr
	ftp://cs.rutgers.edu/pub/technical-reports/lcsr-tr-274.ps.Z, 19961018 A Linear-C Implementation of Dijkstra's Algorithm Chung-Hsing Hsu and Donald Smith and Saul Levy Department of Computer Science Rutgers University LCSR-TR-274 October 9, 1996 Abstract Linear-C is a data-parallel extension to C. In this report we show, by implementing Dijkstra's algorithm in Linear-C
	ftp://cs.rutgers.edu/pub/technical-reports/lcsr-tr-273.ps.Z, 19961018 Linear-C: A Data-Parallel Extension to C Chung-Hsing Hsu and Donald Smith and Saul Levy Department of Computer Science Rutgers University LCSR-TR-273 September 9, 1996 Abstract Linear-C is a data-parallel extension to C. It extends C by treating arrays (or more precisely, aggregate value) as first-c
	ftp://cs.rutgers.edu/pub/technical-reports/lcsr-tr-282.ps.Z, 19961209 To appear in the Proceedings of the IEEE INFOCOM 1997 Admission Control Algorithms and Reservation Protocol for Supporting Mobile Hosts in an Integrated Services Packet Network Anup K. Talukdar, B. R. Badrinath Department of Computer Science Rutgers University New Brunswick, NJ 08903 ftalukdar@paul,
	ftp://cs.rutgers.edu/pub/technical-reports/lcsr-tr-284.ps.Z, 19970116 Analysis of An Approach for the Set Maxima Problem Vincenzo Liberatore? Abstract The set maxima problem is defined as follows: given a totally ordered universe X of size n and S ? 2X , jSj = n, find maxS for all S 2 S. It has been conjectured that this problem can be solved deterministically with O(
	ftp://cs.rutgers.edu/pub/technical-reports/lcsr-tr-283.ps.Z, 19970207 Automatic Data Layout With Read{Only Replication and Memory Constraints Ulrich Kremer Department of Computer Science Rutgers University TECHICAL REPORT LCSR{TR283 December 1996 1 Automatic Data Layout With Read{Only Replication and Memory Constraints? Ulrich Kremery Department of Computer Science R
	ftp://cs.rutgers.edu/pub/technical-reports/dcs-tr-325.ps.Z, 19970422 Computing Integral Points in Convex Semi-algebraic Sets? Leonid Khachiyany and Lorant Porkolabz Abstract. Let Y be a convex set in IRk defined by polynomial inequalities and equations of degree at most d >= 2 with integer coefficients of binary length l. We show that if Y ZZk <> ;, then Y
	ftp://cs.rutgers.edu/pub/technical-reports/dcs-tr-324.ps.Z, 19970422 Database Server Organization for Handling Mobile Clients1 B. R. Badrinath Shirish Phatak Department of Computer Science Rutgers University New Brunswick, NJ 08903 e-mail:fbadri@cs, phatak@paulg.rutgers.edu Abstract The use of mobile computers is gaining popularity. The number of users with laptops,
	ftp://cs.rutgers.edu/pub/technical-reports/hpcd-tr-49.ps.Z, 19970507 KNOWLEDGE-BASED MANAGEMENT OF LEGACY CODES FOR AUTOMATED DESIGN BY JOHN ERIC KEANE A dissertation submitted to the Graduate School\|New Brunswick Rutgers, The State University of New Jersey in partial fulfillment of the requirements for the degree of Doctor of Philosophy Graduate Program in Computer
	ftp://cs.rutgers.edu/pub/technical-reports/hpcd-tr-50.ps.Z, 19970523 Guided Crossover: A New Operator for Genetic Algorithm Based Optimization Khaled Rasheed shehata@cs.rutgers.edu Haym Hirsh hirsh@cs.rutgers.edu http://athos.rutgers.edu:80/ shehata/papers.html Abstract Genetic algorithms (GAs) have been extensively used in different domains as a means of doing globa
	ftp://cs.rutgers.edu/pub/technical-reports/dcs-tr-331.ps.Z, 19970709 Automated Classification of DNA Structure from Sequence Information David M. Loewenstern? Department of Computer Science Rutgers University Piscataway, NJ 08855 and Bell Laboratories Whippany, NJ 07981 Helen M. Bermany Department of Chemistry and Waksman Institute Rutgers University Piscataway, NJ 0
	ftp://cs.rutgers.edu/pub/technical-reports/dcs-tr-332.ps.Z, 19970718 Hardness and Algorithms for Local Register Allocation1 Vincenzo Liberatore2 Martin Farach3 Ulrich Kremer4 July 18, 1997 1Research partly supported by NSF Career Development Award CCR-9501942, NATO Grant CRG 960215, NSF/NIH Grant BIR 94-12594-03-CONF and an Alfred P. Sloan Research Fellowship. 2Depar
	ftp://cs.rutgers.edu/pub/technical-reports/dcs-tr-333.ps.Z, 19970722 On Providing Support for Protocol Adaptation in Mobile Wireless Networks Pradeep Sudame B. R. Badrinath Department of Computer Science Rutgers University fsudame, badrig@cs.rutgers.edu Abstract The availability of a variety of communication devices offers a choice among networks with vastly differen
	ftp://cs.rutgers.edu/pub/technical-reports/dcs-tr-334.ps.Z, 19970725 ABSTRACT OF THE DISSERTATION On the Complexity of Real and Integer Semidefinite Programming by Lorant Porkolab Dissertation Director: Professor Leonid Khachiyan We consider the general feasibility problem for semidefinite programming: Determine whether a given system of linear inequalities has a sol
	ftp://cs.rutgers.edu/pub/technical-reports/dcs-tr-329.ps.Z, 19970725 ON THE ORDER OF CONVERGENCE OF A DETERMINANTAL FAMILY OF ROOT-FINDING METHODS Bahman Kalantari Department of Computer Science Rutgers University, New Brunswick, NJ 08903 Abstract For each natural number m greater than one, and each natural number k less than or equal to m, there exists a root-findin
	ftp://cs.rutgers.edu/pub/technical-reports/dcs-tr-328.ps.Z, 19970725 GENERALIZATION OF TAYLOR'S THEOREM AND NEWTON'S METHOD VIA A NEW FAMILY OF DETERMINANTAL INTERPOLATION FORMULAS Bahman Kalantari Department of Computer Science Rutgers University, New Brunswick, NJ 08903 Abstract The general form of Taylor's theorem gives the formula, f = Pn +Rn, where Pn is the New
	ftp://cs.rutgers.edu/pub/technical-reports/dcs-tr-330.ps.Z, 19970725 A LOWER BOUND ON DETERMINANTS FROM LINEAR PROGRAMMING Bahman Kalantari Department of Computer Science Rutgers University, New Brunswick, NJ 08903 Abstract We derive a lower bound on determinants, utilizing a theorem of linear programming. Let l and u be positive lower and upper bounds on the moduli
	ftp://cs.rutgers.edu/pub/technical-reports/dcs-tr-337.ps.Z, 19970806 MRSVP : A Reservation Protocol for an Integrated Services Packet Network with Mobile Hosts1 Anup K. Talukdar, B. R. Badrinath Department of Computer Science Rutgers University New Brunswick, NJ 08903 ftalukdar@paul,badri@csg.rutgers.edu Tel:732-445-2706 Fax :732-445-5530 Arup Acharya C&C Researc
	ftp://cs.rutgers.edu/pub/technical-reports/dcs-tr-326.ps.Z, 19970806 Scalable, flow-sensitive type inference for statically typed object-oriented languages Ramkrishna Chatterjee Barbara Ryder Department of Computer Science Rutgers University, USA framkrish,ryderg@cs.rutgers.edu DCS-TR-326 August 4, 1997 Abstract An important problem in the analysis of programs writt
	ftp://cs.rutgers.edu/pub/technical-reports/dcs-tr-335.ps.Z, 19970807 Comparing Flow and Context Sensitivity on the Modification-side-effects Problem Philip A. Stocksy Barbara G. Rydery William A. Landiz Sean Zhangy yDept of Computer Science Hill Center, Busch Campus Rutgers University Piscataway, NJ 08855, USA fpstocks,ryder,xxzhangg@cs.rutgers.edu zSiemens Corporate
	ftp://cs.rutgers.edu/pub/technical-reports/ml-tr-41.ps.Z, 19970825 Experiments in UNIX Command Prediction Brian D. Davison and Haym Hirsh Department of Computer Science Rutgers, The State University of New Jersey fdavison,hirshg@cs.rutgers.edu August 1997 Abstract A good user interface is central to the success of most products. Our research is concerned with impro
	ftp://cs.rutgers.edu/pub/technical-reports/lcsr-tr-281.ps.Z, 19970903 Integrating Qualitative and Quantitative Object Representations in the Recovery and Tracking of 3-D Shape? Sven J. Dickinson Department of Computer Science and Rutgers Center for Cognitive Science (RuCCS) Rutgers University New Brunswick, NJ 08903 Dimitri Metaxas Department of Computer and Informati
	ftp://cs.rutgers.edu/pub/technical-reports/lcsr-tr-268.ps.Z, 19970903 Active Object Recognition Integrating Attention and Viewpoint Control? Sven J. Dickinson Department of Computer Science and Center for Cognitive Science Rutgers University New Brunswick, NJ 08903 Henrik I. Christensen Laboratory of Image Analysis, IES Aalborg University DK-9220 Aalborg, Denmark John
	ftp://cs.rutgers.edu/pub/technical-reports/dcs-tr-338.ps.Z, 19970903 Using Aspect Graphs to Control the Recovery and Tracking of Deformable Models? Sven J. Dickinson Department of Computer Science and Rutgers Center for Cognitive Science (RuCCS) Rutgers University New Brunswick, NJ 08903 Dimitri Metaxas Department of Computer and Information Science University of Pen
	ftp://cs.rutgers.edu/pub/technical-reports/lcsr-tr-280.ps.Z, 19970903 The Role of Model-Based Segmentation in the Recovery of Volumetric Parts from Range Data? Sven J. Dickinson Department of Computer Science and Rutgers Center for Cognitive Science (RuCCS) Rutgers University P.O. Box 1179 Piscataway, NJ 08855-1179 Dimitri Metaxas Department of Computer and Informatio
	ftp://cs.rutgers.edu/pub/technical-reports/lcsr-tr-276.ps.Z, 19970903 Panel Report: The Potential of Geons for Generic 3-D Object Recognition Sven J. Dickinson Dept. of Computer Science and Rutgers Center for Cognitive Science (RuCCS) Rutgers University New Brunswick, NJ USA 08903 Robert Bergevin Computer Vision and Systems Laboratory Dept. of Electrical and Computer
	ftp://cs.rutgers.edu/pub/technical-reports/dcs-tr-340.ps.Z, 19970915 APPLICATIONS OF RULE-BASE COVERAGE MEASURES TO EXPERT SYSTEM EVALUATION BY VALERIE B. BARR A dissertation submitted to the Graduate School\|New Brunswick Rutgers, The State University of New Jersey in partial fulfillment of the requirements for the degree of Doctor of Philosophy Graduate Program in C
	ftp://cs.rutgers.edu/pub/technical-reports/dcs-tr-342.ps.Z, 19971008 On the genus of the star graph Sarmad Abbasi Department of Computer Science, Rutgers University, Piscataway NJ 08855. Abstract The star graph Sn is a graph with Sn the set of all permutations over f1; : : : ; ng as its vertex set; two vertices ss1 and ss2 are connected if ss1 can be obtained form ss
	ftp://cs.rutgers.edu/pub/technical-reports/dcs-tr-343.ps.Z, 19971013 INFORMATION BROKERING OVER HETEROGENEOUS DIGITAL DATA: A METADATA-BASED APPROACH BY VIPUL KASHYAP A dissertation submitted to the Graduate School\|New Brunswick Rutgers, The State University of New Jersey in partial fulfillment of the requirements for the degree of Doctor of Philosophy Graduate Progr
	ftp://cs.rutgers.edu/pub/technical-reports/hpcd-tm-4.ps.Z, 19971014 Notes on the Technical Sessions of the Fourth HPCD Workshop July 17-18, 1997 Rutgers University New Brunswick, NJ Brian D. Davison Keith M. Miyake October 13, 1997 1 1 Welcoming Address { Joseph Seneca, Univer- sity VP for Academic Affairs Joseph Seneca opened the 4th HPCD workshop by looking over
	ftp://cs.rutgers.edu/pub/technical-reports/dcs-tr-344.ps.Z, 19971014 Shared Virtual Memory: Progress and Challenges Liviu Iftode Computer Science Department Rutgers University Piscataway, NJ 08855 iftode@cs.rutgers.edu Jaswinder Pal Singh Computer Science Department Princeton University Princeton, NJ 08544 jps@cs.princeton.edu 1 Introduction When the idea of implemen
	ftp://cs.rutgers.edu/pub/technical-reports/hpcd-tm-3.ps.Z, 19971015 Notes on the Technical Sessions of the Third HPCD Workshop July 18-19, 1996 Rutgers University New Brunswick, NJ Brian D. Davison Khaled Shehata Rasheed September 1996 1 1 Welcoming Address { Joseph Seneca, Univer- sity VP for Academic Affairs 1.1 Summary of Presentation Speaking to close to 50 wor
	ftp://cs.rutgers.edu/pub/technical-reports/dcs-tr-345.ps.Z, 19971016 Shock Graphs and Shape Matching Kaleem Siddiqiy Ali Shokoufandehx Sven J. Dickinsonx and Steven W. Zuckery yCenter for Computational Vision & Control Yale University New Haven, CT 06520-8285 xDepartment of Computer Science and Center for Cognitive Science Rutgers University New Brunswick, NJ 089
	ftp://cs.rutgers.edu/pub/technical-reports/dcs-tr-346.ps.Z, 19971021 OPTIMAL BUFFERING ALGORITHMS FOR CLIENT-SERVER VBR VIDEO RETRIEVALS BY JUNBIAO ZHANG A dissertation submitted to the Graduate School\|New Brunswick Rutgers, The State University of New Jersey in partial fulfillment of the requirements for the degree of Doctor of Philosophy Graduate Program in Compute
	ftp://cs.rutgers.edu/pub/technical-reports/dcs-tr-347.ps.Z, 19971110 The Phase Space Dynamics of Neuronal Systems: I Model and Experiments. Arunava Banerjee Department of Computer Science Rutgers University New Brunswick, NJ 08903 arunava@cs.rutgers.edu November 10, 1997 Abstract We investigate the phase space dynamics of local systems of biological neurons in order
	ftp://cs.rutgers.edu/pub/technical-reports/dcs-tr-349.ps.Z, 19980107 Modular Concrete Type-inference for Statically Typed Object-oriented Programming Languages? Ramkrishna Chatterjee Barbara G. Ryder Department of Computer Science, Rutgers University, Piscataway, NJ 08855 USA, Fax: 732 445 0537, framkrish,ryderg@cs.rutgers.edu Abstract. The problem of concrete type-i
	ftp://cs.rutgers.edu/pub/technical-reports/dcs-tr-350.ps.Z, 19980113 Experiments with Combined Analysis for Pointer Aliasing ? Sean Zhang Barbara G. Ryder Department of Computer Science Rutgers University Hill Center, Busch Campus Piscataway, NJ 08855 fxxzhang,ryderg@cs.rutgers.edu William A. Landi Siemens Corporate Research Inc 755 College Rd. East Princeton, NJ 085
	ftp://cs.rutgers.edu/pub/technical-reports/dcs-tr-339.ps.Z, 19980116 View-Based Object Recognition Using Saliency Maps? Ali Shokoufandehx Ivan Marsicy and Sven J. Dickinsonx xDepartment of Computer Science and Center for Cognitive Science Rutgers University New Brunswick, NJ 08903 fshokoufa,sveng@cs.rutgers.edu yDepartment of Electrical and Computer Engineering Rutge