Results 51 to 60 of about 175,129,583 (297)
An Optimized Twofold LUT architecture for fast function approximation
The efficient approximation of elementary and activation functions is crucial for the deployment of machine learning algorithms and deep learning on resource-constrained hardware like FPGAs.
Ayad M. Dalloo +6 more
doaj +1 more source
Introduction: the methods of representation of functions given approximately by their singular integrals in relation to approximation problems and numerical methods for solving boundary value problems for differential equations are Investigated.
Igor Eduardovich Naats +2 more
doaj
Hybrid Global Search Algorithm with Genetic Blocks for Solving Hexamatrix Games
This work addresses the development of a hybrid approach to solving threeperson polymatrix games (hexamatrix games). On the one hand, this approach is based on the reduction of the game to a nonconvex optimization problem and the Global Search Theory ...
A. V. Orlov
doaj +1 more source
ABSTRACT Introduction Peritoneal dialysis (PD) is an established home‐based kidney replacement therapy (KRT), but its uptake remains low in Japan. We evaluated whether individualized education in a dedicated outpatient clinic was associated with the initiation of PD.
Yasuko Ito +7 more
wiley +1 more source
Strong Inequalities for Hermite-Fejér Interpolations and Characterization of K-Functionals
The works of Smale and Zhou (2003, 2007), Cucker and Smale (2002), and Cucker and Zhou (2007) indicate that approximation operators serve as cores of many machine learning algorithms.
Gongqiang You
doaj +1 more source
Fluorescent probes allow dynamic visualization of phosphoinositides in living cells (left), whereas mass spectrometry provides high‐sensitivity, isomer‐resolved quantitation (right). Their synergistic use captures complementary aspects of lipid signaling. This review illustrates how these approaches reveal the spatiotemporal regulation and quantitative
Hiroaki Kajiho +3 more
wiley +1 more source
Hardness of approximation for orthogonal rectangle packing and covering problems [PDF]
Bansal and Sviridenko [N. Bansal, M. Sviridenko, New approximability and inapproximability results for 2-dimensional bin packing, in: Proceedings of the 15th Annual ACM–SIAM Symposium on Discrete Algorithms, SODA, 2004, pp.
Chlebikova, Janka +4 more
core +1 more source
How to Make Your Approximation Algorithm Private: A Black-Box Differentially-Private Transformation for Tunable Approximation Algorithms of Functions with Low Sensitivity [PDF]
We develop a framework for efficiently transforming certain approximation algorithms into differentially-private variants, in a black-box manner. Specifically, our results focus on algorithms A that output an approximation to a function f of the form $(1-
Blocki, Jeremiah +3 more
core +1 more source
Neural Acceleration of Graph Based Utility Functions for Sparse Matrices
Many graph-based algorithms in high performance computing (HPC) use approximate solutions due to having algorithms that are computationally expensive or serial in nature.
Joshua Dennis Booth, Gregory S. Bolet
doaj +1 more source
Structural insights into an engineered feruloyl esterase with improved MHET degrading properties
A feruloyl esterase was engineered to mimic key features of MHETase, enhancing the degradation of PET oligomers. Structural and computational analysis reveal how a point mutation stabilizes the active site and reshapes the binding cleft, expading substrate scope.
Panagiota Karampa +5 more
wiley +1 more source

