搜索资源列表
uncodedBER
- the file which is uploaded is the uncoded systtem technique which we simulated. it gives the BER vs Snr curve.The un-coded system is simulated is by using randomly generated numbers and it s passed over the AWGN channel.the output of the matlab file
Fast-Image-Segmentation
- 立体视觉Gaussian Super-pixel Based Fast Image Segmentation Using Graph Cuts.-Gaussian Super-pixel Based Fast Image Segmentation Using Graph Cuts.
Bonhod
- 键合图的他励直流电动机故障诊断方法Bond Graph excited DC motor fault diagnosis method-Bond Graph excited DC motor fault diagnosis method
facebull.cpp
- facebook编程竞赛答案 标准搜索算法 速度很快-facebull facetime coding competition solution, very fast
dao-you-xi-tong
- 设计连云港市导游系统。以图中顶点表示各景点，存放景点名称、代号、简介等信息；以边表示路径，存放路径长度等相关信息。 为来访客人提供图中任意景点相关信息的查询。 为来访客人提供图中任意景点的问路查询，即查询任意两个景点之间的一条最短的简单路径。 提供图中任意景点查询，即求任意两点间的所有路径。 导游图的景点和道路的修改扩充功能。 -Lianyungang City guide system design. To vertices that the attractions
BIarm
- 有向图的BIT级联虚警分析BIT cascade directed graph of false alarm-BIT cascade directed graph of false alarm
algoritma-A-star
- pencarian jalur terpendek menggunakan A* pada metode graph
trace_graph
- the trace graph download method
gmp
- graph matching problem
branchandbound
- The basis of branch and bound algorithms is a ranking function. The ranking function assigns a value to each node in the graph. At each step, a branch and bound algorithm uses the ranking function to decide which node to expand next. In contrast, the
Matlab-kongzaibingwangfangzhen
- 变速恒频风力发电系统的空载并网技术在matlab环境下的仿真图-VSCF wind power system load and network environment in the simulation graph matlab
2009
- 基于matlab的图论问题的数学建模的研究，分析，习题与讲解-Matlab graph theory based on the mathematical modeling of the research, analysis, problem sets and explain
People-Appearances-in-web
- Web实体关系获取 A Graph-Based Framework for Disambiguating People Appearances in Web Search-A Graph-Based Framework for Disambiguating People Appearances in Web Search
On-link-privacy
- 利用相似性理论，并结合匿名图中边存在的后验概率，攻击匿名图中的链接关系-how well an dege based graph randomization approach can protect sensitive links
Xong
- A matchings in a graph is a set of edges, no two which share an endpoint. In this section we show how to find maximum matchings in bipartite graphs
CHUONG2
- a matching in a graph, a vertex is exposed if it dose not participate is the watching
pcm
- 一。产生长度为500的零均值，单位方差的高斯随机变量序列，用均匀pcm的方法用16电平进行量化：1）求所得的SQNR，该序列的前5个值，相应的量化值和相应的码字。2）画出量化误差（定义为输入值和量化值之间的差），同时 画出量化值作为输入值的函数的图。3）用128量化电平数重做2）题， 比较结果。 二。产生一个长度为500，按N(O,1)分布的随机变量序列，分别用16，128量化电平数和u=255的u律非线性进行量化，画出每种情况下量化器的误差和输入-输出关系，并求SQNR. 三。长度为5
l1
- Advanced Topics in Graph Algorithms slides.
GRAPH
- S7 -300 西门子GRFH使用说明书及编程详细步骤-S7-300
Bachelor---Drazen-Pupovac
- It s aticle about iregular graph partitoing (clustering).