搜索资源列表
thssYimingSub
- This my phd thesis for the WDM optical network optimization, which employs convex optimization techniques to solve the proposed integer problems. The computation complexity of my optimization framework is very low compared with other existing method
DFT5486135412
- 过采样近似完全重构 DFT 调制滤波器组的设计。首先,分析了传递函数和 混叠传递函数的性质，给出了因果 FIR DFT 调制滤波器组的系统延迟与线性相位 分析和综合原型滤波器阶数的关系。随后，过采样近似完全重构 DFT 调制滤波器 组的设计问题被描述为一个非凸优化问题。-Near perfect reconstruction oversampled DFT modulated filter design. First, the analysis of the transfer fun
thesisOFDMA-RessourceAllocation
- 一篇同学的硕士论文 --OFDMA Ressource Allocation using Multiuser Constant-Power Waterfilling. 关于OFDMA 资源分配的算法 用到凸优化(convex optimization)的理论 证明对多用户的Waterfilling算法可以实现优化原则-A master
k_cvdcs_extabstr_cg96
- Calculating Voronoi Diagrams using Convex Sweep Curves
MESH-on-the-minimum-for-a-convex-body-surrounded.r
- 关于求一个MESH的最小凸包围体 所谓凸体， 就是从凸体内任意一点，向周围发射线，都只此MESH相交一次。-MESH on the minimum for a convex body surrounded the so-called convex body, convex body from any point, to launch around the line, only this time MESH intersection.
360compkill
- The solution of the Chinese postman problem using matching theory is given. The convex hull of integer solutions is described as a linear programming polyhedron. This polyhedron is used to show that a good algorithm gives an optimum solution. The
lysnake
- 提出了一种自适应的Snake 算法,对于初始包络上的每一点,按照Greedy 算法中的能量公式计算其邻域内各点的能 量. 如果邻域不包含目标的轮廓,则将邻域半径加大,再次计算邻域内各点的能量,直到邻域内包含轮廓点为止. 该算法只需迭 代一次即可得到目标轮廓,而且增大了初始包络的收敛半径,并能够有效处理较高曲率凸形边缘的情况. 对比实验说明了这种 方法的有效性.-Snake proposed an adaptive algorithm, the initial envelope for
coe
- 单核苷酸多态性(SNPs)数据与全基因组关联研究 COE:凸优化的上位性检测算法 -Single nucleotide polymorphisms (SNPs) data and genome-wide association study COE: convex optimization epistasis detection algorithm
convexl
- The convex hull of a set of points is the smallest convex set that contains the points. This paper presents a convex hull algorithm that combines the 2-d Quickhull algorithm with the general dimension.
l1magic
- `1-magic : Recovery of Sparse Signals via Convex Programming
bv_cvxbook
- 凸优化相关书籍，主要介绍优化理论的最新成果，全文为英文尚未发现中文版-Convex optimization books, mainly on the latest achievements in optimization theory, the text is in English have not yet found the Chinese version! !
ppt
- 本人收集到的一些二阶锥优化和凸优化的资料，拿出来共享给大家，希望有用！-I collected some of the second-order cone optimization and convex optimization information out for everyone to share the hope that useful!
3010_solutions_manual-1-4.pdf
- Convex Optimization Solution 1-4
convex_optimition
- 一本关于最优化理论的书籍，里面主要讲述凸集最优化理论-A book on optimization theory books, which focuses on convex optimization theory
bv_cvxbook
- Convex Optimization . It is a booko written by Stephen Boys, Stanford, USA
bv_cvxbook.pdf
- Convex Optimization Book Written by Stephen Boyd and Lieven Vandenberghe
3-Stabilization
- In this chapter, we shall deal with the stabilization problem for singular systems. The purpose is the design of controllers such that the closed-loop system is regular, stable and impulse-free (in the continuous case) or causal (in the discrete
few2many-pami01
- a generative appearance-based method for recognizing human faces under variation in lighting and viewpoint. The method exploits the fact that the set of images of an object in fixed pose, but under all possible illumination conditions, is a convex
An-expanding-SOM
- 自组织映射（SOM）已成功处理的欧式旅行的鹅岭推销员问题（TSP）。通过将其邻域保持财产和 凸包属性数值模拟TSP，我们引入了一个新的SOM如神经网络，称为前panding的SOM（ESOM）的。在每一个学习的迭代，ESOM提请接近的兴奋神经元 输入的城市，并在此期间，推压它们向凸包ofcities合作。 ESOM可能收购邻里保护财产和凸包的属性 的TSP，因此它可以产生接近最优的解决方案。从理论上分析了其可行性 和经验。一个的系列ofexperiments进行合成和基准的T
Solution-to-Convex-Optimization-By-S.Boyd-L.Vande
- Solution to Convex Optimization By S.Boyd L.Vandenberghe