Welcome![Sign In][Sign Up]
Location:
Search - split algorithm

Search list

[Windows Developrtree_src_1.0.1

Description: A disk based production quality RTree based upon Guttman?s quadratic split algorithm having following features: Buffering with dirty write, Index joins, Tree Seeding, Window and NN queries, Runtime STR Packing capability, Completely Thread safe.
Platform: | Size: 417869 | Author: 刘宇 | Hits:

[Crack HackHideInfo

Description: 使用java编写的LSB图像信息隐藏算法演示程序,可以将任何符合大小限制的文件拆分为一个一个bit隐藏到非压缩bmp图像中。支持在隐藏前通过zip类对文件进行压缩-prepared by the use of LSB image information hidden algorithm demo program, can be any size restrictions with the document for a split hidden bit of a non-compressed bmp image. Support for the hidden by the former category right zip compressed files
Platform: | Size: 45056 | Author: 乔月若 | Hits:

[OtherSQLET_split

Description: SQLET分词算法,一个C程序,供大家参考。-SQLET segmentation algorithm, a C program, for your reference.
Platform: | Size: 779264 | Author: 白乔 | Hits:

[source in ebookMysplit

Description: 种子填充算法用来在封闭曲线形成的环中填充某中颜色,在这里我们只填充黑色。种子填充其实上是图形学中的算法,其原理是:准备一个堆栈,先将要填充的点push进堆栈中;以后,每pop出一个点,将该点涂成黑色,然后按左上右下的顺序查看它的四个相邻点,若为白(表示还没有填充),则将该邻点push进栈。一直循环,直到堆栈为空。此时,区域内所有的点都被涂成了黑色。这里,我们自己定义了一些堆栈的数据结构和操作,实现了堆栈的初始化、push、pop、判断是否为空、及析构。 -seed filling algorithm used in a closed curve formed by a ring filled with color, here we only filled black. Seed is actually filled with graphics algorithm, and its tenet is : preparing a stack, Filling the first point to push into Stack; After each pop up a point, this point painted black. Press the left, then the right lower in the order View its four adjacent spots, and white (said that it had not yet filled), by being neighbors push into Stack. Has been circulating until the stack is empty. At this point, all the regional point has been Tu became black. Here, our own definition of a stack data structure and operations, the realization of the initial stack, push, pop, to determine whether the air, and destructors.
Platform: | Size: 205824 | Author: 蒋建军 | Hits:

[Data structscf_fft_2048_18

Description: 2048点的fft的算法源程序,应用verilog编程实现。-2048 point fft algorithm source code, application programming Verilog.
Platform: | Size: 1575936 | Author: 罗伟 | Hits:

[Compress-Decompress algrithmsActual_JPEG

Description: EZW,如多级树集合分裂算法(SPIHT),集合分裂嵌入块编码(SPECK),可逆的嵌入小波压缩法(CREW)等.本文对这些算法从原理到性能进行了比较和讨论,说明了嵌入式图象编码的研究方-EZW, such as multi-level collection of split tree algorithm (SPIHT), set to split the embedded block coding (SPECK), reversible embedded wavelet compression method (CREW) and so on. In this paper, these algorithms from the principle to the performance are compared and discussed to illustrate the embedded Study type image coding side
Platform: | Size: 73728 | Author: 华生 | Hits:

[AI-NN-PRGP

Description: PSO算法实现的图分割问题的matlab源码。原创-PSO algorithm for the graph partitioning problem matlab source. Original
Platform: | Size: 23552 | Author: chn | Hits:

[WaveletSPIHTencodingalgorithm

Description: 针对小波变换和多级树集合分裂图像编码具有浮点数运算、算法复杂等特点,采用整数实现的提升格式代替了原来的小 波变换,并结合提升小波变换和DCT变换的特点,提出了一种改进方案。-For wavelet transform and multi-level set to split the tree image coding with floating-point computation, algorithmic complexity, etc., realize the upgrading of the use of integer format instead of the original wavelet transform, combined with lifting wavelet transform and DCT transform, an improved program.
Platform: | Size: 287744 | Author: jingjing | Hits:

[Windows Developrtree_src_1.0.1

Description: A disk based production quality RTree based upon Guttman?s quadratic split algorithm having following features: Buffering with dirty write, Index joins, Tree Seeding, Window and NN queries, Runtime STR Packing capability, Completely Thread safe.
Platform: | Size: 417792 | Author: 刘宇 | Hits:

[2D Graphicfft

Description: The fft.c file is C code for a function to compute the 16 point real Fast Fourier Transform using the split radix algorithm. -The fft.c file is C code for a function to compute the 16 point real Fast Fourier Transform using the split radix algorithm.
Platform: | Size: 2048 | Author: 郭曉詠 | Hits:

[Graph programdiblook_SPMG

Description: Split and merge Algorithm for Image Processing . It uses a quad tree as data structure, which is created at running time using breath first method, and a stopping criterion . The stoping criterion method can be changed , i just used to the difference of means of the regions which should be merged , compared with some threshold.
Platform: | Size: 1433600 | Author: TOAMNA_AMARA | Hits:

[3D GraphicPSSM4u

Description: PSSM(Parallel-Split Shadow Maps)阴影算法C#源码-PSSM(Parallel-Split Shadow Maps)Shadow algorithm C# source code
Platform: | Size: 1730560 | Author: Anew | Hits:

[Mathimatics-Numerical algorithmsID3

Description: The algorithm ID3 (Quinlan) uses the method top-down induction of decision trees. Given a set of classified examples a decision tree is induced, biased by the information gain measure, which heuristically leads to small trees. The examples are given in attribute-value representation. The set of possible classes is finite. Only tests, that split the set of instances of the underlying example languages depending on the value of a single attribute are supported.
Platform: | Size: 4096 | Author: Minh | Hits:

[matlabfsmem_mvgm

Description: Free Split and Merge Expectation-Maximization algorithm for Multivariate Gaussian Mixtures. This algorithm is suitable to estimate mixture parameters and the number of conpounds-Free Split and Merge Expectation-Maximization algorithm for Multivariate Gaussian Mixtures. This algorithm is suitable to estimate mixture parameters and the number of conpounds
Platform: | Size: 220160 | Author: ewizlab | Hits:

[AlgorithmSplit_radix

Description: FFT的分裂基算法,很详细的注释,花了两天的时间。希望对大家有帮助-The Split-radix FFT algorithm, a very detailed notes, spent a couple of days. We want to help
Platform: | Size: 1024 | Author: 尚龙 | Hits:

[Graph programsplitmerge

Description: SPLITMERGE Segment an image using a split-and-merge algorithm.
Platform: | Size: 2048 | Author: Wagner | Hits:

[OtherVQsplit

Description: vector quantization binary split algorithm
Platform: | Size: 4096 | Author: shyam agarwal | Hits:

[Graph programSplit_Bregman_Denoising

Description: 使用分裂Bregman算法做图像去噪,收敛速度很快,保持缘特征-using Splitting Bregman algorithm do image denoising, fast convergence to maintain edge features
Platform: | Size: 1728512 | Author: xiachen | Hits:

[Data structsdoc

Description: 关于整数拆分算法的文档 关于整数拆分算法的文档-Split algorithm on the integer integer split algorithm for documents on the document
Platform: | Size: 35840 | Author: agi995 | Hits:

[Othersplitmerge

Description: SPLITMERGE Segment an image using a split-and-merge algorithm. G = SPLITMERGE(F, MINDIM, @PREDICATE) segments image F by using a split-and-merge approach based on quadtree decomposition. MINDIM (a positive integer power of 2) specifies the minimum dimension of the quadtree regions (subimages) allowed. If necessary, the program pads the input image with zeros to the nearest square size that is an integer power of 2. This guarantees that the algorithm used in the quadtree decomposition will be able to split the image down to blocks of size 1-by-1. The result is cropped back to the original size of the input image. In the output, G, each connected region is labeled with a different integer. - SPLITMERGE Segment an image using a split-and-merge algorithm. G = SPLITMERGE(F, MINDIM, @PREDICATE) segments image F by using a split-and-merge approach based on quadtree decomposition. MINDIM (a positive integer power of 2) specifies the minimum dimension of the quadtree regions (subimages) allowed. If necessary, the program pads the input image with zeros to the nearest square size that is an integer power of 2. This guarantees that the algorithm used in the quadtree decomposition will be able to split the image down to blocks of size 1-by-1. The result is cropped back to the original size of the input image. In the output, G, each connected region is labeled with a different integer.
Platform: | Size: 2048 | Author: dilir | Hits:
« 12 3 4 5 6 7 8 9 10 »

CodeBus www.codebus.net