虫虫首页| 资源下载| 资源专辑| 精品软件
登录| 注册

Non-linear

  • 这是LLE的原始算法

    这是LLE的原始算法,原文的参考文献是:S.T.Roweis and L.K.Saul. Nonlinear dimensionality reduction by locally linear embedding. Science, 290, 2000.

    标签: LLE 算法

    上传时间: 2013-12-20

    上传用户:虫虫虫虫虫虫

  • 数值分析高斯——列主元消去法主程序 说明如下: % a----input,matrix of coefficient % b----input,right vector % sol----o

    数值分析高斯——列主元消去法主程序 说明如下: % a----input,matrix of coefficient % b----input,right vector % sol----output,returns the solution of linear equation

    标签: input coefficient matrix vector

    上传时间: 2017-01-01

    上传用户:dancnc

  • 密码学界牛人Victor Shoup用C++编写数论类库。 NTL is a high-performance, portable C++ library providing data struct

    密码学界牛人Victor Shoup用C++编写数论类库。 NTL is a high-performance, portable C++ library providing data structures and algorithms for arbitrary length integers for vectors, matrices, and polynomials over the integers and over finite fields and for arbitrary precision floating point arithmetic. NTL provides high quality implementations of state-of-the-art algorithms for: * arbitrary length integer arithmetic and arbitrary precision floating point arithmetic * polynomial arithmetic over the integers and finite fields including basic arithmetic, polynomial factorization, irreducibility testing, computation of minimal polynomials, traces, norms, and more * lattice basis reduction, including very robust and fast implementations of Schnorr-Euchner, block Korkin-Zolotarev reduction, and the new Schnorr-Horner pruning heuristic for block Korkin-Zolotarev * basic linear algebra over the integers, finite fields, and arbitrary precision floating point numbers.

    标签: high-performance providing portable library

    上传时间: 2014-01-04

    上传用户:exxxds

  • cordic methods describe essentially the same algorithm that with suitably chosen inputs can be used

    cordic methods describe essentially the same algorithm that with suitably chosen inputs can be used to calculate a whole range of scientific functions including sin, cos, tan, arctan, arcsin, arccos, sinh, cosh, tanh, arctanh, log, exp, square root and even multiply and divide. the method dates back to volder [1959], and due to its versatility and compactness, it made possible the microcoding of the hp35 pocket scientific calculator in 1972. here is some code to illustrate the techniques. ive split the methods into three parts linear, circular and hyperbolic. in the hp35 microcode these would be unified into one function (for space reasons). because the linear mode can perform multiply and divide, you only need add/subtract and shift to complete the implementation. you can select in the code whether to do the multiples and divides also by cordic means. other multiplies and divides are all powers of 2 (these dont count). to eliminate these too, would involve ieee hackery.

    标签: essentially algorithm describe suitably

    上传时间: 2017-03-02

    上传用户:litianchu

  • An introduction to some of the key ideas in computer graphics is given. Modeling, 2D and 3D viewing,

    An introduction to some of the key ideas in computer graphics is given. Modeling, 2D and 3D viewing, transformations and related ideas from linear algebra are presented.

    标签: introduction computer Modeling graphics

    上传时间: 2017-04-07

    上传用户:hebmuljb

  • 统计模式识别工具箱(Statistical Pattern Recognition Toolbox)包含: 1

    统计模式识别工具箱(Statistical Pattern Recognition Toolbox)包含: 1,Analysis of linear discriminant function 2,Feature extraction: Linear Discriminant Analysis 3,Probability distribution estimation and clustering 4,Support Vector and other Kernel Machines

    标签: Statistical Recognition Pattern Toolbox

    上传时间: 2014-01-03

    上传用户:璇珠官人

  • WSNs being energy constrained systems, one major problem is to employ the sensor nodes in such a man

    WSNs being energy constrained systems, one major problem is to employ the sensor nodes in such a manner so as to ensure maximum coverage and connectivity with minimal or optimal number of nodes and furthermore elongate network lifetime with maximum energy utilization. The problem addressed has been tackled for 1-D linear array and further extended to 2-Dimensions as stated in the next slides.

    标签: constrained systems problem energy

    上传时间: 2017-04-28

    上传用户:evil

  • Watermarking schemes evaluation Abstract鈥擠igital watermarking has been presented as a solution to c

    Watermarking schemes evaluation Abstract鈥擠igital watermarking has been presented as a solution to copy protection of multimedia objects and dozens of schemes and algorithms have been proposed. Two main problems seriously darken the future of this technology though. Firstly, the large number of attacks and weaknesses which appear as fast as new algorithms are proposed, emphasizes the limits of this technology and in particu-lar the fact that it may not match users expectations. Secondly, the requirements, tools and methodologies to assess the current technologies are almost non-existent. The lack of benchmarking of current algorithms is bla-tant. This confuses rights holders as well as software and hardware manufacturers and prevents them from using the solution appropriate to their needs. Indeed basing long-lived protection schemes on badly tested watermarking technology does not make sense.

    标签: Watermarking watermarking evaluation presented

    上传时间: 2013-12-04

    上传用户:thinode

  • This is a code of Pseudo-Arc Length Continuation Method , the method can be used for solving the non

    This is a code of Pseudo-Arc Length Continuation Method , the method can be used for solving the nonlinear equations, the principle can re found in some text books. In the code,I prove the agreement of the code with other methods

    标签: Continuation Pseudo-Arc the solving

    上传时间: 2013-12-03

    上传用户:xzt

  • Heapsort 1.A heap is a binary tree satisfying the followingconditions: -This tree is completely ba

    Heapsort 1.A heap is a binary tree satisfying the followingconditions: -This tree is completely balanced. -If the height of this binary tree is h, then leaves can be at level h or level h-1. -All leaves at level h are as far to the left as possible. -The data associated with all descendants of a node are smaller than the datum associated with this node. Implementation 1.using a linear array not a binary tree. -The sons of A(h) are A(2h) and A(2h+1). 2.time complexity: O(n log n)

    标签: followingconditions tree completely satisfying

    上传时间: 2017-05-25

    上传用户:2467478207