Results 81 to 90 of about 95,300 (209)
A Subdivision Solver for Systems of Large Dense Polynomials [PDF]
, 2016 We describe here the package {\tt subdivision\\_solver} for the mathematical software {\tt SageMath}. It provides a solver on real numbers for square systems of large dense polynomials.
Imbach, Rémi
core +3 more sources
A revision of the subtract-with-borrow random number generators
, 2017 The most popular and widely used subtract-with-borrow generator, also known as RANLUX, is reimplemented as a linear congruential generator using large integer arithmetic with the modulus size of 576 bits.
Sibidanov, Alexei
core +1 more source
To vary or not to vary: A flexible empirical Bayes factor for testing variance components
British Journal of Mathematical and Statistical Psychology, EarlyView.Abstract Random effects are the gold standard for capturing structural heterogeneity, such as individual differences or temporal dependence. Yet testing their presence is difficult because variance components are constrained to be non‐negative, creating a boundary problem. This paper introduces a flexible empirical Bayes factor (EBF) for testing random
Fabio Vieira, Hongwei Zhao, Joris Mulder
wiley +1 more source
Splatshop: Efficiently Editing Large Gaussian Splat Models
Computer Graphics Forum, EarlyView.Abstract We present Splatshop, a highly optimized toolbox for interactive editing (selection, deletion, painting, transformation, …) of 3D Gaussian Splatting models. Utilizing a comprehensive collection of heuristic approaches, we carefully balance between exact and fast rendering to enable precise editing without sacrificing real‐time performance. Our
Markus Schütz +5 more
wiley +1 more source
Numerical Relativity with Arbitrary Precision Arithmetic: Applications to Gravitational Collapse
, 2018 Revised version.
Santos-Oliván, Daniel +1 more
openaire +2 more sources
Evaluating parametric holonomic sequences using rectangular splitting
, 2013 We adapt the rectangular splitting technique of Paterson and Stockmeyer to the problem of evaluating terms in holonomic sequences that depend on a parameter. This approach allows computing the $n$-th term in a recurrent sequence of suitable type using $O(
Johansson, Fredrik
core +1 more source
Real‐Time Conformal Maps and Parameterizations
Computer Graphics Forum, EarlyView.Abstract We present a simple algorithm to conformally map between two simple and bounded planar domains based on the concept of harmonic measure, which is a conformal invariant. With suitable preprocessing, the algorithm is fast enough to compute all possible conformal maps (having three real degrees of freedom) between the two domains in real time in
Q. Chang, C. Gotsman, K. Hormann
wiley +1 more source
Homomorphic ReLU with Full-Domain Bootstrapping
CryptographyFully homomorphic encryption (FHE) offers a promising solution for privacy-preserving machine learning by enabling arbitrary computations on encrypted data.
Yuqun Lin +7 more
doaj +1 more source
Discontinuities in recurrent neural networks [PDF]
, 1997 This paper studies the computational power of various discontinuous real computational models that are based on the classical analog recurrent neural network (ARNN).
Gavaldà Mestre, Ricard +1 more
core +1 more source
Computational Complexity of Iterated Maps on the Interval (Extended Abstract)
, 2010 The exact computation of orbits of discrete dynamical systems on the interval is considered. Therefore, a multiple-precision floating point approach based on error analysis is chosen and a general algorithm is presented.
Anatole Katok +19 more
core +2 more sources