Results 71 to 80 of about 11,198,718 (212)
The sparse awakens : streaming algorithms for matching size estimation in sparse graphs [PDF]
Estimating the size of the maximum matching is a canonical problem in graph analysis, and one that has attracted extensive study over a range of different computational models.
Muthukrishnan, S. +3 more
core +1 more source
Faster amortized bootstrapping using the incomplete NTT for free
Amortized bootstrapping techniques have been proposed for FHEW/TFHE to efficiently refresh multiple ciphertexts simultaneously within a polynomial modulus.
Thales B. Paiva +4 more
doaj +1 more source
Cold Boot Attacks on Ring and Module LWE Keys Under the NTT
In this work, we consider the ring- and module- variants of the LWE problem and investigate cold boot attacks on cryptographic schemes based on these problems, wherein an attacker is faced with the problem of recovering a scheme’s secret key from a noisy
Martin R. Albrecht +2 more
doaj +1 more source
Current Status and Challenges in Data Collection for Aerospace Coatings Deposited by Plasma Spraying
An innovative approach has been integrated into the GRENAT project to optimize plasma spraying and coating performance. Raw materials are accelerated and melted in the plasma generated by torches, creating coatings. Monitoring sensors collect process data which are combined with ex situ characterization data.
Lila Randriamananjara +8 more
wiley +1 more source
Efficient algorithms for generalized Stable Marriage and Roommates problems [PDF]
We consider a generalization of the Stable Roommates problem (SR), in which preference lists may be partially ordered and forbidden pairs may be present, denoted by SRPF.
Irving, R.W. +5 more
core +1 more source
A novel workflow for investigating hydride vapor phase epitaxy for GaN bulk crystal growth is proposed. It combines Design of experiments (DoE) with physical simulations of mass transport and crystal growth kinetics, serving as an intermediate step between DoE and experiments.
J. Tomkovič +7 more
wiley +1 more source
Reproduction of stacking fault energy calculations from literature with a semi‐automated large language model‐assisted extraction procedure: extraction of simulation protocol, atomistic structures, computational parameters, and reported results, ontology alignment, knowledge graph construction and, finally, recomputation forvalidation.
Sepideh Baghaee Ravari +5 more
wiley +1 more source
Teaching Complexity and Its Practical Implications in Leadership Development Programs
This article describes an advanced leadership seminar for senior managers and executives. The three module seminar describes how thoughtful leaders can learn to succeed even under conditions of extreme complexity. The first module describes complexity in
Hazy, James K
core +1 more source
Towards efficient private distributed computation on unbounded input streams
In the problem of private “swarm” computing, n agents wish to securely and distributively perform a computation on common inputs, in such a way that even if the entire memory contents of some of them are exposed, no information is revealed about the ...
Dolev Shlomi +4 more
doaj +1 more source
This study applies machine learning regression to predict chromium layer thickness in decorative trivalent chromium electroplating, using 441 experiments from laboratory‐scale (1L) and pilot‐scale (14L) setups. Tree‐based models, particularly CatBoost, outperformed linear regression by capturing nonlinear parameter interactions (R2$R^2$ up to 0.77 ...
Christoph Baumer +4 more
wiley +1 more source

