Results 81 to 90 of about 37,491 (303)
When Enzymes Mislead: Assessing the Value of MRCP in Suspected Choledocholithiasis
ANZ Journal of Surgery, EarlyView.ABSTRACT Background The diagnosis of choledocholithiasis (CDL) requires balancing timely intervention against the risks of unnecessary invasive procedures. Although liver function tests (LFTs) are widely used for risk stratification, their static values and short‐term trends remain poorly defined in predicting persistent common bile duct stones.
Renato Pitesa +4 more
wiley +1 more source
LOGIC, PRIMES AND COMPUTATION: A TALE OF UNREST
TASK Quarterly, 2005 The early connections between Mathematical Logic and Computer Science date back to the thirties and to the birth itself of modern Theoretical Computer Science, and concern computability.
STEFANO LEONESI, CARLO TOFFALORI
doaj
Computing Skinning Weights via Convex Duality
Computer Graphics Forum, EarlyView.We present an alternate optimization method to compute bounded biharmonic skinning weights. Our method relies on a dual formulation, which can be optimized with a nonnegative linear least squares setup. Abstract We study the problem of optimising for skinning weights through the lens of convex duality.
J. Solomon, O. Stein
wiley +1 more source
Novel methods for primality testing and factoring
, 2005 From the time of the Greeks, primality testing and factoring have fascinated mathematicians, and for centuries following the Greeks primality testing and factorization were pursued by enthusiasts and professional mathematicians for their intrisic ...
Hammad, Yousef Bani
core
Prime Numbers Test Primality Proof
, 2018 Prime Numbers Test Primality Proof
Alessandro Boatto +1 more
core +1 more source
Volume Quantization with Flexible Singularities for Hexahedral Meshing
Computer Graphics Forum, EarlyView.Abstract We present a novel algorithm for quantization and subsequent hexahedral mesh generation from seamless volumetric maps. Quantization is the process of choosing integers that represent the numbers of hexahedral elements to be placed in each region of the volume, and transforming the seamless map into an integer‐grid map matching that choice ...
H. Brückler, M. Campen
wiley +1 more source
A Note on Monte Carlo Primality Tests and Algorithmic Information Theory
, 1978 Solovay and Strassen, and Miller and Rabin have discovered fast algorithms for testing primality which use coin-flipping and whose conclusions are only probably correct.
Jacob T. Schwartz +2 more
core
Autistic Savants and large number primality detection.
, 2020 In a sequel to the paper on small number primality detection by mental arithmetic. In this paper, we consider primality detection of four digit prime numbers, leading next to larger six digit and eight digit numbers, optionally scaled to arbitrary sized ...
Dr Bheemaiah. Anil K (Anil Kumar B)
core +1 more source
Contouring Signed Distance Fields by Approximating Gradients
Computer Graphics Forum, EarlyView.Abstract Signed distance fields are often represented by discrete samples (e.g., on a grid). Recovering the contour implicitly represented by the distance samples requires an approximation algorithm. Several recent approaches have shown that exploiting the information carried in each distance sample by explicitly constructing a surface point gives ...
M. Kohlbrenner, M. Alexa
wiley +1 more source
Pseudopowers and primality proving
Contributions to Discrete Mathematics, 2007 It has been known since the 1930s that so-called pseudosquares yield a very powerful machinery for the primality testing of large integers N. In fact, assuming reasonable heuristics (which have been confirmed for numbers to 2^80) this gives a deterministic primality test in time O((lg N)^(3+o(1))), which many believe to be best possible. In the 1980s D.
Pedro Berrizbeitia +2 more
openaire +1 more source