24*2发4黑中体 汉字库,以txt结尾但不是文本文件

一个可以提供初学者学习Access的教程,很有用的-can provide beginners a learning Access Guide, very useful

一个SANKE图像分割程序wd dqwe-image segmentation based snake arithmatihs sdhfsf weifjkl d adk

基于DirectX开发俄罗斯方块游戏 应用于c++语言-DirectX Visu C++ e luo si fang kuai

VHDL 函数信号发生器 VHDL 函数信号发生器-VHDL Function Generator VHDL Function Generator

基站的定位~`````值得推荐的好东西哦~~~~~~~~~~~~~~~~~~~~~~~~~`-base station location ~````` recommend a good thing, oh ~~~~~~~~~~~~~~~~ ~~~~~~~~~`

16位ad7705模数转换 好用串口方式 能值接把数读出来-16-bit AD7705 analog-to-digital converter serial-to-use way to access the value of the number of read out

这是Labview7下的信号发生器程序，对于调试硬件的朋友来说很有用啊-This is a signal generator under Labview7 procedures, for debugging hardware useful friends ah

xletview, for UNIX file and directory names are case sensitive. The path to the project CVSROOT must be specified using lowercase characters (i.e. /cvsroot/xletview) -xletview. for UNIX file and directory names are case sensi tive. The path to the project CVSROOT must be spe cified using lowercase characters (i.e./cvsr oot/xletview)

LPC2300 uart0 baundrate 384

本算法使用分治法求解最近点对问题。事先用O(nlogn)时间对x坐标进行排序，使得所有的点是按x坐标从小到大排好序的（x坐标相同时y坐标小的排前），然后取下标小于n/2属于左边的点集PL，取下标大于n/2属于右边的点集PR，即用O(1)时间就可以将规模为n的问题分解为两个规模为n/2的、同类型的子问题。分割完毕之后就可以采用分治法，分别求出PL和PR中的最近点对，最终通过递归实现。-This algorithm uses divide and conquer to solve the problem closest point. Prior to use O (nlogn) time to sort the x coordinate so that all points are based on x coordinates from small to large sorted (x coordinates with the same y coordinates of the small, the top), and then remove the standard is less than n/2 the set of points belonging to the left PL, remove the standard is greater than n/2 set of points belonging to the right of PR, that is to use O (1) time can be the problem size n divided into two size n/2, the same type The sub-problems. Segmentation can be used after completion of sub-rule method, respectively, find the PL and PR in the last points and eventually through the recursion.