Results 161 to 170 of about 522,371 (218)
Some of the next articles are maybe not open access.
An Algorithm for the Automatic Approximate Minimization of Boolean Functions
IEEE Transactions on Computers, 1968Abstract—There are several algorithms that determine directly an irredundant normal form (INF) of a Boolean function without generating the entire set of prime implicants. These algorithms can generate solutions for the minimization problem much more rapidly than the algorithms determining minimum normal forms (MNF), and the cost of these solutions is,
openaire +2 more sources
An improved algorithm for rational approximation of transfer functions
International Journal of Circuit Theory and Applications, 1977AbstractThe calculation of a rational transfer function is considered using a Laguerre expansion of the impulse response. An algorithm is proposed that avoids the appearance of high‐order surplus factors. Results of computer experiments are presented.
openaire +1 more source
Annual Meeting of the Association for Computational Linguistics
We propose Powerformer , an efficient homomorphic encryption (HE)-based privacy-preserving language model (PPLM) designed to reduce computational overhead while maintaining model performance.
Dongjin Park, Eunsang Lee, Joon-Woo Lee
semanticscholar +1 more source
We propose Powerformer , an efficient homomorphic encryption (HE)-based privacy-preserving language model (PPLM) designed to reduce computational overhead while maintaining model performance.
Dongjin Park, Eunsang Lee, Joon-Woo Lee
semanticscholar +1 more source
A Randomized Algorithm for Weighted Approximation of Points by a Step Function
Discrete Mathematics, Algorithms and Applications, 2010The problem considered in this paper is: Given an integer k > 0 and a set P of n points in the plane each with a corresponding nonnegative weight, find a step function f with k steps that minimize the maximum weighted vertical distance between f and all the points in P.
openaire +2 more sources
IEEE 1991 Ultrasonics Symposium, 2002
The problem of delay equalization in the design of SAW transducer weighting functions is considered. The need arises for an approach to the synthesis of finite impulse response functions with an arbitrary complex frequency response. Of late, several algorithms have been presented.
Richie, S. M., Abbott, B. P.
openaire +2 more sources
The problem of delay equalization in the design of SAW transducer weighting functions is considered. The need arises for an approach to the synthesis of finite impulse response functions with an arbitrary complex frequency response. Of late, several algorithms have been presented.
Richie, S. M., Abbott, B. P.
openaire +2 more sources
Systolic algorithm for multivariable approximation using tensor products of basis functions
Parallel Computing, 1991The paper is concerned with the approximation of \(f(x,y)\) by a function of the form \(\Omega(x,y)=\sum^ m_{i=1}\sum^ n_{j=1}a_{ij}\phi_ i(x)\psi_ j(y)\) which interpolates \(f\) at the rectangular grid of points \(\{(x_ i,y_ j)\}\). The authors discuss the choice of the basis functions \(\{\phi_ i(x)\}\), \(\{\psi_ j(y)\}\) and present a systolic ...
Krishnamurthy, E. V., Schröder, H.
openaire +2 more sources
Two Algorithms for Piecewise-Linear Continuous Approximation of Functions of One Variable
IEEE Transactions on Computers, 1974Two simple heuristic algorithms for piecewise-linear approximation of functions of one variable are described. Both use a limit on the absolute value of error and strive to minimize the number of approximating segnents subject to the error limit. The first algorithm is faster and gives satisfactory results for sufficiently smooth functions.
openaire +1 more source
Annual Meeting of the Association for Computational Linguistics
Fine-tuning Large Language Models (LLMs) with first-order methods like back-propagation is computationally intensive. Zeroth-Order (ZO) optimisation uses function evaluations instead of gradients, reducing memory usage, but suffers from slow convergence ...
Alessio Galatolo +3 more
semanticscholar +1 more source
Fine-tuning Large Language Models (LLMs) with first-order methods like back-propagation is computationally intensive. Zeroth-Order (ZO) optimisation uses function evaluations instead of gradients, reducing memory usage, but suffers from slow convergence ...
Alessio Galatolo +3 more
semanticscholar +1 more source
Maximum entropy based numerical algorithms for approximation of probability density functions
2003 European Control Conference (ECC), 2003This paper describes several fast algorithms for approximation of the maximum entropy estimate of probability density functions on the basis of a finite number of sampled data. The proposed algorithms are compared with the exact maximum entropy estimate in terms of approximation accuracy and computational efficiency. Some application examples are given.
Balestrino, A. +3 more
openaire +2 more sources
Astronomy & Astrophysics
The two-point correlation function of the galaxy spatial distribution is a major cosmological observable that enables constraints on the dynamics and geometry of the Universe. The Euclid mission is aimed at performing an extensive spectroscopic survey of
Euclid Collaboration S. de la Torre +499 more
semanticscholar +1 more source
The two-point correlation function of the galaxy spatial distribution is a major cosmological observable that enables constraints on the dynamics and geometry of the Universe. The Euclid mission is aimed at performing an extensive spectroscopic survey of
Euclid Collaboration S. de la Torre +499 more
semanticscholar +1 more source