English
Related papers

Related papers: A New Algorithm for Evaluating Determinants -- The…

200 papers

It is shown how the dimension of any arbitrary over-determined system of differential equations can be reduced, which makes the system suitable for numerical solution modeling. Specifically, over-determined equations of hydrodynamics are…

Mathematical Physics · Physics 2013-02-26 Maxim Zaytsev , Vyacheslav Akkerman

Creating test collections for offline retrieval evaluation requires human effort to judge documents' relevance. This expensive activity motivated much work in developing methods for constructing benchmarks with fewer assessment costs. In…

Information Retrieval · Computer Science 2023-08-29 David Otero , Javier Parapar , Nicola Ferro

We investigate the value of extending the completeness of a decision model along different dimensions of refinement. Specifically, we analyze the expected value of quantitative, conceptual, and structural refinement of decision models. We…

Artificial Intelligence · Computer Science 2013-03-08 Kim-Leng Poh , Eric J. Horvitz

A method for selecting solution constructors in narrowing is presented. The method is based on a sort discipline that describes regular sets of ground constructor terms as sorts. It is extended to cope with regular sets of ground…

Formal Languages and Automata Theory · Computer Science 2019-04-19 Jochen Burghardt

We describe a novel constructive technique for devising efficient first-order methods for a wide range of large-scale convex minimization settings, including smooth, non-smooth, and strongly convex minimization. The technique builds upon a…

Optimization and Control · Mathematics 2019-06-27 Yoel Drori , Adrien B. Taylor

A constructive approach to get the reduced row echelon form of a given matrix $A$ is presented. It has been shown that after the $k$th step of the Gauss-Jordan procedure, each entry $a^k_{ij}(i<>j; j > k)$ in the new matrix $A^k$ can always…

Symbolic Computation · Computer Science 2009-07-30 Yi Li

We introduce a new logic that combines Adjoint Logic with Graded Necessity Modalities. This results in a very expressive system capable of controlling when and how structural rules are used. We give a sequent calculus, natural deduction,…

Logic in Computer Science · Computer Science 2020-06-17 Harley Eades , Dominic Orchard

The classification of complex data usually requires the composition of processing steps. Here, a major challenge is the selection of optimal algorithms for preprocessing and classification (including parameterizations). Nowadays, parts of…

Machine Learning · Computer Science 2018-01-17 Mario Michael Krell

In deduction modulo, a theory is not represented by a set of axioms but by a congruence on propositions modulo which the inference rules of standard deductive systems---such as for instance natural deduction---are applied. Therefore, the…

Logic in Computer Science · Computer Science 2019-03-14 Guillaume Burel

We develop new polynomial methods for studying systems of word equations. We use them to improve some earlier results and to analyze how sizes of systems of word equations satisfying certain independence properties depend on the lengths of…

Formal Languages and Automata Theory · Computer Science 2011-08-19 Aleksi Saarela

Computing the determinant of a matrix with the univariate and multivariate polynomial entries arises frequently in the scientific computing and engineering fields. In this paper, an effective algorithm is presented for computing the…

Symbolic Computation · Computer Science 2015-04-14 Xiaolin Qin , Zhi Sun , Tuo Leng , Yong Feng

We present a system for generating parsers based directly on the metaphor of parsing as deduction. Parsing algorithms can be represented directly as deduction systems, and a single deduction engine can interpret such deduction systems so as…

cmp-lg · Computer Science 2008-02-03 Stuart M. Shieber , Yves Schabes , Fernando C. N. Pereira

Sufficient dimension reduction methods often require stringent conditions on the joint distribution of the predictor, or, when such conditions are not satisfied, rely on marginal transformation or reweighting to fulfill them approximately.…

Statistics Theory · Mathematics 2009-04-27 Bing Li , Yuexiao Dong

We describe a strategy-based approach to teaching natural deduction using a notation that emphasises the order in which deductions are constructed, together with a {\LaTeX} package and Java app to aid in the production of teaching resources…

Computers and Society · Computer Science 2015-07-15 Jeremy Seligman , Declan Thompson

We discuss the recently developed method of refined absorption and how it is used to provide a new proof of the Existence Conjecture for combinatorial designs. This method can also be applied to resolve open problems in extremal and…

Combinatorics · Mathematics 2025-10-24 Luke Postle

We propose a method for variable selection in discriminant analysis with mixed categorical and continuous variables. This method is based on a criterion that permits to reduce the variable selection problem to a problem of estimating…

Statistics Theory · Mathematics 2017-03-14 Alban Mbina Mbina , Guy Martial Nkiet , Fulgence Eyi Obiang

Dodgson's method of computing determinants was recently revisited in a paper that appeared in the College Math Journal. The method is attractive, but fails if an interior entry of an intermediate matrix has the value zero. This paper…

Combinatorics · Mathematics 2011-05-20 Deanna Leggett , John Perry , Eve Torrence

We present a simple and accessible method which uses contour integration methods to derive formulae for functional determinants. To make the presentation as clear as possible, the general idea is first illustrated on the simplest case: a…

Mathematical Physics · Physics 2008-11-26 Klaus Kirsten , Alan McKane

We focus here on a class of fourth-order parabolic equations that can be written as a system of second-order equations by introducing an auxiliary variable. We design a novel second-order fully discrete mixed finite element method to…

Numerical Analysis · Mathematics 2020-08-28 Sana Keita , Abdelaziz Beljadid , Yves Bourgault

We describe a new method of finding interpolants for classical logic using certain refutation system as a starting point. Refutation can be thought of as an alternative approach to the analysis of formal systems: instead of focusing on…

Logic in Computer Science · Computer Science 2026-03-18 Adam Trybus , Karolina Rożko , Tomasz Skura