English
Related papers

Related papers: Parallel Replacement in Finite State Calculus

200 papers

Incremental computation aims to compute more efficiently on changed input by reusing previously computed results. We give a high-level overview of works on incremental computation, and highlight the essence underlying all of them, which we…

Programming Languages · Computer Science 2025-10-15 Yanhong A. Liu

Although reasoning about equations over strings has been extensively studied for several decades, little research has been done for equational reasoning on general clauses over strings. This paper introduces a new superposition calculus…

Logic in Computer Science · Computer Science 2025-03-12 Dohan Kim

Substitutions play a crucial role in a wide range of contexts, from analyzing the dynamics of social opinions and conducting mathematical computations to engaging in game-theoretical analysis. For many situations, considering one-step…

Logic · Mathematics 2025-08-01 Yaxin Tu , Sujata Ghosh , Fenrong Liu , Dazhu Li

We study the succinctness of the complement and intersection of regular expressions. In particular, we show that when constructing a regular expression defining the complement of a given regular expression, a double exponential size…

Computational Complexity · Computer Science 2008-02-21 Wouter Gelade , Frank Neven

A parallel splitting method is proposed for solving systems of coupled monotone inclusions in Hilbert spaces. Convergence is established for a wide class of coupling schemes. Unlike classical alternating algorithms, which are limited to two…

Optimization and Control · Mathematics 2009-02-26 H. Attouch , L. M. Briceno-Arias , P. L. Combettes

A parallel algorithm for computing the finite difference solution to the elliptic equations with non-separable variables is presented. The resultant matrix is symmetric positive definite, thus the preconditioning conjugate gradient or the…

Numerical Analysis · Mathematics 2015-03-13 Andrew V. Terekhov

In this paper a novel hybrid approach for compensating the distortion of any interpolation has been proposed. In this hybrid method, a modular approach was incorporated in an iterative fashion. By using this approach we can get drastic…

Multimedia · Computer Science 2010-09-21 A. ParandehGheibi , M. A. Akhaee , A. Ayremlou , M. A. Rahimian , F. Marvasti

We prove completeness, interpolation, decidability and an omitting types theorem for certain multi dimensional modal logics where the states are not abstract entities but have an inner structure. The states will be sequences. Our approach…

Logic · Mathematics 2013-02-14 Tarek Sayed Ahmed , Mohammad Assem

The standard formulation of Quantum Mechanics violates locality of interactions and the action reaction principle. An alternative formulation in an extended phase space could preserve both principles, but Bell's theorems show that a…

Quantum Physics · Physics 2015-09-24 C. Lopez

Recurrent neural networks are convenient and efficient models for language modeling. However, when applied on the level of characters instead of words, they suffer from several problems. In order to successfully model long-term…

Machine Learning · Computer Science 2015-11-25 Piotr Bojanowski , Armand Joulin , Tomas Mikolov

This paper introduces the multiplicative variant of the recently proposed asynchronous additive coarse-space correction method. Definition of an asynchronous extension of multiplicative correction is not straightforward, however, our…

Numerical Analysis · Mathematics 2023-12-20 Guillaume Gbikpi-Benissan , Frédéric Magoulès

In this talk I review some recent results concerning multi-instanton calculus in supersymmetric field theories. More in detail, I will show how these computations can be efficiently performed using the formalism of topological field…

High Energy Physics - Theory · Physics 2007-05-23 F. Fucito

Over the past few years, self-attention is shining in the field of deep learning, especially in the domain of natural language processing(NLP). Its impressive effectiveness, along with ubiquitous implementations, have aroused our interest…

Machine Learning · Computer Science 2020-12-03 Mingfei Yu , Masahiro Fujita

We propose an optical parallel computation similar to quantum computation that can be realized by introducing pseudorandom phase sequences into classical optical fields with two orthogonal modes. Based on the pseudorandom phase sequences,…

General Physics · Physics 2017-02-24 Jian Fu

We address the problem of analysing the complexity of concurrent programs written in Pi-calculus. We are interested in parallel complexity, or span, understood as the execution time in a model with maximal parallelism. A type system for…

Computational Complexity · Computer Science 2021-10-20 Patrick Baillot , Alexis Ghyselen , Naoki Kobayashi

Sufficient conditions for performing changes of the variable of integration when using the new definitions of improper integrals given in in "An Alternative Definition for Improper Integral with Infinite Limit" (arXiv:0805.3559v1) and "An…

Classical Analysis and ODEs · Mathematics 2009-02-02 Michael A. Blischke

We propose dual regression as an alternative to the quantile regression process for the global estimation of conditional distribution functions under minimal assumptions. Dual regression provides all the interpretational power of the…

Methodology · Statistics 2018-09-26 Richard Spady , Sami Stouli

Simultaneous state and parameter estimation arises from various applicational areas but presents a major computational challenge. Most available Markov chain or sequential Monte Carlo techniques are applicable to relatively low dimensional…

Numerical Analysis · Mathematics 2017-09-28 Angwenyi David , Jana de Wiljes , Sebastian Reich

The substitution lemma is a renowned theorem within the realm of lambda-calculus theory and concerns the interactional behaviour of the metasubstitution operation. In this work, we augment the lambda-calculus's grammar with an uninterpreted…

Logic in Computer Science · Computer Science 2023-09-26 Maria J. D. Lima , Flávio L. C. de Moura

Parametric linear programming is a central operation for polyhedral computations, as well as in certain control applications.Here we propose a task-based scheme for parallelizing it, with quasi-linear speedup over large problems.This type…

Computational Geometry · Computer Science 2020-10-01 Camille Coti , David Monniaux , Hang Yu