Results 221 to 230 of about 402,561 (332)
Graph Geometric Algebra networks for graph representation learning. [PDF]
Zhong J, Cao W.
europepmc +1 more source
A Learning Model with Memory in the Financial Markets
ABSTRACT Learning is central to a financial agent's aspiration to gain persistent strategic advantage in asset value maximisation. The implicit mechanism that transforms this aspiration into an observed value gain is the speed of error corrections (demonstrating, an agent's speed of learning) whilst facing increased uncertainty.
Shikta Singh +6 more
wiley +1 more source
Beyond Euclid: an illustrated guide to modern machine learning with geometric, topological, and algebraic structures. [PDF]
Papillon M +10 more
europepmc +1 more source
Analysis of image formation in optical palpation
Optical palpation is an emerging elastography technique that generates images of mechanical stress at the tissue surface, with applications in intraoperative cancer detection. Image formation is simulated using finite element analysis and validated with experiments on silicone phantoms, providing an analysis of trends in detectability, feature ...
R. Jones, Q. Fang, B. F. Kennedy
wiley +1 more source
Compatibility of Drinfeld presentations for split affine Kac-Moody quantum symmetric pairs. [PDF]
Li JR, Przeździecki T.
europepmc +1 more source
Parafermionic representation of the affine algebra at fractional level [PDF]
Peter Bowcock, M. Hayes, Anne Taormina
openalex +1 more source
New Difference Triangle Sets by a Field‐Programmable Gate Array‐Based Search Technique
ABSTRACT We provide some difference triangle sets with scopes that improve upon the best known values. These are found with purpose‐built digital circuits realized with field‐programmable gate arrays (FPGAs) rather than software algorithms running on general‐purpose processors.
Mohannad Shehadeh +2 more
wiley +1 more source
Non-commutative L p spaces and Grassmann stochastic analysis. [PDF]
De Vecchi F +3 more
europepmc +1 more source
On the Q $Q$‐Polynomial Property of Bipartite Graphs Admitting a Uniform Structure
ABSTRACT Let Γ ${\rm{\Gamma }}$ denote a finite, connected graph with vertex set X $X$. Fix x ∈ X $x\in X$ and let ε ≥ 3 $\varepsilon \ge 3$ denote the eccentricity of x $x$. For mutually distinct scalars { θ i * } i = 0 ε ${\{{\theta }_{i}^{* }\}}_{i=0}^{\varepsilon }$ define a diagonal matrix A * = A * ( θ 0 * , θ 1 * , … , θ ε * ) ∈ Mat X ( R ) ${A}^
Blas Fernández +3 more
wiley +1 more source

