搜索资源列表
OMages
- OMAP的无线多媒体传感网图像节点设计OMAP wireless multimedia sensor network node design images-OMAP wireless multimedia sensor network node design images
DrawTree
- DELPHI 画树形节点的源码，对学画图等有一定的帮助-DELPHI source node tree painting, drawing, such as school will certainly help
icassp061
- 指出了粒子滤波在多维估计中的应用以及相关一些关键结技术，有参考价值。-Pointed out that the particle filter in the multi-dimensional estimation of some of the key node and related technology, a valuable reference.
image_demo
- 使用vc++2005完成,实现B样条曲线拟合曲线.单文档视图结构.可打开显示图片,可使用B样条曲线对对象轮廓进行拟合.显示B样条曲线的次数,控制点个数,控制点坐标,节点向量等-Using vc++2005 completed, the realization of B-spline curve fitting. The structure of a single document view. To open the display picture, you can use B-spline cu
Text1
- 有限元分析，实现了三节点有限元分析，采用frotran语言-Finite element analysis to achieve a three-node finite element analysis, using frotran language
smartbj
- 功能：用自适应分段线性法逼近已知函数 调用格式：[node,err]=smartBJ(func,a,b,maxtol) 其中：func: 已知函数 A: 逼近区间的左端点 B: 逼近区间的右端点 Maxtol: 分段线性逼近允许的最大误差 Node: 分段线性逼近的区间节点 Err: 分段线性逼近实际的最大误差 -it use smartbj to get a good function
cnsegm
- 基于复杂网络的图像分割程序 利用复杂网络节点度特性来分割图像，有一定参考价值。-Image Segmentation Based on Complex Network using complex network node degree program features to segment the image, a certain reference value.
cx
- 对曲线上相邻过密，不影响图形走向的多余节点，进行抽希处理。-Adjacent to the curve too close, not affecting the image to the redundant node, for pumping the Greek treatment.
bianli
- 实现图的遍历，输入图的各个结点，实现前序遍历，中序遍历，后序遍历-Implement graph traversal, each node input graph, to achieve pre-order traversal, inorder traversal, postorder traversal
zui-duan
- 最小路劲查询，源点到节点的权值与路劲走线对比选择最短路劲-Minimum Road King inquiry, the source point to the node weight compared with the Road King, choose the shortest path routing Jin
mintree
- 一个有 n 个结点的连通图的生成树是原图的极小连通子图，且包含原图中的所有 n 个结点，并且有保持图联通的最少的边。-An n-node connected graph of the minimal spanning tree is the original connected subgraph, and contains all the n original nodes, and there are plans to maintain at least the edge of Unicom.
node
- 运用J2SE实现图像区域生长的算法.该算法实现了迭代使图像能够-use j2se show image can dsff asdadsf
dijkstra
- 图论算法，计算最短距离.描述了一个节点到其他节点的最短距离-graph theory.it include a algorithm of dijkstra.it display the min path between a node to any other nodes
kdtree
- 在图像处理中，用最优节点优先法，建造kd树，用于特征点匹配-In the image processing, the optimal node with priority method, build kd tree, used for matching feature points
SaleBooks
- 运用区域分割的方法解决选址问题，将面转化为节点，使得模型变得简化。-Region segmentation method to solve the location problem, will face transformed into a node, the model becomes simplified.
kdtree
- 特征点匹配时，采用构造KD-tree，用最优节点优先法寻找最佳匹配点-Matching feature points, the tectonic KD-tree, with the optimal node is preferred method to search for the optimal matching point
huafen
- 对图形进行网格划分，节点分布有多又少，可以根据需要进行改变-Graph of meshing node distribution has more and less, and may, according to needs change
androidUSBCamera
- 这是Android 2.3.4版本的 UVC Camera 测试程序, 使用YUYV格式, (其实 MJPG 格式也是可以用的, 只要我注释掉的那几行代码 uncomment一下就好了) 所使用的 camera 在android 中的设备节点是 /dev/video1 , 做为前置摄像头, 要运行起这个程序可能有点麻烦, 因为我修改了一些不相关的 JAVA 代码, 而要正确编译这个程序, 懂得补充(或者去掉)这些JAVA部分 但是如果使
14-node-CPSO-algorithm
- 14节点的无功优化是用粒子群算法实现的，很实用，希望对大家有帮助。-14-node reactive power optimization is achieved using particle swarm algorithm, very practical, we hope to help.
aip-node-sdk-1.4.1
- 人工智能人脸识别人js接口，aip-node-sdk-1.4.1.zip下载减压即可(Artificial intelligence face recognition)