Results 151 to 160 of about 31,249 (277)
REPLACING RECURSION WITH ITERATION
, 2008 Recursion is often used for elegant specification of algorithms. We are looking for methods to replace the recursion with iteration, to make them more suitable for analysis, parallelisation and optimization. Given the limited length of this abstract, not
Stefaan Himpe +2 more
core
The fundamental theorem of asset pricing with and without transaction costs
Mathematical Finance, Volume 35, Issue 2, Page 567-609, April 2025.Abstract We prove a version of the fundamental theorem of asset pricing (FTAP) in continuous time that is based on the strict no‐arbitrage condition and that is applicable to both frictionless markets and markets with proportional transaction costs. We consider a market with a single risky asset whose ask price process is higher than or equal to its ...
Christoph Kühn
wiley +1 more source
, 1999 Recursion schemes are familiar in the theory of soliton equations, e.g., in the discussion of infinite hierarchies of conservation laws for such equations. Here we develop a variety of special topics related to curves and curve evolution in two and three-
Joel Langer
core
How feedback works in practice: Insights from a rapid realist review
Medical Education, EarlyView.Abstract Background Feedback is essential in health professions education, yet its diversity makes it difficult to study and theorize beyond specific instances. Building on their prior theoretical framing of feedback, the authors undertook a focused pattern informed realist exploration of how it might work, for whom, and under what circumstances, in ...
Catherine Patocka +3 more
wiley +1 more source
Scalar- v.s. vector-recursion for BSS-recursive functions
, 2002 As in the classical Turing framework, the set of functions that are computable by BSS-machines can also be described as the closure of a set of basic functions by four rules: composition, juxtaposition, recursion, and minimalization [BSS]. In this talk,
Troestler, Christophe
core +1 more source
MoR-Swin: Efficient Vision Transformer Using Mixture of Recursions. [PDF]
J ImagingAi Y, Gao T, Lin Z, Yang L, Chang Q.
europepmc +1 more source
Scandinavian Journal of Statistics, EarlyView.ABSTRACT Two major tasks in applications of hidden Markov models are to (i) compute distributions of summary statistics of the hidden state sequence, and (ii) decode the hidden state sequence. We describe finite Markov chain imbedding (FMCI) and hybrid decoding to solve each of these two tasks.
Zenia Elise Damgaard Bæk +3 more
wiley +1 more source
Resonance transformations for the ( 2 , 2 p + 1 ) minimal string via x - y swap: a proof of Artemev's conjecture. [PDF]
Lett Math PhysDekinga K, Shadrin S, Verlinde E.
europepmc +1 more source