© Copyright 2000-2020 Source Code Online. Free Source Code and Scripts Downloads.
File ID: 14589
Horner's Algorithm Description
Description: This tutorial teaches you how to run the Horner's algorithm, for number convertion. It converts numbers from specified numeric system into decimal, without using powers, which makes the whole process faster.
|More Similar Code|
This function do the Euclid's algorithm. As a matter of fact, for two given polynomials n, m (which are the polynomials of the symbolic
variable "s") it gives two other polynomials x, y such that nx+my=1.
Implementation of Valiaho's algorithm to determine the handicap based on paper
H. Valiaho. Determining the handicap of a sufficient matrix. Linear Algebra and Its Applications, 253:279-298, 1997.
This is a GUI for DTMF generator-decoder using Goertzel's algorithm.Has options to change Number of samples and Noise power that could be added at the generator.Suggestions and comments is always welcome.Now i am working on medical image pattern...
Solves the linear least squares problem with nonnegative variables using the newton's algorithm in:
Portugal, Judice and Vicente, A comparison of block pivoting and interior point algorithms for linear least squares problems with nonnegative...
DIJKSTRA Calculate Minimum Costs and Paths using Dijkstra's Algorithm
[AorV] Either A or V where
A is a NxN adjacency matrix, where A(I,J) is nonzero if and only if an edge connects point I to point J
Kruskal's algorithm is used to find the branches of a ''tree'' having the minimum weight in a system of branches. The application of this algorithm is wide. One example is in finding the shortest (and cheapest) path of interconnecting several...
Implementation of a Reed-Solomon decoder using RiBM, Chien search, and modified Forney's algorithm.
RiBM algorithm: (Reformulated inversionless Berlekamp-Massey) see "High-Speed Architectures for Reedd-deOCtSolomon Decoders"...
Kruskal's algorithm is an algorithm in graph theory that finds a minimum spanning tree for a connected un directed weighted graph
The zip file contains
kruskal.m iscycle.m fysalida.m connected.m
If we want to find...
CiviCluster's algorithm is now built into CiviCRM 1.8.
CiviCluster provides duplicate detection and merging functionality to CiviCRM in the form of a block that displays likely duplicates and links to the merging utility. While this...
This code snippet is the implementation of Dijkstra's algorithm.
|User Review for Horner's Algorithm
All files and free downloads are copyright of their respective owners. We do not provide any hacked, cracked, illegal, pirated version of scripts, codes, components downloads. All files are downloaded from the publishers website, our file servers or download mirrors. Always Virus check files downloaded from the web specially zip, rar, exe, trial, full versions etc. Download links from rapidshare, depositfiles, megaupload etc not published.