Search - merge - CodeBus

Search - merge - List

[Other] FileSplt DL : 0: 文件分割器源码，将各种大文件方便的分割成1.4M大小的小文件，以便分盘携带。复制到目标机器后，再用它将多个小文件合并既可使用，- Document division source code, each kind of big document convenience division 1.4M size small document, in order to a minute plate carries. After duplicates the goal machine, then will use it many small documents merge already to be possible to use,
Date : 2025-12-20 Size : 1.7mb User : 江宏涛
[Other] merge DL : 0: 归并排序－－c语言非第归-merging sort-- c-language section naturalization
Date : 2025-12-20 Size : 1kb User : 风
[Other] VariableblocksizeMotionEstimation DL : 0: presentation of Fast Variable Block Size Motion Estimation Algorithms Based on Merge and Split Procedures for H.264/MPEG-4 AVC
Date : 2025-12-20 Size : 145kb User : 熊牧野
[Other] 1[1].1merge DL : 0: 算法分析与设计实验代码，归并排序实现从小到大排序-Algorithm Analysis and Design of Experiments code, merge sort to sort the realization of small to large
Date : 2025-12-20 Size : 1kb User : 周丽媛
[Other] MergeSort DL : 0: 矩阵转置，intel线程挑战赛作品，多线程，TBB，归并排序，快速排序-Matrix transpose, intel Challenge thread works, multi-threaded, TBB, merge sort, quick sort
Date : 2025-12-20 Size : 1.31mb User : 郭溪林
[Other] MP3 DL : 0: 可以分割和合并歌曲挺不错的一个发现大家-Can split and merge a very good song we found
Date : 2025-12-20 Size : 925kb User : 马平
[Other] MERGE DL : 0: program for merge sort in C language
Date : 2025-12-20 Size : 1kb User : vickky
[Other] splitmerge DL : 0: 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.
Date : 2025-12-20 Size : 2kb User : dilir
[Other] images_filter_median DL : 0: Given an image. Implement the split and merge procedure for segmenting the image with different values for minimum dimensions of the quadtree regions.-Given an image. Implement the split and merge procedure for segmenting the image with different values for minimum dimensions of the quadtree regions.
Date : 2025-12-20 Size : 6kb User : dilir
[Other] merge DL : 0: CUDA的Merge Sort(Old and even)實作及詳細住解-CUDA of MERGE the Sort (Old and even) the solution implementation and detailed live
Date : 2025-12-20 Size : 1kb User : 王鈞弘
[Other] merge-and-count DL : 0: 完成sort and count算法，是算法分析当中devide and conquer中的一道题-The attached file Q5.txt contains 100,000 integers between 1 and 100,000 (each row has a single integer), the order of these integers is random and no integer is repeated. 1. Write a program to implement the Sort-and-Count algorithms in your favorite language, find the number of inversions in the given file. 2. In the lecture, we count the number of inversions in O(n log n) time, using the Merge-Sort idea. Is it possible to use the Quick-Sort idea instead ? If possible, implement the algorithm in your favourite language, run it over the given file, and compare its running time with the one above. If not, give a explanation.
Date : 2025-12-20 Size : 1.7mb User : maria
[Other] merge DL : 0: /* *并查集： *算法介绍：并查集是一种高效的支持合并查询的数据结构 * bcj[]保存前驱节点，是并查集的结构关系数组。 * rank[]保存集合元素个数，合并时按照元素个数多少合并。 * *函数功能：Init()是初始化bcj[],rank[],初始时,把每个元素都当成一个集合 * Find(x)是查询元素x所在的集合. * Merge(x, y)是合并x所在集合和y所在集合. */-/** And check the set:* algorithm introduced: a search set is an efficient data structure to support the combined query* bcj [] save precursor node is an array of structures and investigate the relationship between sets.* Rank [] to save the number of elements in the collection, consolidation in accordance with the number of elements in the number of merger.* Function: Init () to initialize bcj [], rank [], initially, each element is set as a* Find (x) where x is the set of query elements* Merge (x, y) is. where x and y merge collections where the collection.* /
Date : 2025-12-20 Size : 1kb User : 古月
[Other] split-and-merge DL : 0: 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.-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.
Date : 2025-12-20 Size : 2kb User : Narayana Reddy
[Other] Araxis-Merge DL : 0: 一款对比软件工具merge.exe,不用安装，直接点击使用，功能强大，尤其喜欢文件夹比较能在中间部分看到文件中有多少不同。用了蛮久感觉很好用，所以分享给大家。-A contrast software tools merge. Exe, need not install, click use directly, powerful functions, especially like folder comparison to see how many files in the middle section is different.Use the quite long time the feeling is very good, so share with everyone.
Date : 2025-12-20 Size : 1.83mb User : 郁小芳
[Other] Merge-sort DL : 0: 使用C++实现的归并算法，在VS2010能成功编译。有详细注释。-Use merge algorithm implemented in C++ in VS2010 successfully compile. There are detailed notes
Date : 2025-12-20 Size : 1kb User : 李小明
[Other] Data-processing-sort-merge DL : 0: Data processing sort merge CTRL + q one key (VBA)-Data processing sort merge CTRL+ q one key (VBA)
Date : 2025-12-20 Size : 41kb User : 方洲
[Other] Merge-k-Sorted-Lists DL : 0: 合并K个有序的链表，然后返回结果链表的首结点-Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.
Date : 2025-12-20 Size : 1kb User : 王汝鑫
[Other] merge DL : 0: 利用R语言合并指定目录下的所有CSV文件，逐个导入csv为dataframe数据类型，然后合并dataframe.合并的方式是横向合并，也就是根据第1列（可以选择依据那几列）将所有csv拼接起来，便于后续的数据分析-use R to merge csv files. all csv files will be merged by the first column to a large csv file.
Date : 2025-12-20 Size : 1kb User : 秋风萧瑟
[Other] Work DL : 0: 合并csv及类似文件调用格式: python "merge file by line.py" target.csv D:/source/pattern*.csv target.csv 输出结果路径 D:/source/pattern*.csv 输入文件路径, 支持星号(*)匹配(Merging CSV and similar documents Call format: Python "merge file by line.py" target.csv D:/source/pattern*.csv Target.csv output path D:/source/pattern*.csv enters the file path and supports the asterisk (*) matching)
Date : 2025-12-20 Size : 1kb User : noodlesister
[Other] MergeSortPthread DL : 0: 分冶法排序，pthread实现排序算法：分冶法，使用pthread实现(merge sort pthread use merge sort to sort the array, and use pthread to implement)
Date : 2025-12-20 Size : 1kb User : 饭洛洛

« 12 3 4 5 6 7 8 9 10 ... 14 »