English
Related papers

Related papers: Deriving Generic Bounds for Time-Series Constraint…

200 papers

Most modern libraries for regular expression matching allow back-references (i.e., repetition operators) that substantially increase expressive power, but also lead to intractability. In order to find a better balance between expressiveness…

Formal Languages and Automata Theory · Computer Science 2018-02-06 Dominik D. Freydenberger , Markus L. Schmid

We consider the setting of component-based design for real-time systems with critical timing constraints. Based on our earlier work, we propose a compositional specification theory for timed automata with I/O distinction, which supports…

Software Engineering · Computer Science 2012-06-21 Chris Chilton , Marta Kwiatkowska , Xu Wang

The aim of this paper is to give a simpler, more usable sufficient condition to the regularity of generic weakly stationary time series. Also, this condition is used to show how regular processes satisfying these sufficient conditions can…

Statistics Theory · Mathematics 2022-11-28 Tamás Szabados

New measures for the quantization of systems with constraints are discussed and applied to several examples, in particular, examples of alternative but equivalent formulations of given first-class constraints, as well as a comparison of…

Quantum Physics · Physics 2007-05-23 John R. Klauder

This paper presents a general framework for the design of linear controllers for linear systems subject to time-domain constraints. The design framework exploits sums-of-squares techniques to incorporate the time-domain constraints on…

Optimization and Control · Mathematics 2012-05-04 W. H. T. M. Aangenent , W. P. M. H. Heemels , M. J. G. Van De Molengraft , Didier Henrion , Maarten Steinbuch

We present a general approach to the problem of determining tight asymptotic lower bounds for generalized central moments of the optimal alignment score of two independent sequences of i.i.d. random variables. At first, these are obtained…

Probability · Mathematics 2016-11-28 Ruoting Gong , Christian Houdré , Jüri Lember

Causal parameters may not be point identified in the presence of unobserved confounding. However, information about non-identified parameters, in the form of bounds, may still be recovered from the observed data in some cases. We develop a…

Methodology · Statistics 2020-07-02 Noam Finkelstein , Ilya Shpitser

Arithmetic constraints on integer intervals are supported in many constraint programming systems. We study here a number of approaches to implement constraint propagation for these constraints. To describe them we introduce integer interval…

Artificial Intelligence · Computer Science 2007-05-23 Krzysztof R. Apt , Peter Zoeteweij

Generative Artificial Intelligence (AI) has rapidly become a powerful tool, capable of generating various types of data, such as images and text. However, despite the significant advancement of generative AI, time series generative AI…

Machine Learning · Computer Science 2025-07-01 Jaeyun Woo , Jiseok Lee , Brian Kenji Iwana

For an arbitrary ideal $I$ in a polynomial ring $R$ we define the notion of initially regular sequences on $R/I$. These sequences share properties with regular sequences. In particular, the length of an initially regular sequence provides a…

Commutative Algebra · Mathematics 2019-07-02 Louiza Fouli , Huy Tai Ha , Susan Morey

In this paper, we propose a general method for testing composite hypotheses. Our idea is to use confidence limits to define stopping and decision rules. The requirements of operating characteristic function can be satisfied by adjusting the…

Statistics Theory · Mathematics 2012-02-10 Xinjia Chen

A temporal logic is presented for reasoning about the correctness of timed concurrent constraint programs. The logic is based on modalities which allow one to specify what a process produces as a reaction to what its environment inputs.…

Logic in Computer Science · Computer Science 2007-05-23 F. S. de Boer , M. Gabbrielli , M. C. Meo

In "Reliable Communication in the Absence of a Common Clock" (Yeung et al., 2009), the authors introduce general run-length sets, which form a class of constrained systems that permit run-lengths from a countably infinite set. For a…

Information Theory · Computer Science 2010-01-14 Georg Böcherer , Rudolf Mathar , Valdemar Cardoso da Rocha Junior , Cecilio Pimentel

We show that global constraints on finite domains like all-different can be reformulated into answer set programs on which we achieve arc, bound or range consistency. These reformulations offer a number of other advantages beyond providing…

Logic in Computer Science · Computer Science 2010-08-31 Christian Drescher , Toby Walsh

Deep nets generalize well despite having more parameters than the number of training samples. Recent works try to give an explanation using PAC-Bayes and Margin-based analyses, but do not as yet result in sample complexity bounds better…

Machine Learning · Computer Science 2018-11-28 Sanjeev Arora , Rong Ge , Behnam Neyshabur , Yi Zhang

Compositional generalization is one of the main properties which differentiates lexical learning in humans from state-of-art neural networks. We propose a general framework for building models that can generalize compositionally using the…

Computation and Language · Computer Science 2024-02-05 Mircea Petrache , Shubhendu Trivedi

For a graph consisting of parallel connected subgraphs we express the characteristic function of the boundary value problem with generalized Neumann conditions at both joining points via characteristic functions of different boundary…

Mathematical Physics · Physics 2015-09-02 Vyacheslav Pivovarchik

A general input-output modelling technique for aperiodic-sampling linear systems has been developed. The procedure describes the dynamics of the system and includes the sequence of sampling periods among the variables to be handled. Some…

Discrete Mathematics · Computer Science 2016-08-14 Amparo Fúster-Sabater , J. M. Guillén

This paper explores the task of translating natural language queries into regular expressions which embody their meaning. In contrast to prior work, the proposed neural model does not utilize domain-specific crafting, learning to translate…

Computation and Language · Computer Science 2016-08-11 Nicholas Locascio , Karthik Narasimhan , Eduardo DeLeon , Nate Kushman , Regina Barzilay

Time series interpretation aims to provide an explanation of what is observed in terms of its underlying processes. The present work is based on the assumption that the common classification-based approaches to time series interpretation…

Artificial Intelligence · Computer Science 2021-12-09 Tomás Teijeiro , Paulo Félix
‹ Prev 1 4 5 6 7 8 10 Next ›