搜索结果: 1-15 共查到“Minimization”相关记录98条 . 查询时间(0.093 秒)
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars：An active contour model with local variance force term and its efficient minimization solver for multi-phase image
局部方差力项 活动轮廓模型 多相图像 最小化求解器
font style='font-size:12px;'>
2023/5/8
In this work, we propose an active contour model with a local variance force (LVF) term that can be applied to multi-phase image segmentation problems. With the LVF, the proposed model is very effecti...
Faster homomorphic encryption is not enough: improved heuristic for multiplicative depth minimization of Boolean circuits
somewhat homomorphic encryption multiplicative depth Boolean functions
font style='font-size:12px;'>
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
font style='font-size:12px;'>
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 ...
A multi-start heuristic for multiplicative depth minimization of boolean circuits
boolean functions homomorphic encryption multiplicative depth
font style='font-size:12px;'>
2017/6/1
In this work we propose a multi-start heuristic which aims at minimizing the multiplicative depth of boolean circuits. The multiplicative depth objective is encountered in the field of homomorphic enc...
上海财经大学微观经济学课件Chapter 20 Cost Minimization
上海财经大学 微观经济学 课件 Chapter 20 Cost Minimization
font style='font-size:12px;'>
2017/4/1
上海财经大学微观经济学课件Chapter 20 Cost Minimization。
Minimization of the Probabilistic p-frame Potential
Frame potential equiangular tight frames probabilistic frames
font style='font-size:12px;'>
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
font style='font-size:12px;'>
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
font style='font-size:12px;'>
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
font style='font-size:12px;'>
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.
font style='font-size:12px;'>
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
font style='font-size:12px;'>
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
font style='font-size:12px;'>
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
font style='font-size:12px;'>
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
font style='font-size:12px;'>
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
font style='font-size:12px;'>
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...