搜索资源列表
A-mail-community-partition-
- 基于核心图聚类的邮件网络社区发现.pdf-A mail community partition based on coring graph clustering.pdf
SpectralSurfaceReconstructionfromNoisyPointClouds.
- We introduce a noise-resistant algorithm for reconstructing a watertight surface from point cloud data. It forms a Delaunay tetrahedralization, then uses a variant of spectral graph partitioning to decide whether each tetrahedron is inside or out
On-link-privacy
- 利用相似性理论，并结合匿名图中边存在的后验概率，攻击匿名图中的链接关系-how well an dege based graph randomization approach can protect sensitive links
Community_Detection
- 社区发现和社会媒体挖掘，介绍了相关算法和演化-discuss graph-based community detection techniques and many important extensions that handle dynamic, heterogeneous networks in social media
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.
Coloring-Problem
- Cellular Learning Automata-based Graph Coloring Problem
GRAPH_SEG
- graph based segmentation using matlab for image segmentation
Hyperspectral-Image-Classification-Through-Bilaye
- Hyperspectral image classification with limited number of labeled pixels is a challenging task. In this paper, we propose a bilayer graph-based learning framework to address this problem. For graph-based classification, how to establish the n
KREAG
- 语义网数据的大量增加使得RDF数据查询成为一个重要研究主题。关键词查询方式不需要掌握数据模式或查询语言，更适合普通用户使用。文中提出一种RDF数据关键词查询方法KREAG(Keyword query over RDF data based on Entity-triple Association Graph)-A substantial increase in the Semantic Web RDF data query such data become an important resear