搜索资源列表
Shape-Variation
- 摘要: 研究了调节凸 B¨|zie 曲面、B-样条曲面及 NURBS 曲面(BBN 曲面)一个控制点以后,曲面形状变化的规 律.通过将 BBN 曲面分解成一张凸曲面与具有特殊形状曲面的叠加,建立了曲面变形前后一些几何量与变形位 移量之间的数量关系,得到了凸BBN曲面失去凸性的充分条件和判据.相应的结果可应用于调节与控制BBN曲 面形状的算法设计. -Abstract: The regulation convex B ¨ | zie surface, B-spline surfaces
PDCO
- A primal-dual interior method for solving linearly constrained optimization problems with a convex objective function
39912bc06bd1
- To strike a point cloud of the convex hull has been carried out on the convex hull triangulation, algorithm is simple
Rosenbrock
- The Rosenbrock function is a non-convex function used as a performance test problem for optimization algorithms introduced by Rosenbrock (1960). It is also known as Rosenbrock s valley or Rosenbrock s banana function. The global minimum is insid
RElief
- Relief Algorithm RELIEF is considered one of the most successful algorithms for assessing the quality of features due to its simplicity and effectiveness. It has been recently proved that RELIEF is an online algorithm that solves a convex optim
tubao
- 凸包算法，根据鼠标点出来的点来画凸多边形。-Convex hull algorithm, according to the mouse point to draw out of the convex polygon.
Convexhull
- A method to build Convex Hu-A method to build Convex Hull
Matlab
- 凸二次规划的matlab有效集算法,很有用的，值得收藏！-Convex active set quadratic programming algorithm matlab, useful, worth collecting!
TestTrueOrFalse
- 判断一个透镜（凹透镜，凸透镜，平面镜）合格还是不合格。-Judge a lens (concave, convex, plane mirror) qualified or unqualified.
magicRecovery-ofsparsesignals
- Highly robust error correction by convex programming
CONVEX_OPTIMIZATION.pdf
- Convex Optimization Stephen Boyd
bv_cvxbook
- 最优化的外国教程，英文原版,涵盖了需要涉及的基本数学知识与应用-textbook of convex optimization
YALL1-v1.3
- 求解L1范数最小化问题的凸优化工具包，共含有6个模型的求解方法-Solving the L1-norm minimization problem of convex optimization toolkit contains a total of six methods of solving the model
hidden-space
- 最小二乘隐空间支持向量机 王玲 薄列峰 刘芳 焦李成 ! 在隐空间中采用最小二乘损失函数$提出了 最 小 二 乘 隐 空 间 支 持 向 量 机#0*&**52H 8 同 隐 空 间 支 持 向 量机#&**52H 一样$最小二乘隐空间支持向量机不需 要 核 函 数 满 足 正 定 条 件$从 而 扩 展 了 支 持 向 量 机 核 函 数 的 选择范围 8 由于采用了最小二乘损失函数$最小二乘隐空间支持向量机产生的优 化 问 题 为 无 约 束 凸 二 次 规
triangulation
- 动态规划求解凸8边形分割，使各三角形权重和最小-Dynamic programming convex 8-gon split, so that the triangle and the minimum weight
example3
- 三维Sierpinski镂垫的递归程序，使用三维点，由于每个四面体都是凸性的，因此四面体的顶点与其内部任意点肯定在四面体内部-3D Sierpinski router pad of the recursive procedure, using a three-dimensional point, because each tetrahedron is convex, so the tetrahedral vertex and any point must be in the tetrahedra
N
- 输入N个点的坐标，判断这N个点能否构成一个凸多边形。-Enter the coordinates of N points, to determine whether the N points form a convex polygon
melcode
- Convex Optimization, network model
text
- 输入N个点的坐标，判断这N个点能否构成一个凸多边形。-Enter the coordinates of N points, to determine whether the N points form a convex polygon.
FeatureExtractionNode
- Application that extracts features from segments, retrieved from microscope cell images. Each segment represents one cell. Feature vector consists of following features: - cell s area - cell s centroid - cell s weighted centroid - cell s conv