Results 241 to 250 of about 2,123,789 (292)
Some of the next articles are maybe not open access.
The Potential of the Approximation Method
SIAM Journal on Computing, 2004Summary: Developing certain techniques for the approximation method, we establish precise versions of the following statements concerning lower bounds for circuits that detect cliques of size \(s\) in a graph with \(m\) vertices: For \(5 \leq s \leq m/4\), a monotone circuit computing CLIQUE\((m,s)\) contains at least \((1/2)1.8^{\min(\sqrt{s-1}/2, m ...
Kazuyuki Amano, Akira Maruoka
openaire +2 more sources
Approximate and probabilistic methods
SIGSPATIAL Special, 2010Why? The metric search paradigm has been to this day successfully applied to several real-world problems, ranging from multimedia to data mining, from decision support to pattern recognition, to statistical and medical applications. Indeed, its simplicity makes it a perfect candidate for solving a variety of similarity problems
CIACCIA, PAOLO, PATELLA, MARCO
openaire +2 more sources
Approximating method of frames
Digital Signal Processing, 2003In this paper, the well-known method of frames approach to the signal decomposition problem is reformulated as a certain bilevel goal-attainment linear least squares problem. As a consequence, a numerically robust variant of the method, named approximating method of frames, is proposed on the basis of a certain minimal Euclidean norm approximating ...
Felipe Marti-Lopez, Thomas Koenig
openaire +1 more source
Nonlinear Methods of Approximation
Foundations of Computational Mathematics, 2003This extensive survey paper is, according to its author, complementary to the survey by \textit{R. A. DeVore} [Acta Numerica 7, 51--150 (1998; Zbl 0931.65007)]. The central concept is \(m\)-term approximation, that is, approximation of a given element \(f\) of a Banach space \(X\) by linear combinations of \(\leq m\) elements \(g_k\) taken from some ...
openaire +2 more sources
Approximation Methods for Supervised Learning
Foundations of Computational Mathematics, 2005Let ź be an unknown Borel measure defined on the space Z := X × Y with X ź źd and Y = [-M,M]. Given a set z of m samples zi =(xi,yi) drawn according to ź, the problem of estimating a regression function fź using these samples is considered. The main focus is to understand what is the rate of approximation, measured either in expectation or probability,
Kerkyacharian, G. +3 more
openaire +2 more sources
Approximations to the Multiplier Method
SIAM Journal on Numerical Analysis, 1985The author analyzes approximations to the multiplier method for solving optimization problems. In particular, the effect of replacing the constrained problem by the unconstrained optimization of a penalized Lagrangian over a subspace instead of a Hilbert space, is considered. Some applications to nonlinear optimal control are discussed.
openaire +2 more sources
Archives of Surgery, 1960
For the past several years we have employed a method of accurate rib approximation which is simple to apply and results in a firm closure with a minimum of post-operative pain. We published a description originally in the chapter on "The Stomach" in the Lewis Practice of Surgery in 1956. Because of continued satisfaction with the method, it is believed
openaire +2 more sources
For the past several years we have employed a method of accurate rib approximation which is simple to apply and results in a firm closure with a minimum of post-operative pain. We published a description originally in the chapter on "The Stomach" in the Lewis Practice of Surgery in 1956. Because of continued satisfaction with the method, it is believed
openaire +2 more sources
An Approximate Method of Ellipsoids
Cybernetics and Systems Analysis, 2003zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Polygonal Approximations by Newton's Method
IEEE Transactions on Computers, 1977The problem of locating optimally the breakpoints in a continuous piecewise-linear approximation is examined. The integral square error E of the approximation is used as the cost function. Its first and second derivatives are evaluated and this allows the application of Newton's method for solving the problem.
openaire +2 more sources
An improved Toeplitz approximation method
ICASSP-88., International Conference on Acoustics, Speech, and Signal Processing, 1988The authors suggest a modification of the Toeplitz approximation method for estimating frequencies of multiple sinusoids from covariance measurements. The method constructs a state-feedback matrix following a low-rank approximation of the Toeplitz covariance matrix via singular-value decomposition. Ideally, the eigenvalues of this state-feedback matrix
K. S. Arun, Bhaskar D. Rao
openaire +1 more source