English
Related papers

Related papers: A new approach to Sheppard's corrections

200 papers

We extend the {\lambda}-calculus with constructs suitable for relational and functional-logic programming: non-deterministic choice, fresh variable introduction, and unification of expressions. In order to be able to unify…

Programming Languages · Computer Science 2021-03-02 Pablo Barenbaum , Federico Lochbaum , Mariana Milicich

Consider a rational family of planar rational curves in a certain region of interest. We are interested in finding an approximation to the implicit representation of the envelope. Since exact implicitization methods tend to be very costly,…

Numerical Analysis · Mathematics 2017-07-06 Oliver J D Barrowclough , Bert Jüttler , Tino Schulz

In this paper we present a new compact expression of the elliptic genus of SL(2)/U(1)-supercoset theory by making use of the `spectral flow method' of the path-integral evaluation. This new expression is written in a form like a Poincare…

High Energy Physics - Theory · Physics 2015-06-22 Tohru Eguchi , Yuji Sugawara

Many computer vision problems can be formulated as binary quadratic programs (BQPs). Two classic relaxation methods are widely used for solving BQPs, namely, spectral methods and semidefinite programming (SDP), each with their own…

Computer Vision and Pattern Recognition · Computer Science 2016-11-18 Peng Wang , Chunhua Shen , Anton van den Hengel

We introduce a functional calculus with simple syntax and operational semantics in which the calculi introduced so far in the Curry-Howard correspondence for Classical Logic can be faithfully encoded. Our calculus enjoys confluence without…

Logic in Computer Science · Computer Science 2013-04-01 Alberto Carraro , Thomas Ehrhard , Antonino Salibra

Variables are separated in Maxwell equations by the Newman-Penrose method of isotropic complex tetrade in the uniformly accelerated spherical coordinate system. Particular solutions are obtained in terms of spin 1 spherical harmonics. PACS:…

Classical Physics · Physics 2008-02-03 Z. Ya Turakulov

We introduce a novel formulation for geometry on discrete points. It is based on a universal differential calculus, which gives a geometric description of a discrete set by the algebra of functions. We expand this mathematical framework so…

Mathematical Physics · Physics 2020-02-11 Yuuya Takayama

The reference links to the modern classical umbral calculus before that known as blissardian symbolic method are numerous. Rota founded and then extended finite operator calculus has links to references which are plenty numerous. The…

Combinatorics · Mathematics 2008-02-11 A. K. Kwasniewski

In the present paper we derive complicated families of orthogonal polynomials in one variable from scratch using the known ones as building blocks. We recall the basics of operational formalism and introduce the notations we use throughout…

Number Theory · Mathematics 2026-01-14 Danil Krotkov

On the topic of probabilistic rewriting, there are several works studying both termination and confluence of different systems. While working with a lambda calculus modelling quantum computation, we found a system with probabilistic…

Logic in Computer Science · Computer Science 2022-04-11 Rafael Romero , Alejandro Díaz-Caro

Modified estimators for the contribution rates of population eigenvalues are given under an elliptically contoured distribution. These estimators decrease the bias of the classical estimator, i.e. the sample contribution rates. The…

Statistics Theory · Mathematics 2012-03-22 Yo Sheena

We deliver a call to arms for probabilistic numerical methods: algorithms for numerical tasks, including linear algebra, integration, optimization and solving differential equations, that return uncertainties in their calculations. Such…

Numerical Analysis · Mathematics 2016-02-17 Philipp Hennig , Michael A Osborne , Mark Girolami

We provide a proof of strong normalisation for lambda+, a recently introduced, explicitly typed, non-deterministic lambda-calculus where isomorphic propositions are identified. Such a proof is a non-trivial adaptation of the reducibility…

Logic in Computer Science · Computer Science 2014-01-09 Alejandro Díaz-Caro , Gilles Dowek

There is increasing interest within the research community in the design and use of recursive probability models. Although there still remains concern about computational complexity costs and the fact that computing exact solutions can be…

Artificial Intelligence · Computer Science 2013-01-14 Daniel Pless , George Luger

We consider a new splitting based on the Sherman-Morrison-Woodbury formula, which is particularly effective with iterative methods for the numerical solution of large linear systems. These systems involve matrices that are perturbations of…

Numerical Analysis · Mathematics 2023-10-17 Dimitrios Mitsotakis

Discrete probability laws underpin statistical modeling, yet the catalog of interpretable distributions has expanded only gradually through centuries of case-by-case mathematical derivations. We introduce symbolic density estimation (SDE),…

Machine Learning · Computer Science 2026-05-25 Ziwen Liu , Meng Li

In this paper we consider a variety of procedures for numerical statistical inference in the family of univariate and multivariate stable distributions. In connection with univariate distributions (i) we provide approximations by finite…

Computation · Statistics 2012-09-04 Efthymios G. Tsionas

The operad of moulds is realized in terms of an operational calculus of formal integrals (continuous formal power series). This leads to many simplifications and to the discovery of various suboperads. In particular, we prove a conjecture…

Quantum Algebra · Mathematics 2007-10-18 Frédéric Chapoton , Florent Hivert , Jean-Christophe Novelli , Jean-Yves Thibon

For a general formulation of linearised hybrid inverse problems in impedance tomography, the qualitative properties of the solutions are analysed. Using an appropriate scalar pseudo-differential formulation, the problems are shown to permit…

Analysis of PDEs · Mathematics 2017-08-03 Guillaume Bal , Kristoffer Hoffmann , Kim Knudsen

We introduce a Curry-Howard correspondence for a large class of intermediate logics characterized by intuitionistic proofs with non-nested applications of rules for classical disjunctive tautologies (1-depth intermediate proofs). The…

Logic in Computer Science · Computer Science 2020-04-22 Federico Aschieri , Agata Ciabattoni , Francesco A. Genco
‹ Prev 1 4 5 6 7 8 10 Next ›