搜索资源列表
89346515John.Wiley.and.Sons.Essentials.of.Error.Co
- 网络编码的提出彻底地改变了计算机通信网络中的信息处理方式，其研究结合了信息论、计算机通信网络、 组播技术、多用户信息论和图论等很多方面的知识。文中简要介绍了网络编码的基本原理，线性网络编码的基本概念及其发 展，并且提出一种实现线性网络编码的算法。-Its research involves the knowledge about information theory, computer communication networks, multicast technique, mul
CBIR
- Graph-Cut Transducers for Relevance Feedback in Content Based Image Retrieval, Relevance Feedback for Content-Based Image Retrieval Using Bayesian Network,CONTENT BASED IMAGE RETRIEVAL,Relevance Feedback,A survey of browsing models for content based
network20091201
- 用matlab开发交通带权图，在复杂网络中-Development of the traffic using matlab weighted graph, in a complex network
Matlab-kongzaibingwangfangzhen
- 变速恒频风力发电系统的空载并网技术在matlab环境下的仿真图-VSCF wind power system load and network environment in the simulation graph matlab
p2p-networks-and-random-graphs
- A PhD thesis by Peter Mahlmann. Devoted to design and implementation of P2P networks, based on random graphs. It creates a low-latency model for a P2P network, based on random graph theory. Contains links to a Java implementation of the prototype.
graph-and-net
- matab图与网络模型及算法，包括基本理论介绍，例子，和算法程序-matab map and network models and algorithms, including the introduction of basic theory, examples, and algorithm
1-s2.0-S1389128609002217-main
- A topology control approach for utilizing multiple channels in multi-radio wireless mesh networks We consider the channel assignment problem in a multi-radio wireless mesh network that involves assigning channels to radio interfaces for achieving e
structure-and-function-network
- Progress summarizes some complex networks, including small-world effect, degree distribution, clustering, and network-related concepts such as random graph model, network growth and preferential attachment models, as well as occurring on the network
code.tar
- Graph creation algorithm and data for Social network graph for Telecom
Test
- 最短路中的广度优先搜索，Dijkstra算法。网络算路问题的更优算法实现对于网络资源高效配置具有重要价值。题目是：给定一个带权重的有向图 G (V,E)，V 为顶点集，E 为有向边集，每一条有向边均有一个权 重。对于给定的顶点 s、t，以及 V 的子集 V ，寻找从 s 到 t 的不成环有向路径 P，使得 P 经过 V 中所有的顶点(对经过 V 中节点的顺序不做要求)。 若不存在这样的有向路径 P，则输出无解，程序运行时间越短，则视为结果越优；若存在这 样的有向路径 P，则输出所得到的路径
Parallel-Algorithm
- 基于Spark 分布式图计算模型，提出大规模复杂网络社区并行发现算法DBCS 。-Based on Spark distributed graph computing model, a large scale and complex network community parallel discovery algorithm DBCS is proposed.
Accurate Segmentation of Cervical Cytoplasm and Nuclei Based on Multiscale Convolutional Network and Graph Partitioning
- In this paper, a multiscale convolutional network (MSCN) and graph-partitioning-based method is proposed for accurate segmentation of cervical cytoplasm and nuclei. Specifically, deep learning via the MSCN is explored to extract scale invariant f