Results 71 to 80 of about 1,163,681 (226)
Simplification Methods for Sum-of-Squares Programs [PDF]
A sum-of-squares is a polynomial that can be expressed as a sum of squares of other polynomials. Determining if a sum-of-squares decomposition exists for a given polynomial is equivalent to a linear matrix inequality feasibility problem.
Balas, Gary, Seiler, Peter, Zheng, Qian
core +1 more source
Qualitative properties of the minimum sum-of-squares clustering problem [PDF]
Fundamental qualitative properties of the minimum sum-of-squares clustering problem are established in this paper. We prove that the problem always has a global solution and, under a mild condition, the global solution set is finite.
Tran Hung Cuong, Jen-Chih Yao, N. D. Yen
semanticscholar +1 more source
Simple pulse counting circuit computes sum of squares [PDF]
Pulse counting circuit with an extra chain of flip-flops, delay lines, and gates computes the sum of the squares of the pulse sequences.
Schaefer, D. H.
core +1 more source
Optimization over non-negative polynomials is fundamental for nonlinear systems analysis and control. We investigate the relation between three tractable relaxations for optimizing over sparse non-negative polynomials: sparse sum-of-squares (SSOS ...
Fantuzzi, Giovanni +2 more
core +1 more source
Sum-of-squares lower bounds for planted clique
Finding cliques in random graphs and the closely related "planted" clique variant, where a clique of size k is planted in a random G(n, 1/2) graph, have been the focus of substantial study in algorithm design.
Alan +4 more
core +1 more source
High-dimensional estimation via sum-of-squares proofs [PDF]
Estimation is the computational task of recovering a hidden parameter $x$ associated with a distribution $D_x$, given a measurement $y$ sampled from the distribution.
P. Raghavendra +2 more
semanticscholar +1 more source
Minimizing a sum of Euclidean norms (MSEN) is a classic minimization problem widely used in several applications, including the determination of single and multifacility locations.
Pablo Soto-Quiros
doaj +1 more source
A New RSA Variant Based on Elliptic Curves
In this paper, we propose a new scheme based on ephemeral elliptic curves over a finite ring with an RSA modulus. The new scheme is a variant of both the RSA and the KMOV cryptosystems and can be used for both signature and encryption.
Maher Boudabra, Abderrahmane Nitaj
doaj +1 more source
Sums of Consecutive Prime Squares
See the abstract in the attached pdf.
Tongsomporn, Janyarak +2 more
openaire +3 more sources
Sum of Squares Decompositions and Rank Bounds for Biquadratic Forms
We study positive semi-definite (PSD) biquadratic forms and their sum-of-squares (SOS) representations. For the class of partially symmetric biquadratic forms, we establish necessary and sufficient conditions for positive semi-definiteness and prove that
Liqun Qi, Chunfeng Cui, Yi Xu
doaj +1 more source

