Results 271 to 280 of about 36,965 (299)
Some of the next articles are maybe not open access.
Quadratic Approximation of Cubic Curves
Proceedings of the ACM on Computer Graphics and Interactive Techniques, 2020We present a simple degree reduction technique for piecewise cubic polynomial splines, converting them into piecewise quadratic splines that maintain the parameterization and C1 continuity. Our method forms identical tangent directions at the interpolated data points of the piecewise cubic spline by replacing each cubic piece with a pair of quadratic ...
Nghia Truong, Cem Yuksel, Larry Seiler
openaire +1 more source
On Non-Approximability for Quadratic Programs
46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), 2005This paper studies the computational complexity of the following type of quadratic programs: given an arbitrary matrix whose diagonal elements are zero, find x /spl isin/ {-1, 1}/sup n/ that maximizes x/sup T/Mx. This problem recently attracted attention due to its application in various clustering settings, as well as an intriguing connection to the ...
Sanjeev Arora +4 more
openaire +2 more sources
SIAM Journal on Numerical Analysis, 1974
Quadratic approximation is a three-dimensional analogue of the two-dimensional Pade approximation. The advantages of employing quadratic approximation are demonstrated by several examples. With automatic computers having a relatively inexpensive square root instruction, quadratic approximation is an attractive alternative to Pade approximation if ...
openaire +2 more sources
Quadratic approximation is a three-dimensional analogue of the two-dimensional Pade approximation. The advantages of employing quadratic approximation are demonstrated by several examples. With automatic computers having a relatively inexpensive square root instruction, quadratic approximation is an attractive alternative to Pade approximation if ...
openaire +2 more sources
On quadratic lattice approximations
1993We consider the problem of approximating a system of linear and quadratic forms evaluated at a rational point by 0–1 vectors. When only linear forms are given this is the well known lattice approximation problem. We call the general version the quadratic lattice approximation problem.
Anand Srivastav, Peter Stangier
openaire +1 more source
Acyclic semidefinite approximations of quadratically constrained quadratic programs
2015 American Control Conference (ACC), 2015Quadratically constrained quadratic programs (QCQPs) belong to a class of nonconvex optimization problems that are NP-hard in general. Recent results have shown that QCQPs having acyclic graph structure can be solved in polynomial time, provided that their constraints satisfy a certain technical condition.
Raphael Louca, Eilyan Bitar
openaire +1 more source
Approximating quadratic programming with bound and quadratic constraints
Mathematical Programming, 1999zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
On quadratic approximations in block ciphers
Problems of Information Transmission, 2008zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Approximating Global Quadratic Optimization with Convex Quadratic Constraints
Journal of Global Optimization, 1999zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Curve Approximation with Quadratic B-Splines
Ninth International Conference on Information Visualisation (IV'05), 2006A curve approximation technique using quadratic B-splines is presented in this paper which automatically computes data points to minimize errors. This technique can be useful for efficient storage of geometric shapes in any graphic or CAD applications.
Asif Masood +2 more
openaire +1 more source
Approximative covariance interpolation with a quadratic penalty
2007 46th IEEE Conference on Decision and Control, 2007Given output data of a stationary stochastic process estimates of the covariances parameters can be obtained. These estimates can be used to determine ARMA models to approximately fit the data by matching the covariances exactly. However, the estimates of the covariances may contain large errors, especially if they are determined from short data ...
Per Enqvist, Enrico Avventi
openaire +1 more source