搜索结果: 1-15 共查到“知识库 `1-minimization”相关记录94条 . 查询时间(0.031 秒)
Faster homomorphic encryption is not enough: improved heuristic for multiplicative depth minimization of Boolean circuits
somewhat homomorphic encryption multiplicative depth Boolean functions
2019/8/27
In somewhat homomorphic encryption schemes (e.g. B/FV, BGV) the size of ciphertexts and the execution performance of homomorphic operations depends heavily on the multiplicative depth. The multiplicat...
New Circuit Minimization Techniques for Smaller and Faster AES SBoxes
AES SBox circuit area circuit depth
2019/7/15
In this paper we consider various methods and techniques to find the smallest circuit realizing a given linear transformation on nn input signals and mm output signals, with a constraint of a maximum ...
Minimization of the Probabilistic p-frame Potential
Frame potential equiangular tight frames probabilistic frames
2015/12/10
We investigate the optimal configurations of n points on the unit sphere for a class of potential functions. In particular, we characterize these optimal configurations in terms of theirapproximation ...
Empirical Risk Minimization for Probabilistic Grammars:Sample Complexity and Hardness of Learning
Risk Minimization Probabilistic Grammars Sample Complexity and Hardness
2015/9/10
Probabilistic grammars are generative statistical models that are useful for compositional and sequential structures. They are used ubiquitously in computational linguistics. We present a framework, r...
A VARIANT OF POINT-TO-PLANE REGISTRATION INCLUDING CYCLE MINIMIZATION
Vision Registration Surface Large Three-dimensional
2015/8/31
3D models are very important in many industrial and scientific applications. Most part of commercial sensors obtain only a partial acquisition of the object, so that a set of views are required to bui...
A VARIANT OF POINT-TO-PLANE REGISTRATION INCLUDING CYCLE MINIMIZATION
Vision Registration Surface Large Three-dimensional
2015/8/28
3D models are very important in many industrial and scientific applications. Most part of commercial sensors obtain only a partial acquisition of the object, so that a set of views are required to bui...
Fast Solution of `1-norm Minimization Problems When the Solution May be Sparse
LASSO. LARS Homotopy Methods Basis Pursuit.
2015/8/21
The minimum `1-norm solution to an underdetermined system of linear equations y = Ax,
is often, remarkably, also the sparsest solution to that system. This sparsity-seeking property
is of interest i...
Solving interpolation problems via generalized eigenvalue minimization
Generalized eigenvalue interpolation control system the analysis of linear matrix inequality
2015/8/12
A number of problems in the analysis and design of control systems may be reformulated as the problem of minimizing the largest generalized eigenvalue of a pair of symmetric matrices which depend affi...
A rank minimization heuristic with application to minimum order system approximation
Variable control system analysis and controller synthesis matrix rank linear matrix inequality (lmi) the positive semi-definite matrix variables
2015/8/11
Several problems arising in control system analysis and design, such as reduced order controller synthesis, involve minimizing the rank of a matrix variable subject to linear matrix inequality (LMI) c...
Log-det heuristic for matrix rank minimization with applications to Hankel and Euclidean distance matrices
Positive semi-definite matrix convex sets functions half positive definite matrix distance data
2015/8/11
We present a heuristic for minimizing the rank of a positive semidefinite matrix over a convex set. We use the logarithm of the determinant as a smooth approximation for rank, and locally minimize thi...
Rank minimization and applications in system theory
Matrix the convex set system identification statistics signal processing
2015/8/11
In this tutorial paper, we consider the problem of minimizing the rank of a matrix over a convex set. The Rank Minimization Problem (RMP) arises in diverse areas such as control, system identification...
An efficient method for large-scale l1-regularized convex loss minimization
Convex loss logistic regression newsgroups data set
2015/8/10
Convex loss minimization with l1 regularization has been proposed as a promising method for feature selection in classification (e.g., l1-regularized logistic regression) and regression (e.g., l1-regu...
Enhancing sparsity by reweighted l1 minimization
1-Minimization ·Iterative reweighting Underdetermined systems of linear equations·Compressive sensing Dantzig selector· Sparsity FOCUSS
2015/8/10
It is now well understood that (1) it is possible to reconstruct sparse signals exactly from what appear to be highly incomplete sets of linear measurements and (2) that this can be done by constraine...
A semidefinite programming method for integer convex quadratic minimization
The quadratic function the probability of integer zinc, values
2015/8/7
We consider the NP-hard problem of minimizing a convex quadratic function over the integer lattice Zn. We present a semidefinite programming (SDP) method for obtaining a nontrivial lower bound on the ...
A differential equations approach to l1-minimization with applications to array imaging
differential equations approach l1-minimization array imaging
2015/7/14
We present an ordinary differential equations approach to the analysis of algorithms for constructing l1 minimizing solutions to underdeter mined linear systems of full rank. It involves a relaxed min...