English
Related papers

Related papers: A Note on a Recent Attempt to Improve the Pin-Fran…

200 papers

This paper provides a theoretical analysis of domain adaptation based on the PAC-Bayesian theory. We propose an improvement of the previous domain adaptation bound obtained by Germain et al. in two ways. We first give another generalization…

Machine Learning · Statistics 2015-01-14 Pascal Germain , Amaury Habrard , Francois Laviolette , Emilie Morvant

Providing compact and understandable counterexamples for violated system properties is an essential task in model checking. Existing works on counterexamples for probabilistic systems so far computed either a large set of system runs or a…

Software Engineering · Computer Science 2016-11-26 Ralf Wimmer , Nils Jansen , Erika Ábrahám , Joost-Pieter Katoen

Several methods are discussed that construct a finite automaton given a context-free grammar, including both methods that lead to subsets and those that lead to supersets of the original context-free language. Some of these methods of…

Computation and Language · Computer Science 2007-05-23 Mark-Jan Nederhof

The idea of the restricted mean has been used to establish a significantly improved version of Markov's inequality that does not require any new assumptions. The result immediately extends on Chebyshev's inequalities and Chernoff's bound.…

Statistics Theory · Mathematics 2023-08-09 Joan del Castillo

We address a specific but recurring problem related to sampled linear systems. In particular, we provide a numerical method for the rigorous verification of constraint satisfaction for linear continuous-time systems between sampling…

Optimization and Control · Mathematics 2016-03-30 Moritz Schulze Darup

A simple bilevel variational problem where the lower level is a variational inequality while the upper level is an optimization problem is studied. We consider an inexact version of the lower problem, which guarantees enough regularity to…

Optimization and Control · Mathematics 2025-10-22 Giancarlo Bigi , Riccardo Tomassini

We present a new learning algorithm for realtime one-counter automata. Our algorithm uses membership and equivalence queries as in Angluin's L* algorithm, as well as counter value queries and partial equivalence queries. In a partial…

Formal Languages and Automata Theory · Computer Science 2024-09-16 Véronique Bruyère , Guillermo A. Pérez , Gaëtan Staquet

By some new recursive algorithms, in this paper, we will give some improvements on Waring's problem.

Combinatorics · Mathematics 2020-02-11 An-Ping Li

We investigate the running sums of some well-known automatic sequences to determine whether they are synchronised.

Number Theory · Mathematics 2024-05-29 Rob Burns

Constraints from clock-comparison experiments on violations of Lorentz and CPT symmetry are investigated in the context of a general Lorentz-violating extension of the standard model. The experimental signals are shown to depend on the…

High Energy Physics - Phenomenology · Physics 2009-09-25 Alan Kostelecky , Charles Lane

The solution of a fine tuning problem is one of the principal motivations of Supersymmetry. However experimental constraints indicate that many Supersymmetric models are also fine tuned (although to a much lesser extent). We review the…

High Energy Physics - Phenomenology · Physics 2015-05-13 Peter Athron , D. J. Miller

Using Singular Rescaling We Prove Some Bifurcation Results. This note Presents short proofs for some Bifurcation results which had been appeared with other authors.

Dynamical Systems · Mathematics 2024-04-16 Ali Taghavi

In this note a two sided bound on the tail probability of sums of independent, and either symmetric or nonnegative, random variables is obtained. We utilize a recent result by Lata{\l}a on bounds on moments of such sums. We also give a new…

Probability · Mathematics 2007-05-23 Paweł Hitczenko , Stephen Montgomery-Smith

In this article we propose a revisitation of the well-known argument principle that may lead to the solution of the Riemann hypothesis. We are looking for collaborators.

General Mathematics · Mathematics 2025-08-08 Guilherme Rocha de Rezende

We study some properties of the coincidence set for the boundary Signorini problem, improving some results from previous works by the second author and collaborators. Among other new results, we show here that the convexity assumption on…

Analysis of PDEs · Mathematics 2019-06-26 Miguel de Benito Delgado , Jesús Ildefonso Díaz

This simple note lays out a few observations which are well known in many ways but may not have been said in quite this way before. The basic idea is that when comparing two different Markov chains it is useful to couple them is such a way…

Probability · Mathematics 2017-11-16 James E. Johndrow , Jonathan C. Mattingly

We give a sketch for an alternative proof of a recent result by J. Tseng.

Number Theory · Mathematics 2009-09-23 Nikolay G. Moshchevitin

We study a variant of the classical membership problem in automata theory, which consists of deciding whether a given input word is accepted by a given automaton. We do so under a different perspective, that is, we consider a dynamic…

Formal Languages and Automata Theory · Computer Science 2020-02-18 Alejandro Grez , Filip Mazowiecki , Michał Pilipczuk , Gabriele Puppis , Cristian Riveros

It is the purpose of the present article to collect arguments for, that there should exist in fact -- although not necessarily yet found -- some law, which imply an adjustment to special features to occur in the future. In our own "complex…

General Physics · Physics 2015-03-31 Holger Bech Nielsen

In this paper we are concerned with a two-penalty boundary obstacle problem of interest in thermics, fluid dynamics and electricity. Specifically, we prove existence, uniqueness and optimal regularity of the solutions, and we establish…

Analysis of PDEs · Mathematics 2020-08-17 Donatella Danielli , Rohit Jain
‹ Prev 1 3 4 5 6 7 10 Next ›