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.
Fast Combinatorial Algorithms for Packing and Covering Problems - Könemann (2000)(Correct)
Contents 1 Introduction 3 2 Basics and Preliminaries 7 2.1 Basic Graph Theory . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 2.2 Linear Programming . . . . . . . . . . . . . . . .... / Preliminaries . Basic Graph Theory . br and covering. . Basic Graph Theory We denote a graph G by the
Fast Sets and Points for Fractional Brownian Motion - Khoshnevisan, Shi (2000)(Correct)
this article. Define the function / as unknown Fast Sets and Points for
Fractional Brownian Motion
By
Davar Khoshnevisan* Zhan Shi
University of Utah Universit'e Paris VI
Summary. In their classic p... / part of classical probability theory. In particular we mention A. br Hausdorff dimension and potential theory. For any P E and
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
An Algorithm for Polynomial Matrix Factor Extraction - Henrion, Sebek (2000)(Correct)
An algorithm is described for extracting a polynomial matrix factor featuring
any subset of the zeros of a given non-singular polynomial matrix. It is assumed
that the zeros to be extracted are given ... / y Institute of Information Theory and Automation Academy of br equations found in linear systems theory As a byproduct we also end
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
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
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
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
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
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
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
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
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
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
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 automata with multiplicities is
Using Neural Networks for Descriptive Statistical Analysis of.. - Tirri (1999)(Correct)
In this paper we discuss the methodological issues of using a class
of neural networks called Mixture Density Networks (MDN) for discriminant
analysis. MDN models have the advantage of having a rigoro... / biological simulation or automata theory. Our approach to neural networks br J. and Smith A. Bayesian theory. John Wiley. Bezdek J.
Secure File Transfer: A Computational Analog to the Furniture Moving.. - Akl (1999)(Correct)
One of the most compelling illustrations of the power of parallelism is
the furniture-moving paradigm. In it, a large item of furniture needs to
be moved from one place to another. A single mover, wor... / predicted by common sense In the theory of parallel computation there is br complexity and parallel speed-up Theory of Computing Systems
A Theoretical Study of the Contrast Recovery and Variance of MAP.. - Qi, Leahy (1999)(Correct)
We examine the spatial resolution and variance properties of
PET images reconstructed using maximum a posteriori (MAP)
or penalized-likelihood methods. Resolution is characterized
by the contrast reco... / are included in Section V. II. THEORY A. MAP reconstruction We use br proceed by using Fourier transform theory to analyze which results in
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
Feasible Reductions to Kolmogorov-Loveland Stochastic Sequences - Lutz, Schweizer (1999)(Correct)
For every binary sequence A, there is an infinite binary sequence S
such that A
P
tt S and S is stochastic in the sense of Kolmogorov and
Loveland.
1 Introduction
In the mid-1960's, Martin-Lof [23]... / Martin-Lof used the general theory of algorithms to formulate the br in the foundations of probability theory.Thus the random sequences form
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
Symbolic Itô calculus in AXIOM: an ongoing story - Kendall (1999)(Correct)
Symbolic Ito calculus refers both to the implementation of Ito calculus
in a computer algebra package and to its application. This article
1
reports on progress in the implementation of Ito calculus... / distribution from statistical shape theory. Key words AXIOM computer br be explained by the molecular theory of fluids and independently the
The Reduced Genus of a Multigraph - de Mendez (1999)(Correct)
We de ne here the reduced genus of a multigraph as the minimum
genus of a hypergraph having the same adjacencies with the same
multiplicities. Through a study of embedded hypergraphs, we obtain new
... / is a central topic in Graph Theory and numerous studies relate br Conference on Combinatorics Graph Theory and Computing volume XXVI pages
Efficiency of NPMLE in Nonparametric Missing Data Models - van der Laan, Gill (1999)(Correct)
Suppose that a random variable X of interest is grouped or censored or missing so that
one only observes a coarsening of X, i.e., a random set containing X with probability 1. It
is assumed that the c... / calculations. So far the general theory which is available Bickel and br a given set E. For efficiency theory we refer to Bickel Klaassen
Four Short Questions On Birkhoff Polytope - Pak (1999)(Correct)
We ask several questions on the structure of the polytope of doubly
stochastic n \Theta n matrices Pn , known as a Birkhoff polytope. We discuss the volume
of Pn , the work of the simplex method, an... / Combinatorics to Optimization Theory to Statistics. While Birkhoff br standard results in representation theory of the symmetric group. Let us
Analysis and numerical solution of control problems in descriptor form - Kunkel, Mehrmann, Rath (1999)(Correct)
We study linear variable coefficient control problems in descriptor form. Based on
a behaviour approach and the general theory for linear differential algebraic systems
we give the theoretical analysi... / behaviour approach and the general theory for linear differential algebraic br need to develop the mathematical theory as well as numerical methods that
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.
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
Model Checking TLA+ Specifications - Yu, Manolios, Lamport (1999)(Correct)
TLA
+
is a specification language for concurrent and reactive
systems that combines the temporal logic TLA with full first-order logic
and ZF set theory. TLC is a new model checker for debugging a... / full first-order logic and ZF set theory. TLC is a new model checker for br logic and ZermeloFr ankel set theory along with support for writing
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
Some Properties of the Arc Sine Law Related to Its Invariance Under a .. - Pitman, Yor (1999)(Correct)
This paper shows how the invariance of the arc sine distribution on (0; 1) under a
family of rational maps is related on the one hand to various integral identities with
probabilistic interpretations ... / hand to results in the analytic theory of iterated rational maps. br a is a well known result in the theory of iterated maps dating back to
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
Markov Switching Time Series Models with Application to a Daily.. - Lu, Berliner (1999)(Correct)
We consider a class of Bayesian dynamic models that involve switching among
various regimes. As an example we produce a model for a runoff time series exhibiting
pulsatile behavior. This model is a mi... / in this model. Probability theory implies that conditional on the br hand side of . Probability theory tells us that the joint density
Quantum Strategies - Meyer (1999)(Correct)
We consider game theory from the perspective of quantum algorithms. Strategies in classical
game theory are either pure (deterministic) or mixed (probabilistic). While not every
two-person zero-sum fi... / Nm Abstract We Consider Game Theory From The Perspective Of Quantum br Strategies in classical game theory are either pure deterministic or
Organizations in Action - Kamps (1999)(Correct)
This article presents a formal reconstruction of James D. Thompson's classic contribution to organization theory, Organizations in Action. The reconstruction explicates the underlying argumentation st... / Reducing Uncertainty A Formal Theory of Organizations in Action br contribution to organization theory Organizations in Action. The
YAC: Yet Another Computation Model of Self-Assembly - Yokomori (1999)(Correct)
This paper proposes a new model for DNA computation called YAC that is
based on self-assembly principle. The advantages of the proposed model may be
summarized as follows : (i) the model has the unive... / grammars in formal language theory quite a few number of normal form br notions and notations from the theory of formal languages. See e.g.
Visual Representations Embodying Spacetime Structure - Florack (1999)(Correct)
If one defines a visual front-end to be that part of a visual system in which the structure of
the optical world is represented in some least committed form, then it is plausible to assert
that it ref... / for its role in scale-space theory constitutes the pivot of br with available evidence. Theory Consider a tentative profile
Anaphoric Presupposition and Discourse Connectivity - Webber, Knott, Stone, Joshi (1999)(Correct)
We show how discourse structure can be relieved of some of the burden of discourse
semantics by seeing part of it as arising from anaphoric presupposition (Van der Sandt,
1992). This allows the discou... / clauses. Rhetorical Structure Theory RST Mann and Thompson br with epistemic because.Our theory correctly predicts that such
The Stable Manifold Theorem For Nonlinear Stochastic Systems With.. - Mohammed, Scheutzow (1999)(Correct)
We consider non-linear stochastic functional differential equations (sfde's) on
Euclidean space. We give sufficient conditions for the sfde to admit locally compact smooth
cocycles on the underlying... / Our construction is based on the theory of finite-dimensional stochastic br equation sfde result in the theory of non-linear infinite-dimensional
Computation of the Semantics of Autoepistemic Belief Theories - Stefan Brass, Jürgen Dix, Teodor C.. (1999)(Correct)
Recently, one of the authors introduced a simple and yet powerful non-monotonic
knowledge representation framework, called the Autoepistemic Logic of Beliefs,
AEB. Theories in AEB are called autoepis... / belief theories. Every belief theory T has been shown to have the br static expansion T of any belief theory provides its natural non-monotonic
Type II Codes, Even Unimodular Lattices and Invariant Rings - Bannai, Dougherty, al. (1999)(Correct)
In this paper, we study self-dual codes over the ring Z 2k of the integers modulo 2k
with relationships to even unimodular lattices, modular forms, and invariant rings of
This work was supported in... / let us recall the general invariant theory of finite groups. Let G be a br lattices IEEE Trans. Inform. Theory vol. IT- pp. - .
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
A Cybernetic Perspective on the Role of Noise in the Iterated.. - Seth (1999)(Correct)
An interpretation of the evolution of complexity in the Iterated
Prisoner's Dilemma (IPD) is developed, based on Ashby's "law of requisite
variety". It is demonstrated that the influence of noise on t... / between artificial life game theory and cybernetics holds br is twofold. Firstly cybernetic theory can indicate general principles
TLA+ Verification of Cache-Coherence Protocols - Akhiani, Doligez, Harter, Lamport.. (1999)(Correct)
Protocol . . . . . . . . . . . . . . . . . . . . . . 6
3.3 The Lower-Level Protocol . . . . . . . . . . . . . . . . . . . . 7
3.3.1 Writing the Specification . . . . . . . . . . . . . . . . 7
3.3.2 Th... / based on first-order logic and set theory. Both projects used the br language based on untyped ZF set theory first-order logic and TLA the
Efficient Bulk Operations on Dynamic R-trees - Arge, Hinrichs, Vahrenhold, Vitter (1999)(Correct)
In recent years there has been an upsurge of interest in spatial databases. A major
issue is how to efficiently manipulate massive amounts of spatial data stored on disk in
multidimensional spatial in... / and show that it is efficient in theory as well as in practice. We present br computational geometry graph theory and string processing. Refer to
Piecewise-Constant Stabilization - Nikitin (1999)(Correct)
With the help of topological necessary conditions for continuous stabilization it is shown that,
in general, in order to stabilize continuous- and discrete-time systems one has to use time-dependen... / of the basic problems in systems theory. In and it is shown br in many applications of control theory. The commonly accepted starting
Log-Periodogram Regression Of Time Series With Long Range Dependence - Eric Moulines (1999)(Correct)
This paper discusses the use of fractional exponential models (Robinson (1990), Beran (1994))
to model the spectral density f(x) of a covariance stationary process when f(x) may be decomposed
as f(x) ... / we develop a large-sample theory for log-periodogram ordinates br affect the limiting distribution theory. ffl When n p
Proof of Correctness of a Processor with Reorder Buffer using the.. - Ravi Hosabettu (1999)(Correct)
The Completion Functions Approach was proposed in [HSG98]
as a systematic way to decompose the proof of correctness of pipelined
microprocessors. The central idea is to construct the abstraction fun... / procedures for the combined theory of boolean expressions with br We are also developing a PVS theory of the eventually temporal
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
On the Spectral Theory of Dispersive N-Body Hamiltonians - Damak (1999)(Correct)
In this work we describe a general class of dispersive N-body hamiltonians for
which we prove the HWZ theorem and a Mourre estimate outside a closed and
countable set of energies called thresholds. As... / On the Spectral Theory of Dispersive N-Body Hamiltonians br results concerning the spectral theory of this type of hamiltonians have
Une formule pour les invariants de Gromov-Witten des.. - Spielberg (1999)(Correct)
We study the fix point components of the big torus action on the moduli space of stable
maps into a smooth projective toric variety, and apply Graber and Pandharipande's
localisation formula for the v... / . . Perfect obstruction theory and virtual fundamental class . br they both use excess intersection theory to slice out a cycle in exactly
Discrete linearized least squares rational approximation on the unit.. - Van Barel, Bultheel (1999)(Correct)
We already generalized the Rutishauser-Gragg-Harrod-Reichel algorithm for discrete least squares
polynomial approximation on the real axis to the rational case. In this paper, a new method for discret... / time to order m. The theory behind the algorithm Let us br that plays the central role in the theory. Let us return to the
Statistical Models of Conditioning - Peter Dayan (1999)(Correct)
Conditioning experiments probe the ways that animals make predictions
about rewards and punishments and use those predictions
to control their behavior. One standard model of conditioning
paradigms wh... / is a well established statistical theory for competitive models and it is br show what constraints a new theory must satisfy and suggest and
Automata Theory for Reasoning about Actions - Ternovskaia (1999)(Correct)
In this paper, we show decidability of a rather
expressive fragment of the situation calculus.
We allow second order quantification over finite
and infinite sets of situations. We do not
impose a doma... / Automata Theory for Reasoning about Actions br precisely given action description theory T and query OE we are
Spin Glasses - Sherrington (1999)(Correct)
Introduction
The expression "spin glass" was originally coined to describe some magnetic alloys
in which there was observed non-periodic "freezing" of the orientations of
the magnetic moments (or "sp... / and overview is given of the theory of spin glasses and its br and Anderson to produce a theory of this transition was the spark
On certain Hamiltonian Cycles in Planar Graphs - Böhme, Harant, Tkác (1999)(Correct)
The problem is considered under which conditions a 4-connected planar or projective
planar graph has a Hamiltonian cycle containing certain prescribed edges and missing
certain forbidden edges. The re... / D R A F T Journal Of Graph Theory G And Let A B Be Two Edges br D R A F T Journal Of Graph Theory The Length Of A Path Or A
Justification of Heuristic Methods in Data Processing Using Fuzzy.. - Kreinovich, Nguyen, Wu (1999)(Correct)
In this paper, we show that fuzzy theory can explain heuristic methods in inverse problems and
numerical computations. As an example of application of these results, we analyze the problem of
detectin... / in Data Processing Using Fuzzy Theory with Applications to Detection of br In this paper we show that fuzzy theory can explain heuristic methods in
Helping Data Suppliers and Consumers Negotiate the Details: A.. - Arnon Rosenthal (1999)(Correct)
Databases that interchange information will rarely have the same native form, so one
must map between the supplier's native interface and the consumer's. Using a SQL view
to define this map is conveni... / are to be used. We then describe a theory that enables automated tools to br through views. In particular the theory attempts to minimize the effort
Tiling Multi-Dimensional Arrays - Sharp (1999)(Correct)
We continue the study of the tiling problems introduced in
[KMP98]. The rst problem we consider is: given a d-dimensional array of
non-negative numbers and a tile limit p, partition the array into ... / Conference on Database Theory ICDT pages - January
Simultaneous Intersection Representation of Pairs of Graphs - Tanenbaum (1999)(Correct)
We characterize the pairs (G1 ; G2) of graphs on a shared vertex set
that are intersection polysemic: those for which the vertices may be assigned
subsets of a universal set such that G1 is the inters... / shadows in the directions of graph theory order theory and linear algebra. br directions of graph theory order theory and linear algebra. This endows
Perturbing A Symmetric Resonance: The Magnetic Spherical Pendulum - Montaldi (1999)(Correct)
this
paper is to study this geometry. For brevity, we consider only the cases of symmetry
breaking O(2) ! SO(2) and D4 ! Z4 . We follow the standard approach
of Lyapounov-Schmidt reduction and normal ... / reduction and normal form theory together with singularity theory br theory together with singularity theory to justify the truncation to
Path Planning and Flight Controller Scheduling for an Autonomous.. - Egerstedt Koo (1999)(Correct)
In this article we investigate how to generate flight trajectories
for an autonomous helicopter. The planning strategy that we propose
reflects the controller architecture. It is reasonable to ident... / y Optimization and Systems Theory y Department of EECS Royal br from linear optimal control theory. The main idea is to compose the
Face Authentication by retinotopic sampling of the Gabor.. - Smeraldi Capdevielle (1999)(Correct)
We describe a face authentication algorithm based
on retinotopic sampling of the Gabor decomposition.
A log--polar sampling grid is used to encode information
from relevant regions of the face. Decisi... / and . SVM Experts The theory behind SVM's is rather complex br and G. Lugosi. A probabilistic theory of pattern recognition. Number
Sequential Asm Thesis - Gurevich (1999)(Correct)
state
machines (ASMs) used to be called evolving algebras. The sequential ASM thesis
and its extensions [Gurevich 1995] inspired diverse applications of ASMs. The
early applications were driven, at le... / a unique opportunity to combine theory and applications. Q What br think for example about graph theory group theory or set theory.In
Coreference and Representationalism - Paul Dekker (1999)(Correct)
The compositional interpretation of structures in discourse has raised
the question whether some level of representation is indispensable in the
analysis of the semantics of natural language. In this ... / Cooper's E-type pronoun theory cf. Evans Cooper br branch of nowadays semantic theory meaning and interpretation have
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
On Periodic Resource Scheduling for Continuous Media Databases - Garofalakis, Özden (1998)(Correct)
The Enhanced Pay-Per-View (EPPV) service model provides an
effective way of delivering continuous media (CM) data clips to a
large number of different clients. The aim is to share CM streams
among var... / realm of hard real-time scheduling theory The high disk latencies br area of hard real-time scheduling theory by proposing the scheduling tree
The Simulated Likelihood Ratio (SLR) Method - Billio, Monfort, Robert (1998)(Correct)
A simulation method based on importance sampling, Gibbs and
Metropolis-Hastings techniques allows to approximate the ratio between the
likelihood function computed for two different parameter values... / Polson and Rossi and survey theory Little and Rubin Heitjan br with the needs of financial theory and with some features of
Parsing As Information Compression By Multiple Alignment, Unification .. - Wolff (1998)(Correct)
This article introduces the idea that parsing in the sense associated with computational
linguistics and natural language processing may be understood as information compression by
multiple alignment... / work on Algorithmic Complexity Theory see for example Li and Vitnyi br analysis in terms of information theory. An attempt at this analysis is
Periodic Structure in Two-Dimensional Riemann Problems for.. - Pinezich (1998)(Correct)
of the Dissertation
Periodic Structure in Two-Dimensional
Riemann Problems for
Hamilton-Jacobi Equations
by
John Dominick Pinezich
Doctor of Philosophy
in
Applied Mathematics and Statistics
State Un... / and is the central relation in the theory of Legendre transforms. Assuming br . as a Riemann problem. The theory of Legendre transforms has its
Domain Expertise vs. Validation Expertise: Essentials of Validating.. - Jantke (1998)(Correct)
The present short paper deals with fundamental problems in Computer Science, in general,
and in Artificial Intelligence (AI), especially. It addresses the question how to deal with the
problem whether... / are formalized. Computability theory is providing a rich source of br to algorithmic learning theory and to validation of complex
Constructive Theory Refinement in Knowledge Based Neural Networks - Parekh, Honavar (1998)(Correct)
Knowledge based artificial neural networks offer
an approach for connectionist theory refinement. We
present an algorithm for refining and extending the domain
theory incorporated in a knowledge based... / Constructive Theory Refinement in Knowledge Based br an approach for connectionist theory refinement. We present an
Database Replication based on Group Communication - Kemme, Alonso (1998)(Correct)
Database replication is traditionally seen as a mechanism to increase the availability
and performance of distributed databases. However, very few of the numerous protocols
that have been proposed in ... / bridge the gap between replication theory and practice by addressing some br than what is considered in theory. These consistency levels are
Anaphoric Linking at Run Time: A Type-Logical Account of Discourse.. - Terui (1998)(Correct)
A number of attempts have been made to combine Discourse Representation Theory with
type-logical grammar in order to obtain a compositional (bottom-up) framework for discourse
representation (e.g., Mu... / to combine Discourse Representation Theory with type-logical grammar in br Discourse Representation Theory DRT Kam Hei KR
How to Specify and Verify the Long-Run Average Behavior of.. - de Alfaro (1998)(Correct)
Long-run average properties of probabilistic systems
refer to the average behavior of the system, measured
over a period of time whose length diverges to infinity.
These properties include many releva... / are based on new results from the theory of Markov decision processes. br relies on new results on the theory of Markov decision processes and
O-Minimal Hybrid Systems - Gerardo Lafferriere, George J.. (1998)(Correct)
A unified approach to decidability questions for verification algorithms of hybrid
systems is obtained by the construction of a bisimulation. Bisimulations are finite state
quotients whose reachabil... / systems bisimulations model theory o-minimality decidability br found in The theory of formal verification is one of
Scaling Limit For The Incipient Spanning Clusters - Aizenman (1998)(Correct)
Scaling limits of critical percolation models show major differences between
low and high dimensional models. The article discusses the formulation of the
continuum limit for the former case. A math... / of the limiting continuum theory. The resulting structure is br of the limiting continuum theory which is applicable to models
Practical and proven zero-knowledge constant round variants of GQ and .. - Desmedt, Kurosawa (1998)(Correct)
this paper we present
constant round variants of the protocols of Guillou-Quisquater
and Schnorr with the same (order-wise) communication and computational
complexity as the original schemes. Note tha... / protocols not based on number theory e.g. the protocols br and Schnorr's protocols the theory has inspired the protocols but
Rhythmic constraints on stress timing in English - Fred Cummins, Robert F. Port (1998)(Correct)
The failure to document isochronous interstress intervals in spoken English may be attributed to
the unconstrained nature of most experimental tasks. Some experiments are described which probe
the deg... / of a car each of which could in theory point in any given direction. br volume of Research in Text Theory pages - . Walter de
Quantum Computing - Shor (1998)(Correct)
The Church-Turing thesis says that a digital computer is a universal computational device; that is, it is able to simulate any physically realizable computational device. It has generally been belie... / of quantum mechanics with number theory was itself surprising. For br What was needed for the theory of computation was some
Protein Structure Prediction by Threading. Why it Works and Why it.. - Mirny, Shakhnovich (1998)(Correct)
We developed a novel Monte Carlo threading algorithm... and 3.5 Å, the success of threading alignment may depend on the quality of potentials used. These results are rationalized in terms of a t... / advance in protein folding theory which started from the seminal br enough for structure predictiontheory and application to a random
Design and Implementation of Triveni: a Process-algebraic API for.. - Christopher Colby (1998)(Correct)
We describe Triveni, a framework and API for integrating
threads and events. The design of Triveni is based on an
algebra, including preemption combinators, of processes.
Triveni is compatible with ex... / programming with ideas from the theory of concurrency such as process br built on ideas from concurrency theory. Occam is based on CSP Pict is
Parallel Solution of Selected Problems in Control Theory - Quintana-Orti, Geijn (1998)(Correct)
Lyapunov and Stein matrix equations arise in many important analysis and synthesis applications
in control theory. The traditional approach to solving these equations relies on the QR
algorithm which ... / of Selected Problems in Control Theory Enrique S. Quintana-Ort'i br synthesis applications in control theory. The traditional approach to
Controlling Risk Exposure and Dividends Pay-out Schemes: Insurance.. - Højgaard, Taksar (1998)(Correct)
The paper represents a model for the financial valuation of a firm which
has control on the dividend payment stream and its risk as well as potential
profit by choosing different business activities a... / of the classical Miller Modigliani theory of firm valuation theory to the br theory of firm valuation theory to the situation of controllable
Defining and Translating Visual Schemas for Deductive Databases - Puigsegur, Pastor, Agusti (1998)(Correct)
We present a visual language expressive enough to capture an important subset of First
Order Predicate Logic as well as its straightforward translation to the logic-based paradigm of
deductive databas... / a consequence of their underlying theory First Order Predicate Logic. br learning the basic facts about set theory. Moreover as we have pointed out
Algebras for Querying Text Regions: Expressive Power and Optimization - Consens (1998)(Correct)
There is a significant amount of interest in combining and extending
database and information retrieval technologies to manage textual
data. The challenge is becoming more relevant due to increased av... / and the monadic first order theory of finite binary trees we show br and the monadic first order theory of finite binary trees we were
Multiresolution Signal Decomposition Schemes. Part 1: Linear and.. - Goutsias, Heijmans (1998)(Correct)
This report proposes a general axiomatic pyramid decomposition scheme for signal analysis
and synthesis. This scheme comprises the following ingredients: (i) the pyramid consists of a
(finite or infin... / condition known from the theory of wavelets note however that br notations and results from the theory of mathematical morphology which
Relaxation Labeling Using Augmented Lagrange-Hopfield Method - Stan Li (1998)(Correct)
This paper presents a novel relaxation labeling method called Augmented
Lagrangian-Hopfield (ALH) method based on the Augmented Lagrangian multipliers
and the graded Hopfield neural network. In the AL... / roots of the following mean field theory equations r p E eff p br have the following the mean field theory equations q i I Gamma
A fast implementation of wavelet transform for m-band filter banks - Tian, Wells, Jr. (1998)(Correct)
An orthogonal m-band discrete wavelet transform has an O(m
2
) complexity. In this paper we present a fast implementation
of such a discrete wavelet transform. In an orthonormal m-band wavelet syste... / From the wavelet matrix theory we know that the DWT of a br filters. Note that in the theory of wavelet analysis we will
An Operational Semantics for Probabilistic Concurrent Constraint.. - Di Pierro, Wiklicky (1998)(Correct)
This paper investigates a probabilistic version of the
concurrent constraint programming paradigm (CCP).
The aim is to introduce the possibility to formulate
so called "randomised algorithms" within t... / computational geometry and number theory. They are intensively studied br example wellknown in probability theory namely the random walk
Associative Algebras, Symmetric Cones and Polynomial Time Interior.. - Schmieta, Alizadeh (1998)(Correct)
We present a generalization of Monteiro's polynomiality proof of a large
class of primal-dual interior point algorithms for semidefinite programs. We show
that this proof, essentially verbatim, appl... / values coincide. This duality theory gives rise to a complementary br He also observed that the theory of self-concordant barriers
Using Explicit Requirements and Metrics for Interface Agent User.. - Brown, Jr. (1998)(Correct)
The complexity of current computer systems and software
warrants research into methods to decrease the cognitive
load on users. Determining how to get the right information
into the right form with th... / agent's user model based on utility theory. We explicitly take into account br Jr.and Sheila B. Banks. Utility theory-based user models for intelligent
Interval-Valued Preference Structures - Bilgic (1998)(Correct)
Different languages that are offered to model vague preferences are reviewed and an interval-valued
language is proposed to resolve a particular difficulty encountered with other languages. It is show... / Keywords Fuzzy sets decision theory vague preferences br the Bayesian accounts of decision theory Savage the preferences are
Adaptive Wavelet Estimation: A Block Thresholding And Oracle.. - Tony Cai (1998)(Correct)
We study wavelet function estimation via the approach of block thresholding and
ideal adaptation with oracle. Oracle inequalities are derived to offer insights into
the balance and tradeoff between bl... / in multivariate normal decision theory and the more recent wavelet br When n or decision theory shows that the maximum likelihood
Connection Relations in Mereotopology - Cohn, Varzi (1998)(Correct)
We provide a model-theoretic framework for investigating
and comparing a variety of mereotopological theories with
respect to (i) the intended interpretation of their connection primitives,
and (ii)... / theories. As mereology the theory of parthood was initially br developed as an alternative to set theory the theory of membership in the
A High-Level Dataflow System - Verdoscia, Vaccaro (1998)(Correct)
A High Level Dataflow System. This paper presents a new dataflow graph model,
where only data tokens are allowed to flow. First we introduce a High-Level Dataflow
System (HLDS) to describe a formal da... / and notations from graph theory CHR HAR BOF Let A br BOF Boffey T.B.Graph Theory in Operations Research The
Admissibility of Fixpoint Induction over Partial Types - Karl Crary (1998)(Correct)
Partial types allow the reasoning about partial functions in
type theory. The partial functions of main interest are recursively computed
functions, which are commonly assigned types using fixpoint ... / about partial functions in type theory. The partial functions of main br provers based on constructive type theory such as Nuprl based on
Rapid Prototyping of Specification Language Implementations - Leucker, Noll (1998)(Correct)
Specification languages such as LOTOS
and SDL play an important role in the design and
implementation of distributed systems. Their formal
syntax and semantics supports the development
of compilers an... / formalised as an equational theory and as a conditional term br term rewriting modulo an equational theory p E R p
Compositional Reasoning Using the Assumption-Commitment Paradigm - Qiwen, Swarup (1998)(Correct)
Assumption--Commitment paradigms have been investigated to derive tractable rules for composing
specifications of concurrent systems. We first give a short survey of several typical
composition rules,... / of Programming including Theory for Concurrency and Real Time br among processes. A compositional theory consists of a semantics and a set
Optimal Multicast Smoothing of Streaming Video over an Internetwork - Sen, Towsley, Zhang, Dey (1998)(Correct)
A number of applications such as internet video broadcasts, corporate telecasts, distance learning etc. require
transmission of streaming video to multiple simultaneous users across an internetwork. T... / video streaming we develop a theory integrating smoothing with br measure of smoothness based on the theory of majorization is proposed
Measure and Dimension for some Fractal Families - Solomyak (1998)(Correct)
We study self-similar sets with overlaps, on the line and in the plane. It is shown
that there exist self-similar sets that have non-integral Hausdorff dimension equal to the
similarity dimension, but... / for the background in dimension theory and to for a survey of br defined Cantor-set in Ergodic Theory of Z d Actions LMS
Strategic Reflection - Lincoln, Meseguer (1998)(Correct)
The Maude system incorporates reflective capabilities that
enable quite sophisticated strategies to be expressed very conveniently.
Maude's strategy languages have been used to control the execution... / at the metalevel of the rewrite theory expressing any tool's inference br of the International Workshop on Theory and Practice of Algebraic
Self-Similarity in File Systems - Gribble, Manku, Brewer, Gibson.. (1998)(Correct)
We demonstrate that high-level file system events exhibit selfsimilar behaviour, but only for short-term time scales of approximately under a day. We do so through the analysis of four sets of traces ... / related work. In section the theory behind self-similar and br We borrow heavily upon the theory and analysis techniques presented
TCP/IP Implementation with Endsystem QoS - Shi, Parulkar, Gopalakrishnan (1998)(Correct)
This paper presents a Real-time Upcall (rtu) [1] based tcp/ip implementation that guarantees
throughput for continuous media applications and ensures low latency bounds for interactive applications.
... / within each class. Although the theory of providing qos is well br work that closely integrates theory and practice to improve
Advanced Programming Techniques Using Scheme - Moreau, Ribbens, Gribomont (1998)(Correct)
this paper, we
describe an interactive reducer for lambda terms that combines
first-class continuations, macros, delay, and state. We also
describe the means by which we induce students to master
adva... / functions. No explicit theory is given except maybe a br We simply go from practice to theory in order to demonstrate this we
Image Thresholding by Indicator Kriging - Oh (1998)(Correct)
We consider the problem of segmenting a digitized
2D or 3D image consisting of two univariate populations.
Assume a-priori knowledge allows incomplete assignment
of voxels in the image, in the sense t... / and a method based on fuzzy set theory. We also note the approach br method. Applying information theory Pun Kapur et al.
A New Parameter Estimation Method for Gaussian Mixtures - Singer, Warmuth (1998)(Correct)
We describe a new iterative method for parameter estimation of Gaussian mixtures. The
new method is based on a framework developed by Kivinen and Warmuth for supervised online
learning. In contrast to... / methods in statistics and learning theory leading to a broader approach for br Thomas. Elements of Information Theory. Wiley . A.P. Dempster
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
Renormalization Group Pathologies and the Definition of Gibbs States - Bricmont, Kupiainen, al. (1998)(Correct)
We show that the so-called Renormalization Group pathologies in low temperature
Ising models are due to the fact that the renormalized Hamiltonian is defined
only almost everywhere (with respect to th... / of universality in the theory of critical phenomena and of the br contours producing an effective theory for the larger scale contours.
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
The Grafting Map Of Teichmüller Space - Scannell, Wolf (1998)(Correct)
this
paper is to give such a parametrization. This parametrization is straightforward and has
been expected for some time ([Ta97], [Mc98]): to each member of a Bers slice of the space unknown THE GRAF... / a different aspect of the general theory. The first uses the Schwarzian br of the complex analytic side of the theory see for instance Ea Gu
Hierarchical Universal Coding - Feder, Merhav (1998)(Correct)
In an earlier paper, we proved a strong version of the redundancy-capacity converse theorem of
universal coding, stating that for `most' sources in a given class, the universal coding redundancy is
es... / paper however is in extending the theory of universal coding to br the scope of universal coding theory so as to deal with hierarchies of
Combining Finite Automata, Parallel Programs and SDL using Petri Nets - Grahlmann (1998)(Correct)
This paper introduces a method to combine finite automata, parallel programs and SDL (Specification and Description Language) specifications. We base our approach on M-nets exploiting the rich set of ... / in order to use Petri net theory for the simulation the analysis br Ullmann. Introduction to Automata Theory and Languages and Computation.
The Sphere Packing Problem - Sloane (1998)(Correct)
A brief report on recent work on the sphere-packing problem.
1991 Mathematics Subject Classification: 52C17
Keywords and Phrases: Sphere packings; lattices; quadratic forms; geometry
of numbers
1 In... / its roots in geometry and number theory it is part of Hilbert's th br question in information theory. The connection is via the
A Microeconomic View of Data Mining - Kleinberg, Papadimitriou, Raghavan (1998)(Correct)
We present a rigorous framework, based on optimization, for evaluating data mining
operations such as associations and clustering, in terms of their utility in decisionmaking.
This framework leads qui... / analysis segmentation and the theory of games. Department of br literature. We want to develop a theory of the value of extracted
Defeasible Logics - Geerts, Laenens, Vermeir (1998)(Correct)
Contents
0.1 Introduction : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 1
0.2 Pearl's system Z : : : : : : : : : : : : : : : : : : : : : : : : : : : : 4
0.2.1 Deriving a natural ordering... / look at models of a classical theory that are minimal with respect to br set of predicates occurring in the theory. Fixpoint formalisms include
Spatial Representation of Symbolic Sequences through Iterative.. - Tino (1998)(Correct)
Jeffrey [10] proposed a graphic representation of DNA sequences using Barnsley
's iterative function systems. In spite of further developments in this direction
[19, 25, 13], the proposed graphic repr... / for computation of information theory based features of DNA strands br the framework of multifractal theory After an intuitive
Mixing Up Nondeterminism and Probability: a preliminary report - den Hartog, de Vink (1998)(Correct)
For a process language with both nondeterministic and probabilistic choice
and a form of failure a transition system is given from which, in a modular way, various
operational models corresponding to ... / close connection between measure theory and metric topology. We refer to br . A. Edalat. Domain theory and integration. TCS
On the Orthographic Dimension of Constraint Databases - Grumbach, Rigaux, Segoufin (1998)(Correct)
One of the most important advantages of constraint databases
is their ability to represent and to manipulate data in arbitrary dimension
within a uniform framework. Although the complexity of queryi... / which has a decidable first-order theory. Then it is decidable if a br which has a decidable firstorder theory and such that addition and
A Theorem Prover for ASTRAL - Kolano (1998)(Correct)
The ASTRAL real-time formal specification language has been encoded into the PVS theorem prover. A
translator has been developed to completely translate any single-level ASTRAL specification into its
... / collection of theories. A theory may be parameterized to support br polymorphism. Declarations in one theory can be referenced in another
Constraints and Universal Algebra - Jeavons, Cohen, Pearson (1998)(Correct)
In this paper we explore the links between constraint satisfaction
problems and universal algebra. We show that a constraint satisfaction
problem instance can be viewed as a pair of relational structu... / databases. Relational database theory provides a very powerful and br and Intractability A Guide to the Theory of NP-Completeness. Freeman San
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
Derandomizing Arthur-Merlin Games - van Melkebeek (1998)(Correct)
We establish hardness versus randomness trade-ooes for Arthur-Merlin games. We create
eOEcient nondeterministic simulations of bounded round Arthur-Merlin games, using a language
in exponential time w... / a major insight in complexity theory states that if some of the br Bab L. Babai. Trading group theory for randomness. In Proceedings of
Contention Resolution with Constant Expected Delay - Goldberg, MacKenzie, Paterson.. (1998)(Correct)
We study contention resolution in a multiple-access channel such as the Ethernet
channel. In the model that we consider, n users generate messages for the
channel according to a probability distributi... / especially in the information theory community see for example the br special issue of IEEE Trans. Info. Theory on this topic We now
An Experimental Study of Minimum Mean Cycle Algorithms - Ali Dasdan (1998)(Correct)
We present a comprehensive experimental study of ten leading algorithms for the minimum
mean cycle problem. For most of these algorithms, there has not been a clear understanding of
their performance ... / unknown algorithm to the graph theory community is by far the fastest br for the applications in graph theory. We will mostly focus on their
Profiting from Spin in PEP - Grahlmann, Pohl (1998)(Correct)
This paper describes how the PEP tool (Programming Environmnet based on Petri nets) profits from an integration of the Spin (Simple PROMELA INterpreter) verification package. Translation methods from ... / have been based on Petri net theory. Originally the core of the br of ATPN' Application and Theory of Petri Nets Torino volume
Einstein-Weyl Geometry - Calderbank, Pedersen (1998)(Correct)
instein manifolds with positive scalar curvature and continuous
isometries are known to have Einstein deformations, yet we shall see that it
is precisely under these two conditions that nontrivial Ein... / equivalent formulation in twistor theory which provides a tool for br present the initial results of the theory. A key role is played by the
BCH Convolutional Codes - Rosenthal, York (1998)(Correct)
Using a new parity check matrix, a class of convolutional codes with a designed free
distance is introduced. This new class of codes has many characteristics of BCH block
codes, therefore we call thes... / Symposium on Information Theory Ulm Germany June -July br commonly used in systems theory are very useful for the
Fixed-Choice and Independent-Choice Logics - Blass, Gurevich (1998)(Correct)
We study extensions of first-order logic with the choice construct (choose x : '(x)).
We prove some results about Hilbert's " operator, but in the main part of the paper
we consider the case when all... / the sense of programming not set theory. A Boolean-valued term is simply a br played an important role in proof theory Leisenring Here we are
Generic Programming by Program Composition - Correnson, Duris, Parigot, Roussel (1998)(Correct)
Recently, generic programming becomes of a major interest in several
programming paradigms. A recurrent idea to achieve genericity is to abstract
computations from their representative data structures... / and functors from the category theory As an example let us br languages. Mathematical Systems Theory - June .
Expressiveness Revisited - Areces, de Rijke (1998)(Correct)
Appeared in Proceedings of DL'98.
We consider two recently proposed definitions
of the expressive power of description
logics, one due to Baader, the other due
to Kurtonina and de Rijke. The proposals... / accepted unifying background theory and as a consequence it often br formal syntax and semantics model theory etc.or just a tool or
Rotational Polygon Overlap Minimization and Compaction - Victor Milenkovic (1998)(Correct)
An effective and fast algorithm is given for rotational overlap minimization: given
an overlapping layout of polygons P 1 ; P 2 ; P 3 ; : : : ; P k in a container polygon Q, translate
and rotate the p... / appear in Computational Geometry Theory and Applications special issue br a layout. Both in practice and in theory minimum enclosure is a highly
A Fast Transform for Spherical Harmonics - Mohlenkamp (1998)(Correct)
Spherical Harmonics arise on the sphere S
2
in the same way that the (Fourier) exponential functions
fe
ik`
g k2Z arise on the circle. Spherical Harmonic series have many of the same wonderful pr... / type of Quasi-Classical WKB theory for solutions to Schrodinger br Given a space localization this theory gives us rigorous bounds on the
Downward Collapse from a Weaker Hypothesis - Hemaspaandra, Hemaspaandra, Hempel (1998)(Correct)
Hemaspaandra et al. [1] proved that, for m ? 0 and 0 ! i ! k \Gamma 1:
if \Sigma
p
i \DeltaDIFF m (\Sigma
p
k ) is closed under complementation, then DIFFm (\Sigma
p
k ) =
coDIFFm (\Sigma
p
k ). T... / and Preliminaries In complexity theory countless cases are known in br at www.cs.rochester.edu trs theory-trs.html. A. Meyer and L.
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
Coding for Computing - Orlitsky, Roche (1998)(Correct)
A sender communicates with a receiver who wishes to reliably evaluate a function of their
combined data. We show that if only the sender can transmit, the number of bits required is a
conditional entr... / IEEE Transactions on Information Theory. This version was printed on June br underlies many an information-theory result. Formally the empirical
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
Ramifications and Sufficient Causes - Grünwald (1998)(Correct)
Most `causal' approaches to reasoning about action have not addressed the basic question
of causality: what has to be the case in the world in order for the assertion `A causes
B' to be valid? Pearl'... / represented in it. The resulting theory turns out to be a powerful tool br be explained in section Pearl's theory as such cannot be directly applied
Perfectly One-Way Probabilistic Hash Functions - Canetti, Micciancio, Reingold (1998)(Correct)
Probabilistic hash functions that hide all partial information on their input were recently
introduced. This new cryptographic primitive can be regarded as a function that offers "perfect
one-wayness"... / DABT - -C- . Email miccianc theory.lcs.mit.edu z Dept. of br some definitions from probability theory and review the technical tools we
Computing the relative entropy between regular tree languages - Calera-Rubio, Carrasco (1998)(Correct)
Stochastic grammars provide a formal background in order to deal with tasks where
a random source of structured data is involved. In particular, stochastic tree grammars
can be useful if hierarchical ... / words Formal languages Automata theory Inductive learning. br A.V. Aho and J.D. Ullman The theory of parsing translation and
Quantum dots - Yngvason (1998)(Correct)
Introduction
Modern semiconductor technology has in recent years made it possible to fabricate
ultrasmall structures that confine electrons on scales comparable to their de
Broglie wavelength. If the... / extensive physics literature on the theory of quantum dots but an annotated br expect that a Thomas-Fermi theory captures the leading
The Number-Theoretical Spin Chain and the Riemann Zeroes - Knauf (1998)(Correct)
It is an empirical observation that the Riemann zeta function can
be well approximated in its critical strip using the Number-Theoretical
Spin Chain. A proof of this would imply the Riemann Hypothesis... / to the Lewis Equation of modular theory. Introduction The Euler br from the point of view of number theory the most important point seems to
Visual Recognition using Local Appearance - de Verdière, Crowley (1998)(Correct)
This paper presents a technique for visual recognition in
which physical objects are represented by families of surfaces in a local
appearance space. An orthogonal family of local appearance descrip... / this approach. A pure information theory model suggests making an inner br Specifically signal processing theory shows that . . .
Value Efficiency Analysis for Incorporating Preference. . . - Halme, Joro, al. (1998)(Correct)
We develop a procedure and the requisite theory for incorporating preference
information in a novel way in the efficiency analysis of Decision Making Units. The
efficiency of Decision Making Units is ... / a procedure and the requisite theory for incorporating preference br the procedure and the requisite theory for incorporating preference
Information States, Attitudes and Dependent Record Types - Cooper (1998)(Correct)
this paper, I shall first present an account of records and record types and then build in some
situation theoretic notions. I shall then give an account of static and dynamic meaning and
the relation... / of researchers applying type theory to natural language there have br proposals to use contexts from type theory to model information states and to
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
A Multi-Commodity Market Approach to Power Load Management - Ygge, Akkermans, Andersson (1998)(Correct)
Power load management is the concept of controlling the loads at the demand side in order to run energy systems more efficiently. Energy systems are inherently highly distributed and contain large num... / as follows. In Section some theory on the relations between op- br fi nally Section concludes. Theory for Applying Markets to
Separating Complexity Classes using Autoreducibility - Buhrman, Fortnow, van Melkebeek.. (1998)(Correct)
A set is autoreducible if it can be reduced to itself by a Turing machine that does not
ask its own input to the oracle. We use autoreducibility to separate the polynomial-time hierarchy
from exponent... / Post's Program to complexity theory. We feel such techniques may prove br in the early days of computability theory Post wanted to show that the
Towards a DNA Solution to the Shortest Common Superstring Problem - Gloor, Kari, Gaasenbeek, Yu (1998)(Correct)
This paper proposes a DNA algorithm for solving an
NP-complete problem (The Shortest Common Superstring
Problem) by manipulation of biomolecules, and
presents partial results of the experiment that im... / For further formal language theory notions and notations the reader br and intractability a guide to the theory of NP-completeness. Freeman and
The Geometry of Wulff Crystal Shapes and Its Relations with Riemann.. - Danping Peng (1998)(Correct)
In this paper we begin to explore the mathematical connection between equilibrium
shapes of crystalline materials (Wulff shapes) and shock wave structures in compressible
gas dynamics (Riemann problem... / using formulas and methods from the theory of Riemann problems. For clarity br Because readers familiar with the theory of Wulff shapes come from a
Sparse Representations for Fast, One-Shot Learning - Yip, Sussman (1998)(Correct)
Humans rapidly and reliably learn many kinds of regularities and generalizations.
We propose a novel model of fast learning that exploits the properties
of sparse representations and the constraints i... / and generalizations. Any learning theory must explain the search and br to say that no previous learning theory can account for the phonological
What is Initiative? - Cohen, Allaby, Cumbaa, Fitzgerald.. (1998)(Correct)
This paper presents some alternate theories for explaining the term "initiative", as it is used in
the design of mixed-initiative AI systems. Although there is now active research in the area of
mixed... / importance of each particular theory for the design of mixed br the circumstances under which each theory can be ideally suited to assist
Bifurcation from Periodic Solutions with Spatiotemporal Symmetry - Lamb, Melbourne (1998)(Correct)
In this paper, we discuss some recent developments in the understanding
of generic bifurcation from periodic solutions with spatiotemporal symmetries.
We focus mainly on the theory for bifurcation fro... / symmetries. We focus mainly on the theory for bifurcation from isolated br Moreover we discuss how our theory justifies certain heuristic
A Multiresolution Strategy for Reduction of Elliptic PDE's and.. - Beylkin, Coult (1998)(Correct)
this paper.
In [3] the multiresolution strategy for reduction and homogenization has been
applied to a system of linear ordinary differential equations. It is observed in [3] that
the transition betwe... / to the classical homogenization theory. In both Gilbert's and Dorobantu's br . T. Kato. Perturbation