This directory is created automatically and some papers may be mislabeled. Only document within the CiteSeer database are listed. The directory is intended to provide entry points for browsing the database and is not intended to be authoritative. Papers may not appear in all relevant categories. For example, papers in a sub-category may not appear in higher level categories.
14092.7 The Maximum Clique Problem - Bomze, Budinich, Pardalos, Pelillo (1999)(Correct)
this paper we try to give a survey of results concerning algorithms, complexity, and applications of this problem, and also provide an updated bibliography. Of course, we build upon precursory works w... / Applications . Coding Theory Hamming and Johnson Graphs . br there exists a well established theory and research proceeds in
11490.2 Quantum Information Processing: Compression, Coding, and Related.. - Reif (1985)(Correct)
Quantum Computation (QC) is a type of computation where unitary and measurement
operations are executed on linear superpositions of basis states. This paper provides
a brief introduction to QC, partic... / topics in quantum information theory including quantum error br obtainable by classical information theory is limited by the Shannon entropy
11294.1 Neural Mechanisms Underlying Processing in the Visual Areas of the.. - Wallis (1994)(Correct)
There is evidence that over a series of cortical processing stages, the visual system of primates
produces a representation of objects which shows invariance with respect to, for
example, translation,... / successful implementation of this theory in practice. The thesis is then br to faces and goes on to advance a theory for how these neurons could
9193.8 Advanced Languages for Systems Software The Fox Project in 1994 - Harper, Lee (1994)(Correct)
It has been amply demonstrated in recent years that careful attention to the structure of systems
software can lead to greater flexibility, reliability, and ease of implementation, without incurring
a... / computer networks modules type theory compilers programming br step in developing a general theory of compilation for typed
9136.2 Conjugate Gradient Methods for Toeplitz Systems - Chan, Ng (1996)(Correct)
In this expository paper, we survey some of the latest developments on using preconditioned conjugate gradient methods for solving Toeplitz systems. One of the main results is that the complexity of s... / realization problems in control theory see Bunch and the references br operator is compact. Using the theory of collectively compact sets of
8819.1 Cooperative Mobile Robotics: Antecedents and Directions - Cao, Fukunaga, Kahng (1997)(Correct)
There has been increased research interest in systems composed of multiple autonomous mobile robots exhibiting cooperative behavior. Groups of mobile robots are constructed, with an aim to studying ... / have been reported and supporting theory is still in its formative stages. br the social sciences organization theory economics cognitive
8024.0 Databases and Finite-Model Theory - Vianu (1997)(Correct)
Databases provide one of the main concrete scenarios for finitemodel
theory within computer science. This paper presents an informal overview
of database theory aimed at finite-model theorists, emph... / Databases and Finite-Model Theory Victor Vianu Abstract. br concrete scenarios for finitemodel theory within computer science. This
7826.3 Programming with Intersection Types and Bounded Polymorphism - Pierce (1991)(Correct)
Intersection types and bounded quantification are complementary mechanisms for extending
the expressive power of statically typed programming languages. They begin with a
common framework: a simple, t... / and related systems language theory programming type structure br semantics. Finally an equational theory of equivalences between F
7301.5 Reinforcement Learning: A Survey - Leslie Pack Kaelbling, Michael L.. (1996)(Correct)
This paper surveys the field of reinforcement learning from a computer-science perspective.
It is written to be accessible to researchers familiar with machine learning. Both
the historical basis of t... / of the field via Markov decision theory learning from delayed br kind of discrete cases for which theory has been developed assumes that
6923.8 Tossing Algebraic Flowers down the Great Divide - Goguen (1999)(Correct)
Data Types and Algebraic Semantics The history of programming languages, and to a large extent of software engineering as a whole, can be seen as a succession of ever more powerful abstraction mechani... / this. I would never suggest that theory has no value but I do suggest br that this great divide between theory and practice helps explain the
6878.9 Applications of Sequence Geometry to Visual Motion - Clarke (1997)(Correct)
This thesis develops a framework for real-time multiple hypothesis visual feature tracking,
and provides an implementation for linear motions. This work allows a moving observer to
detect and track a ... / the feature track and uses utility theory to decide when to update existing br this work Uncertainty and utility theory The tracker treats uncertainty
6840.7 Decision Analytic Networks in Artificial Intelligence - Matzkevich, Abramson (1995)(Correct)
Researchers in artificial intelligence and decision analysis share a concern with the construction of formal models of human knowledge and expertise. Historically, however, their approaches to these p... / of graphical models of decision theory known as influence diagrams or as br perspective they combine graph theory probability theory and decision
6533.2 Unification theory - Baader, Snyder (1999)(Correct)
Unification is a fundamental process upon which many methods for automated deduction are based. Unification theory abstracts from the specific applications of this process: it provides formal definit... / Chapter Unification theory Franz Baader LuFG Theoretical br Publishers B.V.Unification theory . Introduction
6461.1 An Overview of Wavelet Based Multiresolution Analyses - Jawerth, Sweldens (1994)(Correct)
In this paper we present an overview of wavelet based multiresolution analyses. First, we briefly discuss the continuous wavelet transform in its simplest form. Then, we give the definition of a mul... / wavelets from an approximation theory point of view discusses br paper might provide some of the theory and point to some of the right
6339.3 Data Engineering - December Vol(Correct)
this paper we describe and evaluate several popular
techniques for data reduction.
Historically, the primary need for data reduction has been internal to a database system, in a
cost-based query optim... / design implementation modelling theory and application of database br original ideas of a grand unifying theory of data reduction were being
6037.3 Abductive Interpretation And Reinterpretation Of Natural Language.. - McRoy (1993)(Correct)
To decide how to respond to an utterance, a speaker must interpret what others have
said and why they have said it. Speakers rely on their expectations to decide whether
they have understood each othe... / models of discourse. A unified theory has been developed by using br has been expressed as a logical theory within the Prioritized Theorist
6029.8 Speech Processing with Linear and Neural Network Models - Burrows (1996)(Correct)
ion,
for imposing continuity between models of adjacent speech segments, and learning rate
adaptation, for improving back-propagation training, are discussed. For synthesising real
speech utterances, ... / on system identification theory. The biggest thank-you of all br . . The acoustic theory of speech production.
5939.1 Two Approaches for High Concurrency in Multicast-Based Object.. - Johnson, Maugis (1994)(Correct)
This report presents a replica control protocol for atomic objects. The protocol is derived from an
atomic broadcast primitive, and places constraints on the delivery of messages to provide a consiste... / Voting . Topics In Voting Theory br work applies advances of voting theory to distributed computing to
5871.4 Operations for Learning with Graphical Models - Buntine (1994)(Correct)
This paper is a multidisciplinary review of empirical, statistical learning from a graphical
model perspective. Well-known examples of graphical models include Bayesian networks,
directed graphs repre... / forms the basis of a computational theory of Bayesian learning using the br models. By a computational theory we mean that the approach shows
5655.6 Goal-Driven Learning - Ram, Leake (1995)(Correct)
Contents
Acknowledgements
Preface by Professor Tom Mitchell, CMU
Editors' Preface
List of Contributors
1. Learning, Goals, and Learning Goals : : : : : : : : : : : : : : : : : : : : : : : : : : : : :... / planful process. It describes a theory of the kinds of knowledge about br and Long Sticks The Interaction of Theory and Similarity in Rule Induction
5579.7 An Introduction to Least Commitment Planning - Weld (1994)(Correct)
Recent developments have clarified the process of generating partially
ordered, partially specified sequences of actions whose execution
will achive an agent's goal. This paper summarizes a progressio... / is often called a domain theory. The planner's output is a br had problems dealing A domain theory denoted with the Greek letter
5414.8 The Practice of Logical Frameworks - Frank Pfenning (1996)(Correct)
Introduction
Deductive systems, given via axioms and rules of inference, are a common conceptual
tool in mathematical logic and computer science. They are used to specify
many varieties of logics and... / and Isabelle and the LF type theory implemented in Elf The br for systems not based on type theory. We do not make this distinction
5014.2 Multiagent Systems: A Survey from a Machine Learning Perspective - Stone, Veloso (1997)(Correct)
Distributed Artificial Intelligence (DAI) has existed as a subfield of AI for less than two decades. DAI is concerned with systems that consist of multiple independent entities that interact in a doma... / This is not intended as a general theory of agency.Although the ability br social machines This theory is based on the socio-biological
4897.8 Partial evaluation - Mogensen, Sestoft (1996)(Correct)
Introduction: What is partial evaluation?
Partial evaluation is a technique to partially execute a program, when only some
of its input data are available. Consider a program p requiring two inputs, ... / evaluators in recursive function theory. But as the example in the br in an applicative language A theory and implementation in the case of
4861.1 The Power of Vacillation in Language Learning - John Case (1992)(Correct)
Some extensions are considered of Gold's influential model of language learning by machine
from positive data. Studied are criteria of successful learning featuring convergence in the limit
to vacilla... / the perspective of formal language theory such that some M identifies br to prove in Zermelo-Frankel Set Theory Jec that they are equivalent.
4811.0 Receptive Field Weighted Regression - Schaal, Atkeson (1997)(Correct)
We introduce a constructive, incremental learning system for regression problems that models
data by means of spatially localized linear models. In contrast to other approaches, the size and
shape of ... / solidly grounded in approximation theory Powell In br M. A. Ed.The Handbook of Brain Theory and Neural Networks pp. - .
4627.7 Introducing OBJ - Goguen, Winkler, Meseguer.. (1993)(Correct)
This is an introduction to OBJ, describing its philosophy, its syntax, its history, and aspects of
its semantics, both logical and operational. Many examples are given, using Release 2 of OBJ3,
which ... / the formal entities in an interface theory to actual entities in a module br requirements of the interface theory. Module expressions allow
4552.4 Tractable Reasoning via Approximation - Schaerf, Cadoli (1995)(Correct)
Problems in logic are well-known to be hard to solve in the worst case. Two
different strategies for dealing with this aspect are known from the literature:
language restriction and theory approximati... / language restriction and theory approximation. In this paper we br a list of desiderata for a new theory of approximation. The major
4536.8 Nontraditional Applications of Automata Theory - Vardi (1994)(Correct)
Finite automata have two traditional applications in computer science: modeling
of finite-state systems and description of regular set of finite words. In the last
few years, several new applications ... / Applications of Automata Theory Moshe Y. Vardi Dept. of br change the way we teach automata theory. Introduction The theory of
4313.5 Combinatorial Representation Theory - Barcelo, Ram(Correct)
this article we give a personal viewpoint on the field while remaining
aware that there is much important and beautiful work that we have not been able to mention.
On the other hand, we have tried ver... / Combinatorial Representation Theory H' el ene Barcelo Department br on combinatorial representation theory. What follows is our attempt to
4272.1 Achievements of Relational Database Schema Design Theory Revisited - Biskup (1998)(Correct)
Database schema design is seen as to decide on formats for
time-varying instances, on rules for supporting inferences and on semantic
constraints. Schema design aims at both faithful formalization o... / Relational Database Schema Design Theory Revisited Joachim Biskup br Completeness and Unique Flavor. A theory of schema design is to
4244.9 Behavior-Based Robotics as a Tool for Synthesis of Artificial.. - Mataric (1998)(Correct)
This paper appeared in Trends in Cognitive Science, Vol. 2, No. 3, March 1998, 82-87.) unknown Behavior-Based Robotics as a Tool for Synthesis of
Artificial Behavior and Analysis of Natural Behavior
... / powerful frameworks such as schema theory In behavior-based systems br the engineering field of Control Theory. that can be implemented either in
4208.5 Checking verifications of protocols and distributed systems by.. - Groote, Monin, Pol (1998)(Correct)
We provide a treatise about checking proofs of distributed systems by computer using general
purpose proof checkers. In particular, we present two approaches to verifying and checking the
verification... / aimed at any concurrency theory. Because we are most acquainted br occurring in the concurrency theory. Higher order provers such as Coq
4094.5 Separating Formal Bounds from Practical Performance in Learning.. - Cohn (1992)(Correct)
Separating Formal Bounds from Practical Performance in Learning
Systems
by David Cohn
Chairperson of Supervisory Committee:
Richard Ladner
Department of Computer Science and Engineering
Learning the... / Science and Engineering Learning theory has attempted to establish among br improvement in generalization that theory predicts. Table of Contents
4087.1 Navigation in Electronic Worlds: Research Review for Depth Oral Exam.. - Modjeska (1997)(Correct)
Data Spaces), places visual
features in an order-dependent way:
1. Districts are found by cluster analysis.
2. Edges are created quickly by drawing a line between the nearest neighbors in adjacent clu... / perspective and reviews some theory and experiments in hypermedia. br Information foraging theory is used to analyze human
4074.2 Operating System Issues for Continuous Media - Schulzrinne (1996)(Correct)
This memory bottleneck was
observed, for example, for a software MPEG decoder [19], where memory bandwidth, not the processing
for the inverse cosine transform limited the achievable frame rate. Disk ... / results from scheduling theory. First it is helpful to br IEEE Transactions on Information Theory vol. pp. - Jan. .
3987.0 Knowledge-Based Artificial Neural Networks - Towell, Shavlik (1994)(Correct)
Hybrid learning methods use theoretical knowledge of a domain and a set of classified examples
to develop a method for accurately classifying examples not seen during training. The challenge of
hybrid... / learning hybrid algorithms theory refinement computational biology br student. That is state a domain theory that describes how to
3934.1 Information Dynamics In Physiological Control Systems - Rezek (1997)(Correct)
Causality is often measured by means of the correlation function. This function
has been shown to be restrictive at best and false at worst. The accurate determination
of causal relationships is part ... / It is shown that Information Theory can lend tools to all three of br . . . Theory review of metric spaces .
3849.6 Learning Dynamic Bayesian Networks - Ghahramani (1997)(Correct)
Bayesian networks are directed acyclic graphs that represent dependencies between variables in a probabilistic model. Many time series models, including the hidden Markov models (HMMs) used in speec... / and the true process. Probability theory provides a powerful tool for br marriage of probability theory and graph theory in which
3808.4 Computational Morphology of Implicit Curves - de Figueiredo (1992)(Correct)
We divide the computation of polygonal approximations of implicit objects into two phases:
sampling and structuring. Unlike classical treatments, we study each phase separately.
Classical sampling met... / by using classical elimination theory at the cost of degree explosion br became a classical problem in graph theory. A spanning tree for a graph is
3757.0 Incremental Constraint-based Parsing: An Efficient Approach for.. - Güngördu (1997)(Correct)
In this dissertation, I provide a left-to-right incremental parsing approach for Headdriven
Phrase Structure Grammar (HPSG; Pollard and Sag (1987, 1994)). HPSG is a
lexicalized, constraint-based theor... / is a lexicalized constraint-based theory of grammar which has also been br reality of any existing linguistic theory one has to prove that grammars
3678.8 Distributed reasoning and learning in Bayesian expert systems - Díez, Mira(Correct)
This paper presents Bayesian networks as a framework for distributed reasoning
in expert systems. We discuss methods for evidence propagation, for learning, with
emphasis on sequential learning, and f... / systems based on Dempster-Shafer theory where dependencies and br in the sense of probability theory are not explicitly shown
3658.4 A Taxonomy of Proof Systems - Goldreich (1997)(Correct)
Several alternative formulations of the concept of an efficient proof system are nowadays
coexisting in our field. These systems include the classical formulation of NP , interactive proof
systems (gi... / which has appeared in Complexity Theory Retrospective II L.A. br developments have reached the non-theory community and a few were even
3602.6 A Meta-theory for Structured Presentations in the COC - Shulman (1997)(Correct)
viii
1 Introduction: Structural Organization of Constructive Logics through
Theory Presentations : : : : : : : : : :... / A Meta-theory for Structured Presentations in br The dissertation A Meta-theory for Structured Presentations in
3602.0 Experience with a Clustered Parallel Reduction Machine - Beemster, Hartel, Hertzberger.. (1993)(Correct)
A clustered architecture has been designed to exploit divide and conquer parallelism in
functional programs. The programming methodology developed for the machine is based
on explicit annotations and ... / calculus which is a mathematical theory that provides a sound basis for br -some contributions to its theory its implementation and its
3573.6 What Your Computer Really Needs to Know, You Learned in Kindergarten - Durfee (1992)(Correct)
Research in distributed AI has led to computational
techniques for providing AI systems with
rudimentary social skills. This paper gives a brief
survey of distributed AI, describing the work that
stri... / including using cases and utility theory to negotiate compromises Sycara br the perspective of organization theory and management science which
3528.1 Formalizing Automata II: Decidable Properties - Constable(Correct)
Is it possible to create formal proofs of interesting mathematical theorems which are mechanically
checked in every detail and yet are readable and even faithful to the best expositions
of those resul... / namely that the underlying formal theory must include primitive notions of br about the formalization of automata theory. As in the first paper the
3518.8 Cluster-Based Scalable Network Services - Fox, Gribble, Chawathe, Brewer.. (1997)(Correct)
This paper has benefited from the detailed and perceptive comments of our reviewers, especially our shepherd Hank Levy. We thank Randy Katz and Eric Anderson for their detailed readings of early draft... / and versions. Also basic queueing theory shows that a large central
3515.0 Behavior-Based Control for Time-Delayed Teleoperation - Stein (1994)(Correct)
Behavior-Based Control for Time-Delayed
Teleoperation Matthew R. Stein
Richard P. Paul
Remote control of robotic manipulation has applications in undersea, shallow space
and low bandwidth communicati... / Theory . The Time Delay Problem br sensors. Chapter Theory This section first presents a
3514.4 Lecture Notes on Approximation Algorithms - Volume I - Motwani (1992)(Correct)
Contents
1 Introduction 7
1.1 Preliminaries and Basic Definitions . . . . . . . . . . . . 9
1.2 Absolute Performance Guarantees . . . . . . . . . . . . . 12
1.2.1 Absolute Approximation Algorithms . ... / elementary concepts from complexity theory are presented. Two measures of br practice are NP-hard. Complexity theory tells us that it is impossible to
3513.1 Different roles and mutual dependencies of data, information, and.. - Aamodt, Nygård (1995)(Correct)
The unclear distinction between data, information, and knowledge has impaired their combination and utilization
for the development of integrated systems. There is need for a unified definitional mode... / within e.g.electrical signal theory database theory library br electrical signal theory database theory library science or pragmatic
3490.8 Pict: A Programming Language Based on the Pi-Calculus - Pierce, Turner (1997)(Correct)
The π-calculus offers an attractive basis for concurrent programming. It is small, elegant, and well studied, and supports (via simple encodings) a wide range of high-level constructs including dat... / semantics and tractable algebraic theory. A similar combination of br Mart'in Abadi and Luca Cardelli. A Theory of Objects. Springer-Verlag
3469.1 Quality of Service Provision in Noncooperative Networks: Heterogenous .. - Park, Sitharam, Chen (1997)(Correct)
This paper studies the quality of service (QoS) provision problem in noncooperative networks
where applications or users are selfish and routers implement a general class of packet scheduling
discipli... / and noncooperative game theory. We construct a noncooperative br of microeconomics and game theory and show that under certain
3414.7 Cryptographic Hash Functions: A Survey - Bakhtiari, Safavi-Naini, Pieprzyk (1995)(Correct)
This paper gives a survey on cryptographic hash functions. It gives an overview of all types of hash functions and reviews design principals and possible methods of attacks. It also focuses on keyed h... / of hash functions Information Theory and Complexity Theory are two br Information Theory and Complexity Theory are two major approaches. The
3409.4 Tackling Real-Coded Genetic Algorithms: Operators and Tools for.. - Herrera, Lozano, Verdegay (1998)(Correct)
Genetic algorithms play a significant role, as search techniques for handling
complex spaces, in many fields such as artificial intelligence, engineering, robotic,
etc. Genetic algorithms are based ... / familiar with fundamental GA theory didn't understand the great br of BCGA iteration. The schema theory that describes the GA behaviour
3400.0 A Historical Application Profiler for Use by Parallel Schedulers - Gibbons (1997)(Correct)
A Historical Application Profiler for Use by Parallel Schedulers
Richard Gibbons
Master of Science
Graduate Department of Computer Science
University of Toronto
1997
Scheduling Algorithms that use app... / Allowed Me To Access The Cornell Theory Center Ibm Sp Log Files. I br Characterization . Cornell Theory Center Ibm Sp .
3397.9 Information Geometric Measurements of Generalisation - Zhu, Rohwer (1995)(Correct)
Neural networks can be regarded as statistical models, and can be analysed in a
Bayesian framework. Generalisation is measured by the performance on independent
test data drawn from the same distribut... / respect to representation. The theory generalises the least mean squares br generalises the least mean squares theory for linear Gaussian models to
3389.9 Receptive Fields and Maps in the Visual Cortex: Models of Ocular.. - Miller (1995)(Correct)
The formation of ocular dominance and orientation columns
in the mammalian visual cortex is briefly reviewed. Correlation-based models
for their development are then discussed, beginning with the mode... / . As shall be discussed one theory for the development of br These func Goodhill's theory is identical to the model of
3383.1 Descriptive Complexity of Optimization and Counting Problems - Thakur (1992)(Correct)
viii
Acknowledgments x
1. Introduction to Descriptive Complexity 1
2. Logic Preliminaries 4
I Optimization Problems 7
3. Introduction 8
3.1 Towards a structural theory of optimization problems : : : ... / . Towards a structural theory of optimization problems br the interesting field of Complexity Theory through his classes and many
3351.8 Higher-Order Logic Programming - Nadathur, Miller (1986)(Correct)
ly,
if a tactic R holds of G1 and G2, i.e., if (R G1 G2) is solvable from a presentation of primitive
tactics as a set of definite clauses, then satisfying the goal G2 in the object-language should su... / users of these languages and its theory is well developed. The success br logic namely Church's Simple Theory of Types Chu Following this
3308.3 An Analysis of the Core-ML Language: Expressive Power and Type.. - Kanellakis, Hillebrand, Mairson (1994)(Correct)
Core-ML is a basic subset of most functional programming
languages. It consists of the simply typed (or monomorphic) -calculus,
simply typed equality over atomic constants, and let as the only poly... / survey here. It is based on the theory of database queries or br or equivalently on finite model theory. Our framework is explained in
3293.8 Neuro-Fuzzy Systems In Control - Ojala (1994)(Correct)
Tiivistelmä
List of abbreviations
List of symbols
1 Introduction
2 Basics of neural networks
2.1 Biological and artificial neural networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
... / Neuro-fuzzy systems combine the theory of two popular computational br the principles of the fuzzy logic theory and fuzzy systems are discussed.
3267.0 A Discrete Lagrangian-Based Global-Search Method for Solving.. - Wah, Shang (1998)(Correct)
Satisfiability is a class of NP-complete problems that model a wide range of real-world applications. These problems are difficult to solve because they have many local minima in their search space, o... / Workshop on Satisfiability Problem Theory and Applications Ding-Zhu Du br We review in Section general theory for solving continuous constrained
3257.6 Imagining CLP(^,= \alpha\beta ) - Ridoux (1995)(Correct)
We study under which conditions the domain of -terms ()
and the equality theory of the -calculus (j fffi ) form the basis of a usable
constraint logic programming language (CLP). The conditions are ... / of terms and the equality theory of the calculus j fffi br conditions are that the equality theory must contain axiom j and the
3235.5 Continuous-based Heuristics for Graph and Tree Isomorphisms, with.. - Pelillo, Siddiqi, Zucker (1999)(Correct)
We present a new (continuous) quadratic programming approach for graph- and
tree-isomorphism problems which is based on an equivalent maximum clique
formulation. The approach is centered around a fund... / examples of which are singularity theory combinatorial topology and br topology and spectral graph theory. In more recent years with the
3203.3 Number-Theoretic Constructions of Efficient Pseudo-Random Functions - Naor, Reingold (1997)(Correct)
We describe efficient constructions for various cryptographic primitives (both in privatekey
and in public-key cryptography). We show these constructions to be at least as secure as
the decisional ver... / and to computational learning-theory. Simple The simple algebraic br is no easier than factoring Theory of Cryptography Library Record
3197.5 Galerkin Approximations of the Generalized Hamilton-Jacobi-Bellman.. - Beard, Saridis, Wen (1996)(Correct)
In this paper we study the convergence of the
Galerkin approximation method applied to the Generalized
Hamilton-Jacobi-Bellman (GHJB) equation
over a compact set containing the origin. The GHJB
equati... / The basic mathematical theory for classical optimal control is br the Ritz-Galerkin approximation theory that is employed in a different
3181.4 A Computational Theory Of Vocabulary Expansion - Ehrlich, Rapaport (1997)(Correct)
This project concerns the development and implementation of a computational theory of how
human readers and other natural-language-understanding systems can automatically expand
their vocabulary by de... / A Computational Theory Of Vocabulary Expansion Project br implementation of a computational theory of how human readers and other
3175.8 Between functions and relations in calculating programs - Hutton (1992)(Correct)
This thesis is about the calculational approach to programming, in which one derives
programs from specifications. One such calculational paradigm is Ruby, the
relational calculus developed by Jones a... / some useful concepts from lattice theory the basic algebra of relations br b a R b b S cg. The basic theory of binary relations was developed
3165.3 Compiling Haskell by program transformation: a report from the.. - Jones (1996)(Correct)
Many compilers do some of their work by means of correctness-preserving, and hopefully performance-improving, program transformations. The Glasgow Haskell Compiler (GHC) takes this idea of "compilatio... / is the close interplay between theory and practice a particularly br experience The interaction of theory and practice is genuine not
3158.4 The Role of the Software Engineer in Real-Time Software Development.. - Hoover (1995)(Correct)
A noteworthy feature of the computing industry is the
increasing demand for application-specific software. For example,
software to control a factory in real-time involves timing, faulttolerance,
an... / a gap between real-time computing theory and industrial engineering br shows how real-time computing theory can be incorporated into software
3155.5 Krylov Space Methods on State-Space Control Models - Boley (1994)(Correct)
We give an overview of various Lanczos/Krylov space methods and how they are being used for
solving certain problems in Control Systems Theory based on state-space models. The matrix methods
used are ... / certain problems in Control Systems Theory based on state-space models. The br be applied to problems in Control Theory such as controllability
3105.2 Substructural Logics on Display - Goré (1998)(Correct)
Substructural logics are traditionally obtained by dropping some or all of the structural rules from
Gentzen's sequent calculi LK or LJ. It is well known that the usual logical connectives then split ... / in a modular way. Using the Gaggle Theory of Dunn we outline relational br intuitionistic modal logics proof theory gaggle theory. Work partially
3100.1 Synchronization and Desynchronization in a Network of Locally Coupled .. - Campbell, Wang (1996)(Correct)
A network of Wilson-Cowan oscillators is constructed, and its emergent properties of
synchronization and desynchronization are investigated by both computer simulation and formal
analysis. The network... / In the correlation theory of von der Malsburg and Schneider br the binding problem. Recently the theory of oscillatory correlation has
3098.7 Similarity Searching in Large Image DataBases - Petrakis, Faloutsos (1995)(Correct)
We propose a method to handle approximate searching by image content in large image
databases. Image content is represented by attributed relational graphs holding features of
objects and relationship... / presentation of the underlying theory are presented in Section . A
3096.3 Coalitions among Computationally Bounded Agents - Sandholm, Lesser(Correct)
This paper analyzes coalitions among self-interested agents that need to solve combinatorial optimization problems to operate efficiently in the world. By colluding (coordinating their actions by solv... / and protocol-independent theory of coalitions among br is called a mechanism in game theory guarantees that
3082.6 Synthesizing Regularity Exposing Attributes in Large Protein Databases - Maza (1993)(Correct)
This thesis describes a system that synthesizes regularity exposing attributes from
large protein databases. After processing primary and secondary structure data, this
system discovers an amino acid ... / . . Computational learning theory br results from computational learning theory to the secondary structure
3047.8 Information Retrieval, Information Structure, and Information Agents - Rus, Subramanian (1995)(Correct)
This paper presents a customizable architecture for software agents that capture and
access information in large, heterogeneous, distributed electronic repositories. The key
idea is to exploit underly... / the keywords cognitive theory practice and data produces br to reveal them. We advance the theory that such structure is a natural
3043.8 Programming Language Semantics in Foundational Type Theory - Crary (1998)(Correct)
There are compelling benefits to using foundational type theory as a framework for programming
language semantics. I give a semantics of an expressive programming calculus in the
foundational type the... / Semantics in Foundational Type Theory Karl Crary Cornell br benefits to using foundational type theory as a framework for programming
3034.9 Empirical Risk Approximation: An Induction Principle for Unsupervised .. - Buhmann (1998)(Correct)
Unsupervised learning algorithms are designed to extract structure from data without
reference to explicit teacher information. The quality of the infered structure is determined
by a quality function... / process. This paper presents a theory of unsupervised learning based on br successful statistical learning theory of classification and regression
3025.0 Explicit Polymorphism and CPS Conversion - Harper (1993)(Correct)
We study the typing properties of CPS conversion for an extension of F ! with control operators. Two classes of evaluation strategies are considered, each with call-by-name and call-by-value variants.... / U.S. Government. Keywords type theory calculus continuations br Among the many advances in the theory and practice of programming
3004.1 Two Algorithms for Nearest-Neighbor Search in High Dimensions - Kleinberg (1997)(Correct)
Representing data as points in a high-dimensional space, so as to use geometric methods for indexing, is an algorithmic technique with a wide array of uses. It is central to a number of areas such as ... / IEEE Transactions on Information Theory pp. - . S. br of some graphs J. Combinatorial Theory Ser. B pp. - .
2980.1 On The Acceptability Of Arguments And Its Fundamental Role In.. - Dung (1995)(Correct)
The purpose of this paper is to study the fundamental mechanism, humans use in argumentation, and to explore ways to implement this mechanism on computers. We do so by first developing a theory for ar... / We do so by first developing a theory for argumentation whose central br or appropriateness of our theory with two strong arguments. The
2968.0 A Type-Theoretic Approach to Higher-Order Modules with Sharing - Harper, Lillibridge (1993)(Correct)
The design of a module system for constructing and maintaining large programs is a difficult task that raises a number of theoretical and practical issues. A fundamental issue is the management of the... / U.S. Government. Keywords type theory modularity abstraction sharing br T. van Daalen. The Language Theory of AUTOMATH. PhD thesis
2955.5 On Binary Methods - Bruce, Cardelli, Castagna, al. (1995)(Correct)
This paper offers a comprehensive description of the problems arising from typing binary methods, and collects and contrasts diverse views and solutions. It summarizes the current debate on the proble... / C Fl John Wiley Sons Inc. Theory And Practice Of Object Systems br Similarly Several Classes May Theory And Practice Of Object Systems
2947.3 Volume Bounded Molecular Computation - Fu (1997)(Correct)
The number of molecular strands used by a molecular algorithm is an important
measure of the algorithm's complexity. This measure is also called the volume used
by the algorithm. In this thesis, we st... / Lovasz for creating a wonderful theory environment. James Aspnes made br I built a solid foundation in theory of computation. Shouwen Tang my
2937.7 Formalising Abilities and Opportunities of Agents - van Linder, van der Hoek, Meyer (1998)(Correct)
We present a formal system to reason about and specify the behavior of multiple intelligent artificial agents. Essentially, each agent can perform certain actions, and it may possess a variety of info... / as basic building blocks for their theory of agents. However they consider br not our aim to provide a complete theory of results incorporating all
2936.3 TIL: A Type-Directed Optimizing Compiler for ML - Tarditi, Morrisett, Cheng (1995)(Correct)
We describe a new compiler for Standard ML called TIL, that is based on four technologies: intensional
polymorphism, tag-free garbage collection, conventional functional language optimization,
and loo... / Standard ML compilation type theory polymorphism tag-free garbage
2917.1 Beyond Digital Naturalism - Fontana, Wagner, Buss (1994)(Correct)
The success of Artificial Life depends on whether it will help solving the conceptual
problems of biology. Biology may be viewed as the science of the transformation
of organizations. And, yet, biolog... / And yet biology lacks a theory of organization. We use this as br arises in the first place. Darwin's theory is not intended to answer this.
2908.4 Relearning After Damage in Connectionist Networks: Toward a Theory of .. - David Plaut (1996)(Correct)
Connectionist modeling offers a useful computational framework for exploring the nature of normal and impaired
cognitive processes. The current work extends the relevance of connectionist modeling in ... / Connectionist Networks Toward a Theory of Rehabilitation David C. br make important contributions to a theory of rehabilitation in patients.
2903.0 Deriving Petri Nets from Finite Transition Systems - Cortadella, Kishinevsky, Lavagno.. (1998)(Correct)
This paper presents a novel method to derive a Petri net from any specification model
that can be mapped into a state-based representation with arcs labeled with symbols from an
alphabet of events (a ... / TS The method is based on the theory of regions for Elementary br Petri nets The above theory provides an efficient framework to
2886.8 Theory Combination: an alternative to Data Combination - Ting, Low (1996)(Correct)
The approach of combining theories learned from multiple batches of data provide an
alternative to the common practice of learning one theory from all the available data (i.e.,
the data combination ap... / Theory Combination an alternative to br the common practice of learning one theory from all the available data i.e.
2884.9 Learning to Reason - Khardon (1994)(Correct)
ing with credit is permitted. To copy otherwise, to republish, to post on
servers, to redistribute to lists, or to use any component of this work in other works, requires prior
specific permission and... / how previous results from learning theory and reasoning fit into this br Roth General Terms Algorithms Theory Additional Key Words and Phrases
2825.1 Clausal Discovery - De Raedt, Dehaspe (1996)(Correct)
The clausal discovery engine Claudien is presented. Claudien is an inductive
logic programming engine that fits in the knowledge discovery in databases
and data mining paradigm as it discovers regular... / with first order logic and model theory see Lloyd Genesereth and br I is a model for a clausal theory T if and only if it is a model
2824.2 Issues in Autonomous Mobile Robot Navigation - Singhal (1997)(Correct)
Three main problems facing outdoor autonomous mobile robot navigation are unstructured
environments, moving obstacles, and multiple sensors. Each of these leads
to uncertainties that usually cannot be... / modeling data fusion control theory and related topics. The third br devices themselves along with poor theory and control of sensors
2824.0 Issues in the Numerical Solution of Evolutionary Delay Differential.. - Baker, Paul, Willé (1994)(Correct)
Delay differential equations are of sufficient importance in modelling real-life
phenomena to merit the attention of numerical analysts. In this paper, we discuss
key features of delay differential eq... / English-language literature on the theory of DDEs and a growing literature br the second which arises in number theory and as a simple model of
2799.8 Parallelism and the Bird-Meertens Formalism - Skillicorn (1992)(Correct)
One of the major reasons for the lack of practical use of parallel computers
has been the absence of a suitable model of parallel computation. A useful
general model must be architecture independent, ... / illustrate using the Bird-Meertens theory of lists. Keywords data br abstract approaches include Array Theory and Mathematics of
2755.3 A Hierarchy of Qualitative Representations for Space - Kuipers (1996)(Correct)
Research in Qualitative Reasoning builds and uses discrete
symbolic models of the continuous world. Inference
methods such as qualitative simulation are
grounded in the theory of ordinary differential... / simulation are grounded in the theory of ordinary differential br Kuipers Byun That theory was motivated by two insights from
2743.4 Change of structure in financial time series, long range dependence.. - Mikosch, Starica (1999)(Correct)
Functionals of a two-parameter integrated periodogram have been used for a long time for detecting
changes in the spectral distribution of a stationary sequence. The bases for these results are
functi... / et al. for the statistical theory of tail and high quantile br in classical time series theory and that the asymptotic normal
2728.8 An Overview of Larch/C++: Behavioral Specifications for C++ Modules - Gary Leavens (1996)(Correct)
An overview is presented of the behavioral interface specification language
Larch/C++. The features of Larch/C++ used to specify the behavior
of C++ functions and classes, including subclasses, are de... / The toolkit in Z is based on set theory it has a relatively elaborate br Figure . That figure specifies a theory in LSL using a LSL module which
2727.4 Mutual Information, Metric Entropy, and Cumulative Relative Entropy.. - Haussler, Opper (1996)(Correct)
Assume fP ` : ` 2 \Thetag is a set of probability distributions with a common dominating measure
on a complete separable metric space Y . A state `
2 \Theta is chosen by Nature. A statistician
gets... / Of special interest in information theory data compression mathematical br finance computational learning theory and statistical mechanics is the
2677.5 Robust Permanent Income and Pricing - Hansen, Sargent, Tallarini, Jr. (1997)(Correct)
This paper uses a permanent income model as a laboratory to study how consumption
/savings profiles and security market prices are altered when consumers are `robust
decision makers'. Robust decision ... / relates to the max-min utility theory of Gilboa and Schmeidler br a formulation of robust decision theory induced by the risk-sensitivity
2672.3 Information Retrieval and Information Theory - Berger (1999)(Correct)
Information retrieval is concerned with how to classify information and how to judge the similarity
between two objects, such as written documents. As the amount of information available in digital fo... / Retrieval and Information Theory Adam Berger Thesis proposal br this information. Information theory is concerned with the production
2660.9 Dynamic System Evolution and Markov Chain Approximation - Melnik (1998)(Correct)
In this paper computational aspects of the mathematical modelling of dynamic system evolution have been
considered as a problem in information theory. The construction of such models is treated as a d... / as a problem in information theory. The construction of such models br information optimal control theory hyperbolicity of dynamic rules
2656.2 The Experimental Study of Machine Learning - Langley, Kibler (1991)(Correct)
this paper.
The goal of scientific experimentation is to better understand a class of behaviors
and the conditions under which they occur. Ideally, this will lead to empirical laws
and theories, as we... / a variety of tests that guide the theory-generation process. These include br matter how elegant or consistent a theory that disagrees with the data must
2652.7 Search Algorithms in Type Theory - Caldwell, Gent, Underwood (1997)(Correct)
The importance of search problems in computer science has led to
many advances in search techniques. However, techniques developed for
a particular search problem may not be easily applied to other pr... / Search Algorithms in Type Theory James L. Caldwell y br particular kinds of proofs in type theory using the proofs-as-programs
2635.1 Typed Closure Conversion - Minamide, Morrisett, Harper (1996)(Correct)
We study the typing properties of closure conversion for simply-typed and polymorphic -calculi. Unlike most accounts of closure conversion, which only treat the untyped -calculus, we translate well-ty... / Keywords closure conversion type theory polymorphism Abstract We
2631.1 A theory of mixin modules: basic and derived operators - Ancona, Zucca (1996)(Correct)
Mixins are modules in which some components are deferred , i.e. their definition has to
be provided by another module. Moreover, differently from parameterized modules (like ML
functors), mixin module... / A theory of mixin modules basic and br editors Proc. TAPSOFT ' Theory and Practice of Software
2629.4 Probabilistic Proof Systems (A Survey) - Goldreich (1995)(Correct)
Various types of probabilistic proof systems have played a central role in the development
of computer science in the last decade. In this exposition, we concentrate
on three such proof systems --- in... / that here as usual in complexity theory the oracle answers are always br . L. Babai. Trading Group Theory for Randomness. In th STOC
2628.7 Separating hippocampal maps - Redish, Touretzky (1997)(Correct)
The place fields of hippocampal cells in old animals sometimes change when an animal
is removed from and then returned to an environment [ Barnes et al., 1997 ] . The ensemble
correlation between two ... / be returning to the wrong map. A theory proposed by Samsonovich and br transition. The reference frame theory Over the last few years we
2628.6 Neural Networks - Baddeley(Correct)
Introduction
This chapter is aimed at the physiologist new to neural networks and the student
wishing to experiment for the first time. The chapter will describe general
principles the author has fou... / technical introduction to network theory see but be warned this is br L.N. Cooper and P.W. Munro. Theory for the development of neuron
2625.0 Ergodic, primal convergence in dual subgradient schemes for convex.. - Larsson, Patriksson, Strömberg(Correct)
Lagrangean dualization and subgradient optimization techniques are frequently
used within the field of computational optimization for finding approximate
solutions to large, structured optimization pr... / developments of Lagrangean duality theory in nonlinear programming see br briefly review Lagrangean duality theory for convex programming together
2617.7 Construction Methods for Covering Codes - Östergård (1993)(Correct)
A covering code in a Hamming space is a set of codewords with the property
that any word in the space is within a specified Hamming distance, the covering radius,
from at least one codeword. In this... / pool systems and other coding theory issues. It was a true pleasure to br IEEE Transactions on Information Theory . P P. R.
2615.2 Uniform Closures: Order-Theoretically Reconstructing Logic Program.. - Giacobazzi, al.(Correct)
Domain Refinements
Roberto Giacobazzi
Dipartimento di Informatica
Universit`a di Pisa
Corso Italia 40, 56125 Pisa, Italy
giaco@di.unipi.it
Francesco Ranzato
Dipartimento di Matematica Pura ed Appl... / for logic programs and in the theory of abstract domain refinements. In br is a well-established theory for program analysis
2600.7 Property Testing and its Connection to Learning and Approximation - Goldreich, Goldwasser, Ron(Correct)
We study the question of determining whether an unknown function has a particular property or is ffl-far from any function with that property. A property testing algorithm is given a sample of the val... / testing and problems in learning theory. Next we focus on testing graph br version available from theory.lcs.mit.edu oded y Dept. of
2595.2 Probabilistic and Truth-Functional Many-Valued Logic Programming - Thomas Lukasiewicz (1998)(Correct)
We introduce probabilistic many-valued logic programs in which the implication
connective is interpreted as material implication. We show that probabilistic many-valued logic
programming is computat... / fixpoint characterization a proof theory and computational properties that br We especially introduce the proof theory of many-valued logic programming
2572.5 How to Divide a Territory? A New Simple Differential Formalism for.. - Nguyen, Kreinovich (1999)(Correct)
In many practical problems, we must optimize a set function, i.e., find
a set A for which f(A) ! max, where f is a function defined on the class
of sets. Such problems appear in design, in image proce... / in image processing in game theory etc. Most optimization problems br For example General Relativity Theory is formulated in this form with a
2563.9 Optimal Prefetching via Data Compression - Vitter, Krishnan (1995)(Correct)
Caching and prefetching are important mechanisms for speeding up access time to data on secondary
storage. Recent work in competitive online algorithms has uncovered several promising
new algorithms f... / work in computational learning theory which has shown that br there is work in the information theory community on algorithms for
2535.4 Location Uncertainty in Mobile Networks: A Theoretical Framework - Rose, Yates (1996)(Correct)
As users, services, databases and computers become increasingly mobile, so fades the era
of the fixed network. Modern networks are becoming mobile networks which must accommodate
a broad range service... / stochastic ordering and information theory can enable quantitative br . . Difficulties for Information Theory and Paging
2525.7 Parametric Appearance Representation - Nayar, Murase (1996)(Correct)
In contrast to the traditional approach, the recognition problem is formulated
as one of matching appearance rather than shape. For any given
vision task, all possible appearance variations define its... / by developing a comprehensive theory and a novel algorithm for pattern br well-known in pattern recognition theory that each of the images can
2524.3 First-order Logic Characterization of Program Properties - Ke Wang(Correct)
A program is first-order reducible (FO-reducible) with respect to (wrt) a set of integrity
constraints if there exists a first-order theory T such that the set of models for T is exactly
the set of in... / if there exists a first-order theory T such that the set of models br set of models for a first-order theory. Deductive databases are hardly
2516.2 Possible New Directions in Mathematical Foundations of Fuzzy.. - Nguyen, Kreinovich (1998)(Correct)
this paper, we describe
new possible application-oriented directions towards
formalizing these new ideas: unknown Possible New Directions in
Mathematical Foundations of Fuzzy Technology:
A Contributio... / to the Mathematics of Fuzzy Theory Hung T. Nguyen and br of fuzzy logic and fuzzy set theory such as fuzzy control
2513.8 Nonholonomic Motion Planning: Steering Using Sinusoids - Murray (1993)(Correct)
this paper is as follows: in Section 2, we collect some mathematical preliminaries from the literature on controllability of nonlinear systems and on classification of free Lie algebras. These are dra... / the problem to one in control theory. Roughly speaking we would like br classical references in control theory and Lie
2510.4 Genetic Algorithms - Mühlenbein (1997)(Correct)
this paper. Bremermann's
algorithm contained most of the ingredients of a good evolutionary algorithm. But because
of limited computer experiments and a missing theory, he did not find a good combin... / should be based on a solid theory. I object popular arguments along br computer experiments and a missing theory he did not find a good
2506.6 Multi-Scale Segmentation of Grey-Scale Images - Olsen (1996)(Correct)
The topic of this thesis is segmentation of grey--scale images by accessing and
relating the structures of the image for all reasonable scales. Grey--scale images are
regarded as physical measurements... / Gaussian scale space and Morse theory. The problem of segmentation is br and the segments. Catastrophe theory is used to analyse the structure
2504.2 Module-Based Reinforcement Learning: Experiments with a Real Robot - Kalmár, al. (1998)(Correct)
The behavior of reinforcement learning (RL) algorithms is best understood in completely observable, discrete-time controlled Markov chains with finite state and action spaces. In contrast, robot-lea... / then a mathematically well-founded theory has been constructed for a large br for MDPs and their associated theory. Next the concept of recursive
2502.2 Treating Partiality in a Logic of Total Functions - Olaf Müller, Konrad Slind (1997)(Correct)
this paper we
take the latter course: we survey and compare methods used to support partiality
in a mechanization of a higher order logic featuring only total functions. The techniques
we discuss are ... / It might not be shoes. Domain theory. Functions over complete partial br extension HOLCF formalizes domain theory our theory for partial
2494.5 Multiwavelets: Theory and Applications - Strela (1996)(Correct)
A function OE(t) is refinable if it satisfies a dilation equation OE(t) =
P
k C k OE(2t \Gamma k). A
refinable function (scaling function) generates a multiresolution analysis (MRA): Set of
nested s... / Multiwavelets Theory and Applications by Vasily br Graduate Students Multiwavelets Theory and Applications by Vasily
2484.3 Evolutionary Robotics: the Sussex Approach - Harvey, Husbands, Cliff, Thompson.. (1996)(Correct)
this paper is primarily an overview of our work at Sussex. We discuss what artificial evolutionary techniques are appropriate, followed by discussion of which classes unknown Evolutionary Robotics: th... / are limited at least in theory to simple inhibition suppression br search space. Standard GA theory does not necessarily then apply.
2478.9 A Syntactic Theory of Dynamic Binding - Moreau (1997)(Correct)
Dynamic binding, which has always been associated with Lisp, is still
semantically obscure to many. Although largely replaced by lexical scoping, not
only does dynamic binding remain an interesting ... / A Syntactic Theory of Dynamic Binding To appear in br This paper presents a syntactic theory that enables the programmer to
2472.6 A Multistrategy Approach To Theory Refinement - Mooney, Ourston (1993)(Correct)
This chapter describes a multistrategy system that employs independent
modules for deductive, abductive, and inductive reasoning to revise an arbitrarily
incorrect propositional Horn-clause domain the... / A Multistrategy Approach To Theory Refinement Raymond J. Mooney br propositional Horn-clause domain theory to fit a set of preclassified
2469.6 Specification and Synthesis of Plans Using the Features and Fluents.. - Karlsson (1995)(Correct)
An autonomous agent operating in a dynamical environment will
face a number of different reasoning problems, one of which is how to
plan its actions in order to pursue its goals. For this purpose, it ... / Consequently standard complexity theory does not suffice when it comes to br However measures from complexity theory can be applied to subproblems
2464.3 Machine humour: An implemented model of puns - Binsted (1996)(Correct)
This thesis describes a formal model of a subtype of humour, and the implementation
of that model in a program that generates jokes of that subtype.
Although there is a great deal of literature on hum... / . . Riddle theory . br . . . The General Theory of Verbal Humour .
2445.6 From Chicken Squawking To Cognition: Levels Of Description And The.. - Cleeremans, French (1996)(Correct)
this paper, our
goals are to introduce and to discuss these issues. We argue for an essentially
utilitarian view of computational modeling. We suggest that
the main function of computational modeling ... / modification of the underlying theory. We propose that models just as br in making inferences from data to theory. As we attempt to show in the
2444.2 Compact Location Problems - Krumke, Marathe, Noltemeier.. (1997)(Correct)
We consider the problem of placing a specified number (p) of facilities on the nodes
of a network so as to minimize some measure of the distances between facilities. This
type of problem models a numb... / factor. Keywords Location Theory Approximation Algorithms br fundamental problems in location theory HM MF involve finding a
2429.3 Piecewise Linear Methods for Nonlinear Equations and Optimization - Allgower, Georg (1999)(Correct)
Introduction
Piecewise linear algorithms, also referred to in the literature as simplicial
algorithms, can be used to generate piecewise linear manifolds
which approximate the solutions of underdeter... / by means of homotopies or degree theory have been re-examined in terms of br and hence have at least in theory a more general range of
2426.5 The VEOS Project - Bricken, Coco (1993)(Correct)
Introduction
Computer technology has only recently become advanced enough to solve the problems it creates
with its own interface. One solution, virtual reality (VR), immediately raises fundamental
is... / a biological environmental modeling theory as an integrated software br expect from the virtual. theory of VR requires a reconciliation of
2415.8 Coalgebras in Specification and Verification for Object-Oriented.. - Jacobs (1999)(Correct)
The aim of this short note is to give an impression of the use of coalgebras
in speci cation and veri cation for object-oriented languages. Particular
emphasis will be given to the r^ole of coalgebrai... / is usually called coX in category theory. Examples are limit and colimit br mathematical foundation in the theory of coalgebras. As such they can
2411.8 Separating Stages in the Continuation-Passing Style Transformation - Lawall, Danvy (1993)(Correct)
The continuation-passing style (CPS) transformation is
powerful but complex. Our thesis is that this transformation
is in fact compound, and we set out to stage it. We
factor the CPS transformation in... / Science including Category Theory and Logic br H. Pitt et al.editors Category Theory and Computer Science number
2401.0 A Fixpoint Characterization Of Abductive Logic Programs - Inoue, Sakama (1996)(Correct)
this paper, we generalize the program transformation techniques of [17] for non-abductive programs to deal with abductive frameworks. We introduce a new translation from an abductive logic program int... / concluded in Section . . Model Theory for Abductive Logic Programs br of abducibles. . Fixpoint Theory for Abductive Logic Programs
2394.3 Nonequilibrium Radiative Heating Prediction Method for Aeroassist.. - Hartung (1991)(Correct)
Hartung, Lin C. Nonequilibrium Radiative Heating Prediction Method for
Aeroassist Flowfields with Coupling to Flowfield Solvers (Under the direction
of Dr. F. R. DeJarnette)
A method for predicting ra... / Radiation Theory v . Absorption br Transport Theory . Flowfield Coupling
2382.3 Number Restrictions on Complex Roles in Description Logics - Baader, Sattler (1996)(Correct)
Number restrictions are concept constructors that are available
in almost all implemented description logic systems. However, even
though there has lately been considerable effort on integrating expre... / a rather close interaction between theory and practice. One the one hand br plural quantifications based on a theory of collections. Minds and
2378.4 Computing Marginals Using Local Computation - Lauritzen, Shenoy (1996)(Correct)
This paper describes an abstract framework called valuation network for computation of marginals using local computation. In valuation networks, we represent knowledge using functions called valuation... / . Bayesian Probability Theory br Dempster-Shafer's Belief Function Theory
2354.8 Iterative Flow Analysis - John Plevyak (1995)(Correct)
Control and data flow information is vital for the optimization of high level programming
languages. Language features such as object-orientation and first class functions and selectors
link data flow... / representation In the theory of flow analysis the language to
2353.5 Integrating Theory and Practice in Parallel File Systems - Thomas Cormen(Correct)
Several algorithms for parallel disk systems have appeared in the literature recently, and
they are asymptotically optimal in terms of the number of disk accesses. Scalable systems
with parallel disks... / I O andDatabases Integrating Theory and Practice in Parallel File br for parallel-I O models. Yet theory has proven to be valuable in the
2326.8 Efficient Numerical Methods In Non-Uniform Sampling Theory - Feichtinger, Gröchenig, Strohmer (1995)(Correct)
We present a new "second generation" reconstruction algorithm for
irregular sampling, i.e. for the problem of recovering a band-limited
function from its non-uniformly sampled values. The efficient ne... / Methods In Non-Uniform Sampling Theory Hans G. Feichtinger Karlheinz br model For the discrete theory used below we follow A
2321.7 Benchmark problems in stability and design of switched systems - Liberzon, Morse (1999)(Correct)
A switched system is a hybrid dynamical system consisting of a family of continuous-time
subsystems and a rule that governs the switching between them. This paper surveys recent
developments in three ... / questions of interest in control theory and applications. Introduction br to different areas of control theory and applications. To make the
2319.0 Theory Of Regular M-Band Wavelet Bases - Steffen, Heller, Gopinath, Burrus (1993)(Correct)
This paper constructs K-regular M-band orthonormal wavelet bases. K-regularity of the
wavelet basis is known to be useful in numerical analysis applications and in image coding using
wavelet technique... / Issue On Wavelets December ' Theory Of Regular M-Band Wavelet Bases br Cml Tr- - nd March Theory Of Regular M-Band Wavelet Bases
2318.2 Analysis of RNA Sequence Structure Maps by Exhaustive Enumeration - Grüner, Giegerich, Strohmann.. (1996)(Correct)
The mapping from RNA sequences to their secondary structures is investigated by exhaustively
folding all GC and AU sequences with chain lengths up to 30. We analyse the distribution
of secondary struc... / on these findings a random-graph theory was developed that explains br of RNA Sequence-Structure Maps theory among them connectedness and
2316.9 Relevant Examples and Relevant Features: Thoughts from Computational.. - Blum (1994)(Correct)
this paper I will attempt to
survey some of the results and intuitions developed in
the area of computational learning theory. My focus
will be on two issues in particular: that some examples
may be m... / from Computational Learning Theory Avrim L. Blum School of br the area of computational learning theory. My focus will be on two issues
2315.7 Parametric Real-time Reasoning - Alur, Henzinger, Vardi (1993)(Correct)
Traditional approaches to the algorithmic verification of real-time systems
are limited to checking program correctness with respect to concrete timing properties
(e.g., "message delivery within 10 ... / open problems of logic and automata theory. Introduction Over the last br of the th Annual ACM Symposium on Theory of Computing STOC pp.
2305.0 A Maximum Entropy Approach to Adaptive Statistical Language Modeling - Rosenfeld (1996)(Correct)
An adaptive statistical languagemodel is described, which successfullyintegrates long distancelinguistic
information with other knowledge sources. Most existing statistical language models exploit onl... / . View from Information Theory Another view of statistical br modeling is grounded in information theory. Language is considered an
2293.9 An Equivalence Between Sparse Approximation and Support Vector.. - Girosi (1997)(Correct)
This paper shows a relationship between two different approximation techniques: the
Support Vector Machines (SVM), proposed by V. Vapnik (1995), and a sparse approximation
scheme that resembles the Ba... / in the framework of regularization theory rather than statistical learning br rather than statistical learning theory establishing a connection
2293.2 An Efficient Algorithm for the Sparse Resultant - Canny, Emiris (1993)(Correct)
We propose a compact formula for the sparse resultant of an arbitrary system of n+1
Laurent polynomials in n variables. This resultant generalizes the classical one and has significantly
lower degr... / Key words. Sparse elimination theory sparse resultant polynomial br matrix. Classical elimination theory and the classical multivariate
2292.4 Analysis of Inexact Trust-Region Interior-Point SQP Algorithms - Heinkenschloss, Vicente (1995)(Correct)
In this paper we analyze inexact trust--region interior--point (TRIP) sequential quadra--
tic programming (SQP) algorithms for the solution of optimization problems with nonlinear equality
constrain... / presented in this paper rely on the theory given in A br A comprehensive convergence theory is presented in We have
2282.0 Views of Objects and Rules - Topor(Correct)
Object-oriented database systems provide expressive power and the potential for reuse,
extensibility and modifiability. Relational and deductive database systems provide a
simple logical semantics and... / a flurry of research into the theory and implementation of relational br rather than chronological. Theory Most researchers have
2280.3 Dynamic Typing in a Statically Typed Language - Abadi, Cardelli, Pierce, Plotkin (1989)(Correct)
Statically typed programming languages allow earlier error checking, better enforcement
of disciplined programming styles, and generation of more efficient object code
than languages where all type co... / preliminary work on extending our theory to a polymorphic lambda-calculus br Church. A formulation of the simple theory of types. Journal of Symbolic
2272.3 On-Line Algorithms in Machine Learning - Blum (1996)(Correct)
The areas of On-Line Algorithms and Machine Learning are
both concerned with problems of making decisions about the present
based only on knowledge of the past. Although these areas differ in terms
... / results in Computational Learning Theory that fit nicely into the on-line br from Computational Learning Theory that seem particularly
2257.9 Image representations using multiscale differential operators - Yu-Ping (1998)(Correct)
Differential operators have been widely used for multiscale geometric descriptions of images.
The efficient computation of these differential operators is always desirable. Moreover, it has
not been c... / of the classical scale-space theory wavelets provide a more formal br In the classical scale-space theory two frequently used operators
2248.6 On a Primal-Dual Analytic Center Cutting Plane Method for Variational .. - Denault, Goffin (1998)(Correct)
We present an algorithm for variational inequalities V I(F ; Y ) that uses a primal-dual
version of the Analytic Center Cutting Plane Method. The point-to-set mapping F is assumed to
be monotone, or... / at most four Newton iterations in theory and in practice one or sometimes br but this may lead at least in theory to poor centering of x
2245.6 Scale-space Properties of the Multiscale Morphological.. - Jackway, Deriche (1996)(Correct)
A multiscale morphological dilation-erosion smoothing operation and its associated scalespace
expansion for multidimensional signals are proposed. Properties of this smoothing operation
are developed ... / A defining feature of scale-space theory in contrast to other multiscale br to emphasize certain aspects of the theory and de-emphasize others. The
2242.4 Polymorphic Types in Higher-Order Logic Programming - Chen, Kifer (1993)(Correct)
This paper analyses the requirements to the notion of type correctness in logic programming
and proposes several "adequacy" criteria for such a system. We then present a type theory
for a higher-order... / a system. We then present a type theory for a higher-order logic br to be considered well-typed. The theory of types in logic programming has
2231.8 Reconstructing Algebraic Functions from Mixed Data - Ar, Lipton, Rubinfeld, Sudan (1997)(Correct)
We consider a variant of the traditional task of explicitly reconstructing algebraic
functions from black box representations. In the traditional setting for such problems,
one is given access to an u... / ffl computational learning theory ffl curve fitting over br further. Computational Learning Theory Our mechanism can be used to
2227.2 The Calculus of Constructions and Higher Order Logic - Geuvers (1992)(Correct)
The Calculus of Constructions (CC) ([Coquand 1985]) is a typed lambda
calculus for higher order intuitionistic logic: proofs of the higher order
logic are interpreted as lambda terms and formulas as t... / or Martin-Lof's intuitionistic theory of types Martin-Lof br is about in terms of the simple theory of types There are countably many
2225.3 Simple Type-Theoretic Foundations For Object-Oriented Programming - Pierce, Turner (1993)(Correct)
We develop a formal, type-theoretic account of the basic mechanisms of object-oriented
programming: encapsulation, message passing, subtyping, and inheritance. By modeling
object encapsulation in term... / accounts using a simpler type theory. The key step in our approach is br in the underlying type theory it allows us to give a complete
2219.0 Two views of belief: Belief as generalized probability and belief as.. - Halpern, Fagin (1992)(Correct)
Belief functions are mathematical objects defined to satisfy three axioms
that look somewhat similar to the Kolmogorov axioms defining probability functions.
We argue that there are (at least) two u... / seminal work A Mathematical Theory of Evidence Sha a Since then br have an attractive mathematical theory and many intuitively appealing
2215.0 From a File-Oriented View to an Object-Oriented View - Frederiks, van der Weide (1996)(Correct)
The last three decades the architecture of information systems has evolved from fileoriented,
via data-oriented and communication-oriented towards an object-oriented view.
Hand in hand with this archi... / of a conceptual schema the Chomsky theory Cho is used. The basic br as a result of using the Chomsky theory this approach has a semantic
2211.6 Efficient Exploration In Reinforcement Learning - Sebastian B. Thrun (1992)(Correct)
Exploration plays a fundamental role in any active learning system. This study evaluates the role of exploration
in active learning and describes several local techniques for exploration in finite, di... / standard technique from probability theory evaluating the expected
2200.7 On the Semantics of Arbitration - Revesz (1995)(Correct)
Revision and update operators add new information to some old information represented by
a logical theory. Katsuno and Mendelzon show that both revision and update operators can be characterized
as ... / represented by a logical theory. Katsuno and Mendelzon show that br we also call the knowledge base a theory. Each formula is meaningfully kept
2196.6 The Effect of Context on Training: Is Learning Situated? - Reder, Klatzky (1994)(Correct)
This paper addresses issues associated with transfer of training; in particular, the importance of
mimicking the contexts of application during training: When will a skill transfer from one situation
... / by proponents of Situated Learning Theory suggest that training must be done br issue which has been called the Theory of Situated Learning. Implicit
2192.0 Lazy Incremental Learning of Control Knowledge for Efficiently.. - Borrajo, Veloso (1996)(Correct)
General-purpose generative planners use domain-independent search heuristics to
generate solutions for problems in a variety of domains. However, in some situations
these heuristics force the planner ... / from a necessarily complete domain theory and a few examples to focus their br and a correct underlying domain theory. They also require a complete
2190.0 Flexible Seasonal Long Memory and Economic Time Series - Marius Ooms (1995)(Correct)
We discuss specification, frequency domain estimation and application of a flexible seasonal
long memory time series model based on fractional differencing. This type of model
lends itself to seasonal... / testing using standard distribution theory with null hypotheses of br where asymptotic distribution theory can easily be derived from the
2178.3 On the Complexity of Sparse Elimination - Emiris (1996)(Correct)
Sparse elimination exploits the structure of a set of multivariate polynomials by measuring complexity
in terms of Newton polytopes. We examine polynomial systems that generate 0-dimensional
ideals: a... / the context of sparse elimination theory is a function of the Mixed Volume br Introduction Sparse elimination theory generalizes several results of
2175.8 Modeling and Analysis of Timed Petri Nets Using Heaps of Pieces - Gaubert, Mairesse (1999)(Correct)
We show that safe timed Petri nets can be represented
by special automata over the (max,+) semiring,
which compute the height of heaps of pieces. This extends to
the timed case the classical represent... / for an account of the theory of the max semiring. The br of the max semiring. The theory of au