Search - partition problem

Search - partition problem - List

[Windows Develop] 一维最近点（分治法）1 DL : 0: 该程序实现对一维数据轴上的最临近点的求解问题采用方法：分治方法1（该方法在递归时由于使用数组的值，使得递归进栈的数据很多，消耗系统空间很大，所以处理的个数经测试不超过70个，可见在设计程序时，考虑空间的使用也是很必要的！）-the process of achieving a dimensional data axis near the point of the methodology used to solve the problem : a partition method (the method when the use of recursive array, which makes the recursive stack into many of the data, consume much space, the number of tested not more than 70, based in Visibility terms procedures, the use of space is also necessary!)
Date : 2008-10-13 Size : 1.95kb User : 杨晨
[Windows Develop] grid_segmentation.zip DL : 0: This paper presents a novel segmentation algorithm for metallographic images, especially those objects without regular boundaries and homogeneous intensity. In metallographic quantification, the complex microstructures make the conventional approaches hard to achieve a satisfactory partition. We formulate the segmentation procedure as a new framework of iterative watershed region growing constrained by the ridge information. The seeds are selected by an effective double-threshold approach, and the ridges are superimposed as the highest waterlines in watershed transform. To tackle the over-segmentation problem, the blobs are merged iteratively with the utilization of Bayes classification rule. Experimental results show that the algorithm is effective in performing segmentation without too much parameter tuning.
Date : 2011-05-05 Size : 695.57kb User : jjrs05
[Windows Develop] 一维最近点（分治法）1 DL : 0: 该程序实现对一维数据轴上的最临近点的求解问题采用方法：分治方法1（该方法在递归时由于使用数组的值，使得递归进栈的数据很多，消耗系统空间很大，所以处理的个数经测试不超过70个，可见在设计程序时，考虑空间的使用也是很必要的！）-the process of achieving a dimensional data axis near the point of the methodology used to solve the problem : a partition method (the method when the use of recursive array, which makes the recursive stack into many of the data, consume much space, the number of tested not more than 70, based in Visibility terms procedures, the use of space is also necessary!)
Date : 2026-01-02 Size : 2kb User : 杨晨
[Windows Develop] 1 DL : 0: 利用分治原理解决棋盘覆盖问题，利用深度搜索填充棋盘-Using the principle of partition board cover problem solving, the use of depth of search fill board
Date : 2026-01-02 Size : 1.87mb User : 刘家贤