English
Related papers

Related papers: State Space Realization Theorems For Data Mining

200 papers

Humans engage in informal debates on a daily basis. By expressing their opinions and ideas in an argumentative fashion, they are able to gain a deeper understanding of a given problem and in some cases, find the best possible course of…

Logic in Computer Science · Computer Science 2019-12-13 Ria Jha , Francesco Belardinelli , Francesca Toni

This paper proposes a new category theoretic account of equationally axiomatizable classes of algebras. Our approach is well-suited for the treatment of algebras equipped with additional computationally relevant structure, such as ordered…

Logic in Computer Science · Computer Science 2019-02-05 Stefan Milius , Henning Urbat

We survey facts mostly emerging from the seminal results of Alan Cobham obtained in the late sixties and early seventies. We do not attempt to be exhaustive but try instead to give some personal interpretations and some research directions.…

Formal Languages and Automata Theory · Computer Science 2012-04-27 Michel Rigo

LF is a dependent type theory in which many other formal systems can be conveniently embedded. However, correct use of LF relies on nontrivial metatheoretic developments such as proofs of correctness of decision procedures for LF's…

Logic in Computer Science · Computer Science 2010-05-04 Christian Urban , James Cheney , Stefan Berghofer

Scientific knowledge expands by observing the world, hypothesizing some theories about it, and testing them against collected data. When those theories take the form of statistical models, statistical analyses are involved in the process of…

Machine Learning · Statistics 2026-03-11 Arnaud Delaunoy

Stochastic processes defined on integer valued state spaces are popular within the physical and biological sciences. These models are necessary for capturing the dynamics of small systems where the individual nature of the populations…

Machine Learning · Statistics 2024-04-15 Luke O'Loughlin , John Maclean , Andrew Black

This paper is devoted to constructing and studying exactly solvable dynamical systems in discrete time obtained from some algebraic operations on matrices, to reductions of such systems leading to classical field theory models in…

solv-int · Physics 2008-02-03 I. G. Korepanov

Ontological models are attempts to quantitatively describe the results of a probabilistic theory, such as Quantum Mechanics, in a framework exhibiting an explicit realism-based underpinning. Unlike either the well known quasi-probability…

Quantum Physics · Physics 2008-07-02 Nicholas Harrigan , Terry Rudolph , Scott Aaronson

Our predictions for particle physics processes are realized in a chain of complex simulators. They allow us to generate high-fidelity simulated data, but they are not well-suited for inference on the theory parameters with observed data. We…

High Energy Physics - Phenomenology · Physics 2020-11-03 Johann Brehmer , Kyle Cranmer

This work explores the in-context learning capabilities of State Space Models (SSMs) and presents, to the best of our knowledge, the first theoretical explanation of a possible underlying mechanism. We introduce a novel weight construction…

Machine Learning · Computer Science 2025-08-05 Federico Arangath Joseph , Kilian Konstantin Haefeli , Noah Liniger , Caglar Gulcehre

Probabilistic Answer Set Programming under the credal semantics (PASP) extends Answer Set Programming with probabilistic facts that represent uncertain information. The probabilistic facts are discrete with Bernoulli distributions. However,…

Artificial Intelligence · Computer Science 2025-02-19 Damiano Azzolini , Fabrizio Riguzzi

In recent years, there has been an increased need for the use of active systems - systems required to act automatically based on events, or changes in the environment. Such systems span many areas, from active databases to applications that…

Artificial Intelligence · Computer Science 2012-07-09 Segev Wasserkrug , Avigdor Gal , Opher Etzion

We show that including degrees of a particular kind of provability in the search target for any theorem-prover in sufficiently powerful formal systems over finite-sized statements preserves well-definition and a sufficient consistency while…

Logic · Mathematics 2024-11-28 Rohan Bahl

As the twin movements of open science and open source bring an ever greater share of the scientific process into the digital realm, new opportunities arise for the meta-scientific study of science itself, including of data science and…

Statistics Theory · Mathematics 2020-06-17 Evan Patterson

We give an exposition of Natural Topology (NToP), which highlights its advantages for exact computation. The NToP-definition of the real numbers (and continuous real functions) matches recent expert recommendations for exact real…

General Topology · Mathematics 2018-06-06 Frank Waaldijk

Three numerical coverage metrics for the symbolic simulation of dense-time systems and their estimation methods are presented. Special techniques to derive numerical estimations of dense-time state-spaces have also been developed.…

Software Engineering · Computer Science 2007-05-23 Farn Wang , Geng-Dian Hwang , Fang Yu

This article is an exploratory account of the the non-monotonic behaviour of conceptual associations in the light of context. Computational approximations of conceptual space are furnished by semantic space models which are emerging from…

Quantum Physics · Physics 2007-05-23 P. D. Bruza , R. J. Cole

The usual Laurent expansion of the analytic tensors on the complex plane is generalized to any closed and orientable Riemann surface represented as an affine algebraic curve. As an application, the operator formalism for the $b-c$ systems…

High Energy Physics - Theory · Physics 2015-06-26 F. Ferrari , J. Sobczyk

It is shown how, given a "probability data table" for a quantum or classical system, the representation of states and measurement outcomes as vectors in a real vector space follows in a natural way. Some properties of the resulting sets of…

Quantum Physics · Physics 2007-05-23 Piero G. L. Mana

With the help of the Internet, social networks have grown rapidly. This has increased security requirements. We present a formalization of social networks as composite behavioral objects, defined using the Observational Transition System…

Logic in Computer Science · Computer Science 2011-07-01 Katerina Ksystra , Konstantinos Barlas , Nikolaos Triantafyllou , Petros Stefaneas
‹ Prev 1 4 5 6 7 8 10 Next ›