paper-with-me

Papers

Constructing Dampened LTI Systems Generating Polynomial Bases

2021-02-26 · Andreas Stöckel

We present an alternative derivation of the LTI system underlying the Legendre Delay Network (LDN). To this end, we first construct an LTI system that generates the Legendre polynomials. We then dampen the system by approximating a windowed impulse response, using what we call a "delay re-encoder". The resulting LTI system is equivalent to the LDN system. This technique can be applied to arbitrary polynomial bases, although there typically is no closed-form equation that describes the state-transition matrix.

📄 PDF Abstract BibTeX arXiv:2103.00051

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Kutato: An Entropy-Driven System for Construction of Probabilistic Expert Systems from Databases

2013-03-27 · Edward H. Herskovits, Gregory F. Cooper

Kutato is a system that takes as input a database of cases and produces a belief network that captures many of the dependence relations represented by those data. This system incorporates a module for determining the ent…

ARC

Computing Fixpoints of Learned Functions: Chaotic Iteration and Simple Stochastic Games

2026-01-22 · Paolo Baldan, Sebastian Gurke, Barbara König, Florian Wittbold arxiv

The problem of determining the (least) fixpoint of (higher-dimensional) functions over the non-negative reals frequently occurs when dealing with systems endowed with a quantitative semantics. We focus on the situation i…

Well-Conditioned Polynomial Representations for Mathematical Handwriting Recognition

2025-09-13 · Robert M. Corless, Deepak Singh Kalhan, Stephen M. Watt arxiv

Previous work has made use of a parameterized plane curve polynomial representation for mathematical handwriting, with the polynomials represented in a Legendre or Legendre-Sobolev graded basis. This provides a compact g…

Handwriting Recognition

Optimizing Polynomial Graph Filters: A Novel Adaptive Krylov Subspace Approach

2024-03-12 · Keke Huang, Wencai Cao, Hoang Ta, Xiaokui Xiao 외

Graph Neural Networks (GNNs), known as spectral graph filters, find a wide range of applications in web networks. To bypass eigendecomposition, polynomial graph filters are proposed to approximate graph filters by levera…

Beyond Grobner Bases: Basis Selection for Minimal Solvers

2018-06-01 · CVPR 2018 6 · Viktor Larsson, Magnus Oskarsson, Kalle Astrom, Alge Wallis 외

Many computer vision applications require robust estimation of the underlying geometry, in terms of camera motion and 3D structure of the scene. These robust methods often rely on running minimal solvers in a RANSAC fram…