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.
881.8 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
843.4 Experiments with a New Boosting Algorithm - Freund, Schapire (1996)(Correct)
In an earlier paper, we introduced a new "boosting"
algorithm called AdaBoost which, theoretically, can be used to
significantly reduce the error of any learning algorithm that consistently
generate... / of any learning algorithm. In theory boostingcan be used to br tends to be much better than the theory would suggest indicating a clear
684.0 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
668.0 Pizza into Java: Translating theory into practice - Odersky (1997)(Correct)
Pizza is a strict superset of Java that incorporates three ideas from the academic community: parametric polymorphism, higher-order functions, and algebraic data types. Pizza is defined by translation... / Pizza into Java Translating theory into practice Martin Odersky br ffl Standard notions from type theory help us model much of the
485.1 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
472.3 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
400.0 Random Graphs - Janson (2000)(Correct)
he integers 1; : : : ; n, and then randomly selecting (by drawing without replacement) m of the \Gamma n 2 \Delta possible edges. A closely related model, denoted by for example G n;p , where 0 p 1, i... / and more interested in probability theory. Some years ago I worked on random br using for example integration theory functional analysis martingales
353.0 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
345.6 The Temporal Logic of Actions - Lamport (1994)(Correct)
This report introduces TLA and describes how it is used to specify and verify concurrent algorithms. The use of TLA to specify and reason about open systems will be described elsewhere. Categories and... / techniques General terms Theory Verification Additional Key br Notes Note . We find set theory to be the most natural basis for a
336.2 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
302.1 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
288.2 Classical Negation in Logic Programs and Disjunctive Databases - Gelfond, Lifschitz (1991)(Correct)
An important limitation of traditional logic programming as a knowledge representation tool, in
comparison with classical logic, is that logic programming does not allow us to deal directly with
incom... / information. A consistent classical theory partitions the set of sentences br its justifications. A default theory is a set of defaults. The
286.9 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
276.5 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
272.7 Parametric Shape Analysis via 3-Valued Logic - Sagiv, Reps, Wilhelm (1999)(Correct)
We present a family of abstract-interpretation algorithms that are capable of determining "shape invariants" of programs that perform destructive updating on dynamically allocated storage. The main id... / Terms Algorithms Languages Theory Verification Additional Key br editors Program Flow Analysis Theory and Applications chapter
264.1 Scheduling Multithreaded Computations by Work Stealing - Blumofe, Leiserson (1994)(Correct)
This paper studies the problem of efficiently scheduling fully strict (i.e., well-structured) multithreaded computations on parallel computers. A popular and practical method of scheduling this kind o... / Fifth Annual ACM Symposium on Theory of Computing pages - San
263.6 Practical Threshold Signatures - Shoup (1999)(Correct)
We present an RSA threshold signature scheme. The scheme enjoys
the following properties:
1. it is unforgeable and robust in the random oracle model, assuming
the RSA problem is hard;
2. signature sha... / In th Annual ACM Symposium on Theory of Computing pages - br logarithms. IEEE Trans. Inform. Theory - . P.
252.1 Typing and Subtyping for Mobile Processes - Pierce, Sangiorgi (1996)(Correct)
The pi-calculus is a process algebra that supports process mobility by focusing on the communication of channels. Milner's presentation of the pi-calculus includes a type system assigning arities to c... / of single names The basic theory of the polyadic calculus br VII . Robin Milner. A theory of type polymorphism in
238.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
228.8 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
227.2 Connection Scheduling in Web Servers - Crovella, Frangioso, Harchol-Balter (1999)(Correct)
Under high loads, a Web server may be servicing many hundreds of connections concurrently.
In traditional Web servers, the question of the order in which concurrent connections are serviced
has been l... / Cambridge MA harchol theory.lcs.mit.edu Technical Report br time Traditional scheduling theory for simple single-device systems
227.1 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
225.5 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. - .
222.2 Actions with Indirect Effects - Kartha, Lifschitz (1994)(Correct)
We define and study a high-level language for
describing actions that extends the language
A introduced by Gelfond and Lifschitz. The
new language, AR 0 , allows us to describe actions
with indirect ... / one of the central problems in the theory of knowledge representation. The br as follows. A circumscriptive theory is usually defined by a list of
221.2 Proving Java Type Soundness - Syme (1997)(Correct)
Syntax of JavaS primitive-type = bool --- char --- short --- int --- long --- float --- double simple-reference-type = class-name --- interface-name component-type = simple-reference-type --- primitiv... / be used to reveal the underlying theory this can be seen by the fact that br can be seen by the fact that the theory was not worked out in significant
204.1 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
191.3 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
185.5 Reasoning about Termination of Pure Prolog Programs - Apt, al. (1993)(Correct)
We provide a theoretical basis for studying termination of (general) logic programs with
the Prolog selection rule. To this end we study the class of left terminating programs. These
are logic program... / using only the logic programming theory. Clearly the main problem is the br A. Blair and A. Walker. Towards a theory of declarative knowledge. In J.
182.9 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 .
181.4 A congruence theorem for structured operational semantics with.. - Baeten, Verhoef (1993)(Correct)
We proposed a syntactical format, the path format, for structured
operational semantics in which predicates may occur. We proved that strong bisimulation
is a congruence for all the operators that c... / of the first five laws of the theory PA of Bergstra and Klop br which is a fragment of the theory ACP that originates from
180.2 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
179.7 An Improvement of McMillan's Unfolding Algorithm - Esparza, Römer, Vogler (1996)(Correct)
McMillan has recently proposed a new technique to avoid
the state explosion problem in the verification of systems modelled with
finite-state Petri nets. The technique requires to construct a finite i... / Concurrent Hardware The Theory and Practice of Self-Timed Design br Manipulation. Proc. Application and Theory of Petri Nets ' LNCS pp.
178.7 Learning Topological Maps with Weak Local Odometric Information - Shatkay, Kaelbling (1997)(Correct)
Topological maps provide a useful abstraction
for robotic navigation and planning. Although
stochastic maps can theoretically be learned using
the Baum-Welch algorithm, without strong
prior constraint... / learning algorithms based on the theory of learning deterministic finite br IEEE Transactions on Information Theory March . Juang
178.7 Small Forwarding Tables for Fast Routing Lookups - Degermark, Brodnik, Carlsson, Pink (1997)(Correct)
For some time, the networking community has assumed
that it is impossible to do IP routing lookups in software
fast enough to support gigabit speeds. IP routing
lookups must find the routing entry wit... / modern results in algorithm theory routing lookup performance can be br applying recent work in algorithm theory and by careful tuning
173.1 A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks - Duato (1993)(Correct)
Second generation multicomputers use wormhole routing, allowing
a very low channel set-up time and drastically reducing the dependency
between network latency and internode distance. Deadlock-free
rou... / A New Theory of Deadlock-Free Adaptive Routing br the routing algorithms with the new theory. Index terms Adaptive
169.0 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
159.9 Improving The Run Time And Quality Of Nested Dissection Ordering - Hendrickson, Rothberg (1998)(Correct)
F3.833e+05> When performing sparse matrix factorization, the ordering of matrix rows and
columns has a dramatic impact on the factorization time. This paper describes an approach to the
reordering p... / representation that makes graph theory a powerful tool for developing br and J. Orlin Network Flows Theory Algorithms and Applications
157.4 Formal Models Of Web Queries - Mendelzon (1997)(Correct)
We present a new formal model of query and computation on the Web. We focus on
two important aspects that distinguish the access to Web data from the access to a standard database
system: the navigati... / and Harel have played in the theory of relational databases. Of br output of EC Web queries. Database theory often deals with the membership
156.7 On the Convergence of Stochastic Iterative Dynamic Programming.. - Jaakkola, Jordan, Singh (1993)(Correct)
Recent developments in the area of reinforcement learning have
yielded a number of new algorithms for the prediction and control of
Markovian environments. These algorithms, including the TD() algorit... / of stochastic approximation theory via a new convergence theorem. br learning algorithms based on the theory of dynamic programming DP
153.1 Modularity for Timed and Hybrid Systems - Alur, Henzinger (1997)(Correct)
In a trace-based world, the modular specification, verification, and control of live systems require each module to be receptive; that is, each module must be able to meet its liveness assumptions no ... / Conference on Concurrency Theory CONCUR Lecture Notes in br . R. Alur D.L. Dill. A theory of timed automata. Theoretical
153.1 A Foundation for Multi-Dimensional Databases - Gyssens, Lakshmanan (1997)(Correct)
We present a multi-dimensional database model,
which we believe can serve as a conceptual model
for On-Line Analytical Processing (OLAP)-based
applications. Apart from providing the functionalities
ne... / possible whence the rich body of theory and techniques well developed for br Gurevich Y.Metafinite model theory in Proceedings Logic and
151.7 Reinforcement Learning with Perceptual Aliasing: The Perceptual.. - Chrisman (1992)(Correct)
It is known that Perceptual Aliasing may significantly
diminish the effectiveness of reinforcement
learning algorithms [ Whitehead and Ballard,
1991 ] . Perceptual aliasing occurs when multiple
situat... / Model A predictive model is a theory that can be used to make br markov decision processes Theory models and algorithms.
150.7 Intelligent Agents: An Emerging Technology for Next Generation.. - Magedanz, Rothermel, Krause (1996)(Correct)
The telecommunications environment is changing its face towards an open market of information services where the vision is "information any time, at any place, in any form". Within this electronic mar... / derived from the speech act theory. This cooperation may necessitate br of contract nets and speech act theory. The contract net protocol is a
145.6 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
140.4 How to Sign Digital Streams - Gennaro, Rohatgi (1997)(Correct)
We present a new efficient paradigm for signing digital streams. The problem of signing digital streams to prove their authenticity is substantially different from the problem of signing regular messa... / IEEE Transactions on Information Theory IT- - . T. br IEEE Transactions on Information Theory IT- - . S.
138.2 Records for Logic Programming - Smolka, Treinen (1994)(Correct)
CFT is a new constraint system providing records as logical data
structure for constraint (logic) programming. It can be seen as a generalization
of the rational tree system employed in Prolog II, whe... / The Feature Tree Structure The Theory CFT Relationship to br Section defines a first-order theory by means of five axiom schemes
137.1 A statically safe alternative to virtual types - Bruce, Odersky, Wadler (1998)(Correct)
Parametric types and virtual types have recently been proposed as extensions to Java to support genericity. In this paper we investigate the strengths and weaknesses of each. We suggest a variant of... / with key contributions to their theory coming from Strachey Str and br Pierce. On binary methods. Theory and Practice of Object-Oriented
136.3 Asymptotic Controllability Implies Feedback Stabilization - Clarke, Ledyaev, Sontag, Subbotin (1999)(Correct)
It is shown that every asymptotically controllable system
can be globally stabilized by means of some (discontinuous)
feedback law. The stabilizing strategy is based on pointwise
optimization of a smo... / open question in nonlinear control theory concerns the relationship between br techniques from topological degree theory were used an exposition is given
133.3 Adversarial Queueing Theory - Kleinberg (1996)(Correct)
proposed a model of continuous packet injection in which probabilistic assumptions were replaced by worst--case inputs. Our goal was to determine whether it was feasible to prove stability results eve... / Adversarial Queueing Theory Jon M. Kleinberg br study within the field of queueing theory Typical assumptions here
130.4 Incremental Multi-Step Q-Learning - Peng, Williams (1996)(Correct)
This paper presents a novel incremental algorithm that combines Q-learning, a
well-known dynamic programming-based reinforcement learning method, with the TD() return
estimation process, which is ty... / algorithm developed from the theory of dynamic programming Ross
128.3 A Multiple-Conclusion Meta-Logic - Miller (1994)(Correct)
The theory of cut-free sequent proofs has been used to motivate and justify the design of a number of logic programming languages. Two such languages, Prolog and its linear logic refinement, Lolli [12... / Abstract The theory of cut-free sequent proofs has br term structures of Church's Simple Theory of Types A signature is a
127.6 Hybrid Probabilistic Programs - Dekhtyar, Subrahmanian (1997)(Correct)
The precise probability of a compound event (e.g. e1 e2 ; e1 e2) depends upon the known
relationships (e.g. independence, mutual exclusion, ignorance of any relationship, etc.) between
the primitive... / programs and develop a model theory fixpoint theory and proof br develop a model theory fixpoint theory and proof theory for such
124.6 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
123.4 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
123.4 Bucket Hashing and its Application to Fast Message Authentication - Rogaway (1997)(Correct)
We introduce a new technique for constructing a family of universal hash functions.
At its center is a simple metaphor: to hash a string x, cast each of its words into a small
number of buckets; xor... / Previous work. The general theory of unconditional authentication br improvements rooted in coding theory came from Bierbrauer Johansson
119.9 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
119.9 Support Vector Machine Reference Manual - Saunders, Stitson, Weston, Bottou.. (1998)(Correct)
this document will describe these programs. To find out more about SVMs, see the bibliography. We will not describe how SVMs work here. The first program we will describe is the paragen program, as it... / The Nature of Statistical Learning Theory Springer . Getting br not counted as support vectors. In theory support vectors are all vectors
119.9 Support Vector Machine - Reference Manual - Saunders, Stitson, Weston, Bottou.. (1998)(Correct)
this document will describe these programs. To find out more about SVMs, see the bibliography. We will not describe how SVMs work here. The first program we will describe is the paragen program, as it... / The Nature of Statistical Learning Theory Springer . Getting br not counted as support vectors. In theory support vectors are all vectors
119.1 Knowledge Compilation Using Horn Approximations - Selman, Kautz (1991)(Correct)
We present a new approach to developing fast and efficient knowledge representation
systems. Previous approaches to the problem of tractable inference
have used restricted languages or incomplete infe... / does not simply mimic the proof theory Moreover no information is br example. We show how a logical theory can be compiled into a tractable
118.8 Symmetric primal-dual path following algorithms for semidefinite.. - Sturm, Zhang (1995)(Correct)
In this paper a symmetric primal-dual transformation for positive semidefinite programming is proposed. For standard SDP problems, after this symmetric transformation the primal variables and the dual... / among others system and control theory and combinatorial optimization br It is well known from Lyapunov theory that the Sylvester
116.0 Building Interpreters by Composing Monads - Steele, Jr. (1994)(Correct)
We exhibit a set of functions coded in
Haskell that can be used as building blocks to construct
a variety of interpreters for Lisp-like languages. The
building blocks are joined merely through funct... / pseudomonads composition. The theory of pseudomonads is described in a br there is in fact a more general theory of pseudmonads in which the first
115.9 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
114.8 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
113.7 Competitive Algorithms for Distributed Data Management - Bartal, Fiat, Rabani (1992)(Correct)
We deal with the competitive analysis of algorithms for managing data in a distributed environment. We deal
with the file allocation problem ([DF], [ML]), where copies of a file may be be stored in th... / of the th Ann. ACM Symp. on Theory of Computing May . ABF br Proc. of the nd Ann. ACM Symp. on Theory of Computing pages -
113.0 Short Wavelets and Matrix Dilation Equations - Strang, Strela (1995)(Correct)
Scaling functions and orthogonal wavelets are created from the coefficients of a lowpass and highpass filter (in a two-band orthogonal filter bank). For "multifilters" those coefficients are matrices.... / filter bank. Thus wavelet theory can be described as the iterated br the iterated limit of filter bank theory. Now we introduce a
111.1 Minorization Conditions and Convergence Rates for Markov Chain Monte.. - Rosenthal (1994)(Correct)
this paper, we provide a method (Theorem 5) for proving rigorous, a priori bounds on the number of iterations required until satisfactory convergence has taken place. We feel that such bounds provide ... / quantitative bounds using the theory of compact operators. Similar br semi-Markov processes and renewal theory for Markov chains. Ann. Prob.
109.2 Issues in Evolutionary Robotics - Harvey, Husbands, Cliff (1993)(Correct)
In this paper we propose and justify a methodology for the development of the control systems, or `cognitive architectures', of autonomous mobile robots. We argue that the design by hand of such contr... / decomposition In theory this involves analysing br means that this is not a field theory. It rules out of this model such
104.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
102.1 Distributed Processes and Location Failures - Riely (1997)(Correct)
Site failure is an essential aspect of distributed systems; nonetheless its effect on
programming language semantics remains poorly understood. To model such systems, we define
a process calculus in... / to develop a useful extensional theory of systems which would take this br has concentrated on a semantic theory for located processes. In
101.4 Disjoint Paths in Densely Embedded Graphs - Kleinberg, Tardos (1995)(Correct)
We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to communicate over paths through the network --- the goal is to simultaneou... / of Karp's E-mail kleinber theory.lcs.mit.edu. Laboratory for br basic interest in algorithmic graph theory. A lot of work has been done on
100.5 Well-Founded Semantics Coincides with Three-Valued Stable Semantics - Przymusinski (1990)(Correct)
We introduce 3-valued stable models which are a natural generalization of standard (2-valued) stable models. We show that every logic program P has at least one 3-valued stable model and that the well... / autoepistemic resp. default theory P so that the -valued stable br an autoepistemic resp. default theory P so that the -valued
99.9 Inter-Class Resource Sharing using Statistical Service Envelopes - Jing-Yu Qiu (1999)(Correct)
Networks that support multiple services through "linksharing
" must address the fundamental conflicting requirement between
isolation among service classes to satisfy each class' quality of service r... / Service Envelopes Theory And Applications In This br tests for SP schedulers using this theory. A. Single Class Queueing Model
99.9 As Soon as Possible: Time Optimal Control for Timed Automata - Asarin, Maler (1999)(Correct)
In this work we tackle the following problem: given a timed
automaton, and a target set F of configurations, restrict its transition relation
in a systematic way so that from every state, the remain... / of plant models used in the theory of supervisory control for br AD Alur R.Dill D.L.A Theory of Timed Automata. Theoretical
98.5 Distributed Packet Switching in Arbitrary Networks - Rabani, Tardos (1996)(Correct)
In a seminal paper Leighton, Maggs, and Rao consider
the packet scheduling problem when a single packet has
to traverse each path. They show that there exists a
schedule where each packet reaches its ... / the Twenty-Eighth ACM Symposium on Theory of Computing Philadelphia PA br of the rd Ann. ACM Symp. on Theory of Computing San Diego May
97.1 On a Multi-Objective Evolutionary Algorithm and Its Convergence to.. - Günter Rudolph (1998)(Correct)
Although there are many versions of evolutionary algorithms
that are tailored to multi--criteria optimization, theoretical results are apparently
not yet available. Here, it is shown that results know... / shown that results known from the theory of evolutionary algorithms in case br In classical optimization theory it is tacitly assumed that there
96.9 A Spatial Model of Interaction in Large Virtual Environments - Benford, Fahlén (1993)(Correct)
Introduction
Our paper presents a model for supporting group interaction in large-scale virtual worlds 1
. The
model provides generic techniques for managing interactions between various objects in su... / and information spaces. The theory described in this paper is being br Supported Cooperative Work Theory Practice and Design J. Bowers
94.8 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.
92.7 Concurrency and Communication in Transaction Logic - Bonner, Kifer (1996)(Correct)
In previous work, we developed Transaction Logic (or T R), which deals with state changes in deductive databases. T R provides a logical framework in which elementary database updates and queries can ... / including a natural model theory and a proof theory. Moreover br a natural model theory and a proof theory. Moreover this framework is
92.7 The WALRAS Algorithm: A Convergent Distributed Implementation of.. - Cheng, Wellman (1996)(Correct)
The walras algorithm calculates competitive equilibria via a distributed tatonnementlike process, in which agents submit single-good demand functions to market-clearing auctions. The algorithm is as... / consult a good microeconomic theory textbook Malinvaud Varian br concepts of general equilibrium theory. The system supports the two
92.7 On Convergence Properties of the EM Algorithm for Gaussian Mixtures - Xu, Jordan (1996)(Correct)
We build up the mathematical connection between the "Expectation-Maximization" (EM) algorithm and gradient-based approaches for maximum likelihood learning of finite Gaussian mixtures. We show that th... / link EM to other topics in learning theory Amari Jordan Xu br to the application of the theory of probabilistic functions of
92.7 COLLAGEN: When Agents Collaborate with People - Rich, Sidner (1996)(Correct)
We take the position that autonomous agents, when they interact with people, should be governed by the same principles that underlie human collaboration. These principles come from research in computa... / collaborative discourse theory which describes how people br with a wellspecified computational theory that has been empirically
92.7 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
92.7 An Experimental Comparison of the Nearest-Neighbor and.. - Wettschereck, Dietterich (1995)(Correct)
Algorithms based on Nested Generalized Exemplar (NGE) theory (Salzberg, 1991) classify new data points by computing their distance to the nearest "generalized exemplar" (i.e., either a point or an a... / Nested Generalized Exemplar NGE theory Salzberg classify new br fuzzy logic and adaptive resonance theory ART neural networks. The
92.7 An Efficient Probabilistic Context-Free Parsing Algorithm that.. - Stolcke (1995)(Correct)
this article can compute solutions to all four of these problems in a single framework,withanumber of additional advantagesoverpreviously presented isolated solutions. Most probabilistic parsers are b... / CFGs with probability theory providing a sound theoretical br the basics of context-free grammar theory such as given in Aho and Ullman
91.4 Fitness and the selective adaptation of language - Kirby (1998)(Correct)
this paper is how can we go about explaining the observed constraints on variation across languages --- in other words, language universals. unknown Fitness and the selective adaptation of language
S... / paper I will be using the general theory of processing complexity put br primarily concerned with using his theory to explain language universals
89.8 Software Transactional Memory - Shavit (1995)(Correct)
As we learn from the literature, flexibility in choosing synchronization
operations greatly simplifies the task of designing
highly concurrent programs. Unfortunately, existing
hardware is inflexible ... / Contact Author E-mail shanir theory.lcs.mit.edu by constructing br transactions of could in theory repeatedly fail forever if
89.6 Deception Considered Harmful - Grefenstette (1992)(Correct)
A central problem in the theory of genetic algorithms is the characterization
of problems that are difficult for GAs to optimize. Many attempts to
characterize such problems focus on the notion of Dec... / A central problem in the theory of genetic algorithms is the br as the basis for an operational theory for GAs. This paper will focus on
87.9 Extendible Approach For Analysing Fixed Priority Hard Real-Time Tasks - Tindell (1992)(Correct)
As the real-time computing industry moves away from static cyclic executive-based scheduling
towards more flexible process-based scheduling, so it is important for current scheduling
analysis techniqu... / will summarise the scheduling theory developed. Section will present br times can give powerful scheduling theory tailored to the behaviour of real
86.9 A Computational Market Model for Distributed Configuration Design - Wellman (1995)(Correct)
This paper presents a precise market model for a well-defined class of distributed
configuration design problems. Given a design problem, the model defines a
computational economy to allocate basic re... / of concepts from microeconomic theory. We can then implement these br that of general equilibrium theory Hildenbrand and Kirman
85.7 Design Principles for Intelligent Environments - Coen (1998)(Correct)
This paper describes design criteria for creating highly
embedded, interactive spaces that we call Intelligent
Environments. The motivation for building these systems is
to bring computation into the ... / personal assistants. At least in theory it should be possible for a br a single camera can provide in theory and increasingly often in
85.1 The Saphira Architecture: A Design for Autonomy - Konolige, Myers, Ruspini, Saffiotti (1997)(Correct)
Journal of Experimental and Theoretical Artificial Intelligence (JETAI) 9, 1997, 215-235.
Special issue on Architectures for Physical Agents.
Mobile robots, if they areto perform useful tasks andbecom... / Rosenschein's Situated Automata theory which eschews br declarative in this manner. In theory a PRS-Lite style controller is
85.1 Inductive Analysis of the Internet Protocol TLS - Paulson (1997)(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 speci c permission and/... / and Subject Descriptors F. . Theory of Computation Logics and br of session keys. In an Isabelle theory le functions are declared as
84.5 Logics and Type Systems - Geuvers (1993)(Correct)
from the last declaration in \Delta (which is p:').
(oe-E) In fact the ([\Theta]) is not exactly the ([\Theta]) that is found by induction. Possibly
some of the free variables in ([\Theta]) are renam... / . Meta theory of Pure Type Systems br . Some more meta-theory for CC
84.0 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
83.0 On Understanding Types, Data Abstraction, and Polymorphism - Cardelli, Wegner (1985)(Correct)
Our objective is to understand the notion of type in programming languages, present a model of typed, polymorphic programming languages that reflects recent research in type theory, and examine the re... / reflects recent research in type theory and examine the relevance of br the l-calculus Sets in set theory The most concrete of these is the
81.8 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
81.1 A Formal Framework for Agency and Autonomy - Luck, d'Inverno (1995)(Correct)
With the recent rapid growth of interest in MultiAgent Systems, both in artificial intelligence and software engineering, has come an associated difficulty concerning basic terms and concepts. In part... / the foundations for a principled theory of agency and autonomy and br the development of a computational theory of mind Sloman Croucher
80.8 Identifying Modules Via Concept Analysis - Siff (1997)(Correct)
We describe a general technique for identifying modules in programs that do not designate
them explicitly. The method is based on concept analysis --- a branch of lattice theory that
can be used to id... / analysis a branch of lattice theory that can be used to identify br Rudolf Wille. Restructuring lattice theory An approach based on hierarchies
80.4 Tight Performance Bounds on Greedy Policies Based on Imperfect Value.. - Williams (1993)(Correct)
Consider a given value function on states of a Markov decision problem, as might result from applying a reinforcement learning algorithm. Unless this value function equals the corresponding optimal va... / in standard dynamic programming theory and therefore in need of more br of standard dynamic programming theory may be found in Bertsekas
79.9 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
79.9 Improving the Mean Field Approximation via the Use of Mixture.. - Jaakkola, Jordan (1998)(Correct)
Mean field methods provide computationally efficient approximations
to posterior probability distributions for graphical models. Simple
mean field methods make a completely factorized approximation ... / Jordan Mean field theory Parisi provides an br of the other nodes. Mean field theory consists of finding consistency
79.9 Time-Stamping with Binary Linking Schemes - Buldas, Laud, Lipmaa, Villemson (1998)(Correct)
We state the basic requirements for time-stamping systems applicable as the necessary support to the legal use of electronic documents. We analyze the main drawbacks of the time-stamping systems propo... / if not impossible. Even by the theory of relativity no absolute time
79.4 On Non-Preemptive Scheduling of Periodic and Sporadic Tasks - Jeffay, Stanat, Martel (1991)(Correct)
This paper examines a fundamental problem in
the theory of real-time scheduling, that of scheduling a set
of periodic or sporadic tasks on a uniprocessor without
preemption and without inserted idle... / a fundamental problem in the theory of real-time scheduling that of br and Intractability A Guide to the Theory of NP-Completeness W.H. Freeman
77.5 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
76.5 Quantitative Analysis and Model Checking - Huth (1997)(Correct)
Many notions of models in computer science provide quantitative information, or uncertainties, which necessitate a quantitative model checking paradigm. We present such a framework for reactive and ge... / taking inner measures in measure theory. Note that max OE q br the usual modular law of measure theory q OE q
76.5 User Modeling and Adaptive Navigation Support in WWW-Based Tutoring.. - Weber, Specht (1997)(Correct)
Most learning systems and electronic textbooks accessible via the WWW up to
now lack the capabilities of individualized help and adapted learning support that are the
emergent features of on-site in... / tracing tutors based on the ACT theory Anderson and the br Goldstein I. Overlays A theory of modelling for computer aided
76.5 Comprehension Syntax - Buneman, Libkin, Suciu, Tannen, Wong (1994)(Correct)
The syntax of comprehensions is very close to the syntax of a number of practical database query languages and is, we believe, a better starting point than first-order logic for the development of d... / engaged in writing a book on the theory and practice of programming br comprehension comes from set theory and is used in certain programming
75.3 Barrier Functions in Interior Point Methods - Guler (1996)(Correct)
We show that the universal barrier function of a convex cone introduced by Nesterov and Nemirovskii is the logarithm of the characteristic function of the cone. This interpretation demonstrates the in... / successfully developed a general theory of interior point methods for br inequalities. The details of this theory can be found in the recent book by
75.3 A Parallel Workload Model and Its Implications for Processor.. - Allen Downey (1996)(Correct)
We develop a workload model based on the observed behavior of parallel
computers at the San Diego Supercomputer Center and the Cornell
Theory Center. This model gives us insight into the performance o... / Center and the Cornell Theory Center. This model gives us br And The Ibm Sp At The Cornell Theory Center ctc Figure Shows The
75.3 Interconnected Automata and Linear Systems: A Theoretical Framework.. - Sontag (1996)(Correct)
This paper summarizes the definitions and several of the main results of an approach to hybrid systems, which combines finite automata and linear systems, developed by the author in the early 1980s.... / Hybrid Systems Linear control theory is well-developed and highly br than those handled by the linear theory will require switching mechanisms
75.3 Quantum Dynamics and Decompositions of Singular Continuous Spectra - Last (1995)(Correct)
We study relations between quantum dynamics and spectral properties,
concentrating on spectral decompositions which arise from decomposing measures with
respect to dimensional Hausdorff measures.
... / paper is twofold First we use a theory due to Rogers and Taylor br Moreover the decomposition theory allows us to extend some of these
75.3 A Generalization of Analytic Deduction via Labelled Deductive Systems .. - D'Agostino, Gabbay (1995)(Correct)
In this series of papers we set out to generalize the notion of classical analytic deduction (i.e. deduction via elimination rules) by combining the methodology of Labelled Deductive Systems [Gab94] w... / pragmatic notions into the proof-theory. The labelling algebra represents br shown elsewhere DM that the theory of classical analytic deduction
75.0 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
74.2 Analysis of Low Density Codes and Improved Designs Using Irregular.. - Michael Luby (1998)(Correct)
In [6], Gallager introduces a family of codes based on sparse bipartite graphs, which
he calls low-density parity-check codes. He suggests a natural decoding algorithm for
these codes, and proves a go... / a significant breakthrough in the theory of codes based on low-density br to tie together more strongly the theory and practice of these codes. Our
74.2 Proof-Checking a Data Link Protocol - Helmink, Sellink, Vaandrager (1993)(Correct)
A data link protocol developed and used by Philips Electronics
is modeled and verified using I/O automata theory. Correctness
is computer-checked with the Coq proof development system.
Key words: Co... / and verified using I O automata theory. Correctness is computer-checked br Protocol Verification Type Theory. Introduction The data-link
73.0 Wavelets on Closed Subsets of the Real Line - Andersson, Hall, Jawerth, Peters(Correct)
We construct orthogonal and biorthogonal wavelets on a given closed subset of the real line. We also study wavelets satisfying certain types of boundary conditions. We introduce the concept of "wave... / i Psi k x Topics in the Theory and Applications of Wavelets br approximation and spline theory one technique for improving
72.7 A Perceptual Distortion Metric for Digital Color Video - Winkler (1999)(Correct)
In this paper I present a distortion metric for color video sequences. It is based on a contrast gain control model
of the human visual system that incorporates spatial and temporal aspects of vision ... / color perception in particular the theory of opponent colors ffl br is commonly referred to as the theory of opponent colors. Both
72.4 A Linear Logical Framework - Cervesato, Pfenning (1996)(Correct)
We present the linear type theory \Pi\Gammaffi&? as the formal basis for LLF, a conservative extenSubmitted to Information & Computation. Comments are welcome! sion of the logical framework LF . LLF c... / We present the linear type theory Pi Gammaffi as the br normally a logic or a type theory and of a meta-representation
72.1 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
71.8 Class-based n-gram models of natural language - Brown, Pietra, deSouza, Lai, Mercer (1990)(Correct)
We address the problem of predicting a word from previous words in a sample of text.
In particular, we discuss n-gram models based on classes of words. We also discuss several
statistical algorithms f... / and notation from the mathematical theory of communication. The reader who br An Introduction to Probability Theory and its Applications Volume I.
71.6 Parallel Sorting by Overpartitioning - Li, al (1994)(Correct)
A new approach to parallel sorting called Parallel Sorting by OverPartitioning (PSOP) is presented. The approach limits the communication cost by moving each element between processors at most once, a... / a factor of two of optimal in theory and within a few percent of
70.6 Experimental Quantum Cryptography - Bennett, Bessette, Brassard.. (1992)(Correct)
We describe results from an apparatus and protocol designed to implement
quantum key distribution, by which two users, who share no secret information
initially: 1) exchange a random quantum transmis... / cryptography and information theory it is taken for granted that br the sense of Shannon's information theory need not be. It is shown in
69.5 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.
69.5 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
69.5 Towards a Theory of Cooperative Problem Solving - Wooldridge (1996)(Correct)
One objective of distributed artificial intelligence research is to build
systems that are capable of cooperative problem solving. To this end, a number
of implementation-oriented models of cooperat... / Towards a Theory of Cooperative Problem Solving br formalised by representing it as a theory in a quantified multi-modal
69.5 Fast Approximation of Self-Similar Network Traffic - Paxson (1995)(Correct)
Recent network traffic studies argue that network arrival processes
are much more faithfully modeled using statistically
self-similar processes instead of traditional Poisson processes
[LTWW94a, PF94... / queue waiting times ENW The theory of self-similar stochastic br IEEE Transactions on Information Theory pp. - March .
69.5 Numerical Uncertainty Management in User and Student Modeling: An.. - Jameson (1995)(Correct)
A rapidly growing number of user and student modeling systems have employed numerical techniques for
uncertainty management. The three major paradigms are those of Bayesian networks, the Dempster-Sh... / networks the Dempster-Shafer theory of evidence and fuzzy logic. In br Bayesian networks Dempster-Shafer theory fuzzy logic user modeling
68.5 Reinventing the Familiar: Exploring an Augmented Reality Design Space .. - Wendy Mackay (1998)(Correct)
This paper describes our exploration of a design space for an
augmented reality prototype. We began by observing air
traffic controllers and their interactions with paper flight
strips. We then worked... / the stripboard making it Theory Observation Design of Artifacts br and Multimodal Communication Theory and Applications. Eindhoven The
68.0 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
68.0 Predicting Application Run Times Using Historical Information - Smith (1997)(Correct)
We present a technique for deriving predictions for the run
times of parallel applications from the run times of "similar
" applications that have executed in the past. The novel
aspect of our work is... / National Laboratory the Cornell Theory Center and the San Diego br Laboratory ANL the Cornell Theory Center CTC and the San Diego
67.0 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
66.6 On-line Algorithms for Path Selection in a Nonblocking Network - Arora, Leighton, Maggs (1996)(Correct)
Nonblocking networks arise in a variety of communication applications including telephone systems and distributed-memory computer architectures. Although asymptotically optimal constructions are known... / of the nd Annual ACM Symposium on Theory of Computing pages - br hypercube. Mathematical Systems Theory - . M.
66.6 Stability And Robustness For Hybrid Systems - Pettersson, Lennartson (1996)(Correct)
Stability and robustness issues for hybrid systems are considered in this paper. General stability results that are
extensions of classical Lyapunov theory have recently been formulated. However, thes... / extensions of classical Lyapunov theory have recently been formulated. br be performed. However existing theory does not unveil how to find such
63.9 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
63.9 A Simplified Account of Polymorphic References - Harper (1993)(Correct)
A proof of the soundness of Tofte's imperative type discipline with respect to a structured operational semantics is given. The presentation is based on a semantic formalism that combines the benefits... / programming languages type theory references and assignment.
63.8 Representations and Solutions for Game-Theoretic Problems - Koller, Pfeffer (1997)(Correct)
A system with multiple interacting agents (whether artificial or human) is often best analyzed
using game-theoretic tools. Unfortunately, while the formal foundations are well-established,
standard co... / algorithm in practice not just in theory. It therefore allows the solution br available to them. Game theory provides us with the tools to
63.8 Vertical Data Migration in Large Near-Line Document Archives Based on .. - Kraiss, Weikum (1997)(Correct)
Large multimedia document archives hold most of their data in
near-line tertiary storage libraries for cost reasons. This paper de-
velops an integrated approach to the vertical data migration betwee... / model and its underlying theory Nel Tij for predicting br and its underlying mathematical theory. We believe that analytic models
63.8 A Policy Based Role Object Model - Lupu, Sloman (1997)(Correct)
Enterprise roles define the duties and responsibilities of the individuals which are assigned to them. This paper introduces a framework for the management of large distributed systems which makes use... / of the concepts developed in role theory. Our concept of a role groups the br this area based on the Speech Acts theory It is not our intention to
63.8 Coding Dialogs with the DAMSL Annotation Scheme - Core, Allen (1997)(Correct)
This paper describes the DAMSL annotation scheme
for communicative acts in dialog. The scheme has
three layers: Forward Communicative Functions,
Backward Communicative Functions, and Utterance
Feature... / actions of traditional speech act theory. The Backward Communicative br style of their speech. Speech act theory Sea was one of the first
63.7 A Model for Secure Protocols and Their Compositions - Heintze, Tygar (1996)(Correct)
This paper develops a foundation for reasoning about protocol security. We adopt a model-based
approach for defining protocol security properties. This allows us to describe security properties in
gre... / development of an elementary model theory of agent interaction that provides br the treatment of time in the model theory of temporal logic
63.7 Polytypic Pattern Matching - Jeuring (1995)(Correct)
The (exact) pattern matching problem can be informally
specified as follows: given a pattern and a text, find all
occurrences of the pattern in the text. The pattern and
the text may both be lists, or... / community see where the Theory of Lists' is extended br of a regular functor. The category theory needed for this extension has
63.7 On the Hardness of Approximating MAX k-CUT and its Dual - Kann, Khanna, Lagergren, Panconesi (1995)(Correct)
We study the Max k-Cut problem and its dual, the Min k-Partition problem:
given G = (V; E) and w : E ! R
+
, find an edge set of minimum weight whose removal makes
G k-colorable. For the Max k-Cu... / CA USA. Email sanjeev theory.stanford.edu. Supported by an OTL br Recent results in the theory of probabilistic checking of
63.6 Efficient Progressive Sampling - Foster Provost (1999)(Correct)
Having access to massive amounts of data does not necessarily imply that induction
algorithms must use them all. Samples often provide the same accuracy with far less
computational cost. However, the ... / nearly impossible to determine from theory. Figure is a generic algorithm br - . Valiant L. G. A theory of the learnable. Communications
62.8 The Meaning and Role of Value in Scheduling Flexible Real-Time Systems - Burns, Prasad, Ramamritha, al. (1998)(Correct)
The real-time community is devoting considerable attention to flexible scheduling and adaptive systems. One popular means of increasing the flexibility, and hence effectiveness, of real-time systems i... / Appropriate techniques from utility theory are reviewed. An approach based br value function is cardinal then in theory the maximum value for the
62.8 Support Vector Machines for Classification and Regression - Gunn (1998)(Correct)
this
report the term SVM will refer to both classification and regression methods, and the
terms Support Vector Classification (SVC) and Support Vector Regression (SVR)
will be used for specification.... / . Statistical Learning Theory br Group . Statistical Learning Theory This section is a very brief
62.8 The Regular Viewpoint on PA-Processes - Lugiez, Schnoebelen (1998)(Correct)
PA is the process algebra allowing non-determinism, sequential and parallel
compositions, and recursion. We suggest a view of PA-processes as tree languages.
Our main result is that the set of iter... / research today in the concurrency-theory community. Of course there has br the basics of tree-automata theory before we introduce our
62.8 Dynamically Adapting Kernels in Support Vector Machines - Cristianini, Campbell, Shawe-Taylor (1998)(Correct)
The kernel-parameter is one of the few tunable parameters in Support
Vector machines, and controls the complexity of the resulting hypothesis.
The choice of its value amounts to model selection, and i... / generalisation error provided by VC theory. In practice however SV machines br Support Vector Learning by SRM theory can be computed the best
62.0 Generalization and Learnability: A Study of Constrained Atoms - Page, Jr., Frisch (1992)(Correct)
This paper studies the generalization of atomic formulas, or atoms, that are augmented with constraints on or among their terms. The atoms may also be viewed as definite clauses whose antecedents expr... / logical consequences of a taxonomic theory that describes the sorts. br information. The background theory used is called a constraint
62.0 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
61.7 Wait-free Parallel Algorithms for the Union-Find Problem - Anderson, Woll (1994)(Correct)
We are interested in designing efficient data structures for a shared memory multiprocessor. In this paper we focus on the Union-Find data structure. We consider a fully asynchronous model of computat... / objects and work done in the theory of parallel computing on models br of the rd ACM Symposium on Theory of Computation pages -
60.2 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
60.2 A Record Calculus Based on Symmetric Concatenation - Harper, Pierce (1991)(Correct)
Type systems for operations on extensible records form a foundation for statically typed languages addressing some aspects of object oriented programming and database applications. A number of primiti... / and related systems Language theory Programming Type structure br Definition . . . An equational theory hR Ei consists of two sets of
60.2 Data Mining - The Search for Knowledge in Databases - Holsheimer, Siebes (1991)(Correct)
Data mining is the search for relationships and global patterns that exist in large databases, but are `hidden'
among the vast amounts of data, such as a relationship between patient data and their me... / Computational learning theory br Although computational learning theory which studies these problems is
59.2 Motion Estimation via Dynamic Vision - Soatto, Perona, Frezza, Picci (1994)(Correct)
Estimating the three dimensional motion of an object from
a sequence of projections is of paramount importance in a
variety of applications in control and robotics, such as autonomous
navigation, mani... / tools from control and estimation theory have hinted at acceptable br tools from control and estimation theory have been applied
58.8 Preferential Semantics for Goals - Wellman, Doyle (1991)(Correct)
Goals, as typically conceived in AI planning, provide
an insufficient basis for choice of action, and hence are
deficient as the sole expression of an agent's objectives.
Decision-theoretic utilities ... / that grounds them in decision theory and preserves the validity of br The grounding in decision theory enables designers to determine
57.9 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
57.9 Learning First-Order Definitions of Functions - Quinlan (1996)(Correct)
First-order learning involves finding a clause-form definition of a relation from examples of the relation and relevant background information. In this paper, a particular first-order learning system ... / Similarly the propositional theory language employed by br functionality assumption.In theory filp also requires an oracle to
57.9 Direct Least Squares Fitting of Ellipses - Pilu, Fitzgibbon, Fisher (1996)(Correct)
1.5>
ffl Extremely robust to noise (see examples)
H
E
UNIVER
S
I
T
Y
O
F
E
D I N BU
R
G
H
Dept. of Artificial Intelligence
University of Edinburgh
Machine Vision Unit
ICIP96:3:conics... / Machine Vision Unit ICIP theory Existence and Uniqueness of the
57.7 Applying Techniques to Skeletons - Sterling, Kirschenbaum (1993)(Correct)
This paper concerns our research on developing a theory and methodology appropriate
for systematically building complicated Prolog programs. Programs are constructed
procedurally from standard compone... / our research on developing a theory and methodology appropriate for br in this paper. Underlying theory can be found in KSJar Here we
57.1 Jacobian Images of Super-Resolved Texture Maps for Model-Based Motion .. - Dellaert, Thrun, Thorpe (1998)(Correct)
We present a Kalman filter based approach to perform
model-based motion estimation and tracking. Unlike previous
approaches, the tracking process is not formulated as
an SSD minimization problem, but ... / framework of Bayesian estimation theory. We will be interested in br provided by optimal estimation theory foremost the Kalman filter can
56.7 A Plan-Based Model for Response Generation in Collaborative.. - Chu-Carroll (1994)(Correct)
This paper presents a plan-based architecture for response
generation in collaborative consultation dialogues, with emphasis
on cases in which the system (consultant) and user
(executing agent) disagr... / Propose-Evaluate-Modifycycle. This theory views the collaborative planning br the modification We capture this theory in a plan-based system for
55.0 Measured Capacity of an Ethernet: Myths and Reality - Boggs, Mogul, Kent (1988)(Correct)
Ethernet, a 10 Mbit/sec CSMA/CD network, is one of the most successful
LAN technologies. Considerable confusion exists as to the actual capacity of
an Ethernet, especially since some theoretical studi... / in practice but allegedly not in theory some people have sufficiently br . . Lessons learned from theory For the user who has already
54.3 Sequential Behavior and Learning in Evolved Dynamical Neural Networks - Yamauchi, Beer (1994)(Correct)
This paper explores the use of a real-valued modular genetic algorithm to evolve continuous-time recurrent neural networks capable of sequential behavior and learning. We evolve networks that can gene... / concepts from dynamical systems theory to understand the operation of br concepts from dynamical systems theory in order to understand the
54.3 Wavelet regression by cross-validation - Nason (1994)(Correct)
This paper is about using wavelets for regression. The main aim of the paper is to introduce and develop a cross-validation method for selecting a wavelet regression threshold that produces good estim... / The former paper developed a theory for the minimax estimation of br A general introduction to the theory of wavelets can be found in Strang
52.9 Linear Approximation of Shortest Superstrings - Blum, Jiang, Li, Tromp, Yannakakis (1991)(Correct)
We consider the following problem: given a collection of strings s 1 ; . . . ; s m , find the shortest string s such that each s i appears as a substring (a consecutive block) of s. Although this prob... / Cambridge MA . E-mail avrim theory.lcs.mit.edu y Supported in br M. Li. Towards a DNA sequencing theory. st IEEE Symp. on Foundations
51.8 Biconnectivity Approximations and Graph Carvings - Khuller, Vishkin (1994)(Correct)
A spanning tree in a graph is the smallest connected spanning subgraph. Given a graph, how does
one find the smallest (i.e., least number of edges) 2-connected spanning subgraph (connectivity refers
t... / rd Annual Symposium on Theory of Computing pp. - br rd Annual Symposium on Theory of Computing pp. -
51.5 Statistical Foundations for Default Reasoning - Bacchus, Grove, Halpern, Koller (1993)(Correct)
We describe a new approach to default reasoning,
based on a principle of indifference among
possible worlds. We interpret default rules as
extreme statistical statements, thus obtaining a
knowledge ba... / result of adopting an ad hoc theory of irrelevance. In our method we br reason for accepting the theory of irrelevance generated by