The phrase "approximations which can be" is correct and usable in written English.
It can be used when discussing estimates or near values that are possible or feasible in a given context.
Example: "The calculations yielded approximations which can be refined further with more data."
Alternatives: "estimates that may be" or "values that can be".
Some of these steps introduce approximations, which can be identified from changes in the set of conditional independence (CI) assertions of a network.
I derive finite-element approximations, which can be used to obtain numerical solutions in domains which do not allow for an analytical treatment.
Thirdly and finally, the method also provides an argument for new equations, i.e., the Langevin and linear noise approximations, which can be used to study the stochastic fluctuations in the model.
Since only explicit solutions of a small class of SDEs with Poisson random measure can be obtained, one needs, in general, discrete time approximations which can be divided into strong approximations and weak approximations.
Basic Idea: Treat the viewed model as an approximation, which can be updated with wavelets.
To overcome this shortcoming, we introduce a theoretic framework based on rough set theory, called positive approximation, which can be used to accelerate a heuristic process of attribute reduction.
This paper describes a novel form of Bayesian Laplace approximation, which can be replace both the Bayesian updating and the inner Monte Carlo sampling to compute the posterior expectation of a function.
We place our work on a solid theoretical foundation and show that it can greatly improve the accuracy in the approximation which can be achieved in a given amount of processor time.
The paper considers various stages of approximation which can be useful for simplified simulation of the build-up of the transition zone (TZ) between the freshwater and the saltwater.
By Theorem 1, we can replace our utility function with a smooth, uniformly convergent approximation, which can be locally maximized in the power control loop.
The proof can be found in Appendix 2. The SCA procedure is summarized in Algorithm 2. The algorithm is initialized as described in the first step of Algorithm 2, which is equivalent to a high signal-to-interference-plus-noise ratio (SINR) approximation (which can be seen when applying this initialization in (27)).
