Results 21 to 30 of about 1,163,681 (226)
Mixed-integer programming techniques for the minimum sum-of-squares clustering problem
Journal of Global Optimization, 2023 The minimum sum-of-squares clustering problem is a very important problem in data mining and machine learning with very many applications in, e.g., medicine or social sciences.
J. P. Burgard +4 more
semanticscholar +1 more source
Multiple Imputation to Balance Unbalanced Designs for Two-Way Analysis of Variance
Methodology, 2021 A balanced ANOVA design provides an unambiguous interpretation of the F-tests, and has more power than an unbalanced design. In earlier literature, multiple imputation was proposed to create balance in unbalanced designs, as an alternative to Type-III ...
Joost R. van Ginkel +1 more
doaj +1 more source
A Convex Data-Driven Approach for Nonlinear Control Synthesis
Mathematics, 2021 We consider a class of nonlinear control synthesis problems where the underlying mathematical models are not explicitly known. We propose a data-driven approach to stabilize the systems when only sample trajectories of the dynamics are accessible.
Hyungjin Choi +2 more
doaj +1 more source
A Convex Form That Is Not a Sum of Squares [PDF]
Mathematics of Operations Research, 2021 Every convex homogeneous polynomial (or form) is nonnegative. Blekherman has shown that there exist convex forms that are not sums of squares via a nonconstructive argument.
J. Saunderson
semanticscholar +1 more source
Computation of sum of squares polynomials from data points [PDF]
, 2020 We propose an iterative algorithm for the numerical computation of sums of squares of polynomials approximating given data at prescribed interpolation points.
Després, Bruno, Herda, Maxime
core +4 more sources
IEEE Access, 2020 We present a sum of squares (SOS) method for the synthesis of nonlinear polynomial control systems. As an emerging numerical solution method in recent years, SOS targets polynomials as the research object.
Fanwei Meng +4 more
doaj +1 more source
Further research results on confusion coefficient of Boolean functions
Journal of Mathematical Cryptology, 2023 The notion of confusion coefficient (CC) is a property that attempts to characterize the confusion property of cryptographic algorithms against differential power analysis.
Liu Zhenyu, Zhuo Zepeng
doaj +1 more source
Sum-of-Squares Lower Bounds for Independent Set on Ultra-Sparse Random Graphs [PDF]
Symposium on the Theory of ComputingWe prove that for every D ∈ N, and large enough constant d ∈ N, with high probability over the choice of G ∼ G(n,d/n), the Erdos-Renyi random graph distribution, the canonical degree 2D Sum-of-Squares relaxation fails to certify that the largest ...
Pravesh K. Kothari +2 more
semanticscholar +1 more source
Methodology, 2020 In earlier literature, multiple imputation was proposed to create balance in unbalanced designs, as an alternative to Type III sum of squares in two-way ANOVA.
Joost R. van Ginkel +1 more
doaj +1 more source
On the confusion coefficient of Boolean functions
Journal of Mathematical Cryptology, 2021 The notion of the confusion coefficient is a property that attempts to characterize confusion property of cryptographic algorithms against differential power analysis. In this article, we establish a relationship between the confusion coefficient and the
Zhou Yu +4 more
doaj +1 more source