Results 71 to 80 of about 67,589 (200)

An extension of the basic local independence model to multiple observed classifications

British Journal of Mathematical and Statistical Psychology, EarlyView.
Abstract The basic local independence model (BLIM) is appropriate in situations where populations do not differ in the probabilities of the knowledge states and the probabilities of careless errors and lucky guesses of the items. In some situations, this is not the case. This work introduces the multiple observed classification local independence model
Pasquale Anselmi, Debora de Chiusole, Egidio Robusto, Alice Bacherini, Giulia Balboni, Andrea Brancaccio, Ottavia M. Epifania, Noemi Mazzoni, Luca Stefanutti   +8 more
wiley   +1 more source

USING RATIONAL NUMBERS AND PARALLEL COMPUTING TO EFFICIENTLY AVOID ROUND-OFF ERRORS ON MAP SIMPLIFICATION

Revista Brasileira de Cartografia, 2018
This paper presents EPLSimp, an algorithm for map generalization that avoids the creation of topological inconsistencies. EPLSimp is based on Visvalingam-Whyatt's (VW) algorithm on which least "important" points are removed first.
Maurício G. Gruppi, Salles V. G. de Magalhães, Marcus V. A. Andrade, W. Randolph Franklin, Wenli Li   +4 more
doaj  

Extended precision software packages [PDF]

A description of three extended precision packages is presented along with three small conversion subroutines which can be used in conjunction with the extended precision packages. These extended packages represent software packages written in FORTRAN 4.
Phillips, E. J.
core   +1 more source

Development and verification of arbitrary-precision integer arithmetic libraries

, 2020
Arbitrary-precision integer arithmetic algorithms are used in contexts where both their performance and their correctness are critical, such as cryptographic software or computer algebra systems. GMP is a very widely-used arbitrary-precision integer arithmetic library.
openaire   +2 more sources

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, Christoph Peters, Florian Hahlbohm, Elmar Eisemann, Marcus Magnor, Michael Wimmer   +5 more
wiley   +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, Christoph Spandl, G"otz Alefeld, Helmut Ratschek, IEEE 1987, James H. Wilkinson, Jens Blanck, Jens Blanck, Klaus Weihrauch, Laurent Fousse, Morris W. Hirsch, N. Revol, Ning Zhong, Norbert Th. Müller, Norbert Th. Müller, Pierre Collet, Pierre Collet, Robert L. Devaney, Vasco Brattka, Xizhong Zheng   +19 more
core   +2 more sources

Numerical Relativity with Arbitrary Precision Arithmetic: Applications to Gravitational Collapse

, 2018
Revised version.
Santos-Oliván, Daniel, Sopuerta, Carlos F.   +1 more
openaire   +2 more sources

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

Cryptography
Fully homomorphic encryption (FHE) offers a promising solution for privacy-preserving machine learning by enabling arbitrary computations on encrypted data.
Yuqun Lin, Yi Huang, Xiaomeng Tang, Jingjing Fan, Qifei Xu, Zoe-Lin Jiang, Xiaosong Zhang, Junbin Fang   +7 more
doaj   +1 more source