Search - graph - CodeBus

Search - graph - List

[Industry research] 122121 DL : 0: < 聚类收集大量的生物医学文献基于本体富硒图代表性和相互细化策略>>-<Clustering large collection of biomedical literature based on ontology-enriched graph representation and mutual refinement Strategies>
Date : 2026-01-01 Size : 208kb User : 汤佩
[Industry research] a DL : 0: 系统地介绍声发射信号简化波形特征参数的定义和分析方法，包括列表显示和分析、单参数分析、经所图分析、分布图分析和关联图分析等.-Systematic introduction of AE signal waveform characteristics to simplify the definition of parameters and analysis methods, including a list of display and analysis of single parameter analysis, by the analysis, distribution analysis and incidence graph analysis.
Date : 2026-01-01 Size : 209kb User : 康康
[Industry research] graph-match-PRL DL : 0: Text-independent speaker recognition using graph matching.
Date : 2026-01-01 Size : 684kb User : paulo
[Industry research] CPU-Graph-of-Volts-vs-Speed-Meron-Dothan-Banias.r DL : 0: Graph of Intel Mobile CPU performance at different Vcore voltages. This helps very much for underclocking/overclocking your notebooks.-Graph of Intel Mobile CPU performance at different Vcore voltages. This helps very much for underclocking/overclocking your notebooks.
Date : 2026-01-01 Size : 69kb User : Richard
[Industry research] SpectralSurfaceReconstructionfromNoisyPointClouds. DL : 0: 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 outside the original object. The reconstructed surface triangulation is the set of triangular faces where inside and outside tetrahedra meet. Because the spectral partitioner makes local decisions based on a global view of the model, it can ignore outliers, patch holes and undersampled regions, and surmount ambiguity due to measurement errors. Our algorithm can optionally produce a manifold surface. We present empirical evidence that our implementation is substantially more robust than several closely related surface reconstruction programs.
Date : 2026-01-01 Size : 7.25mb User : madison
[Industry research] Bonhod DL : 0: 键合图的他励直流电动机故障诊断方法Bond Graph excited DC motor fault diagnosis method-Bond Graph excited DC motor fault diagnosis method
Date : 2026-01-01 Size : 378kb User :
[Industry research] On-link-privacy DL : 0: 利用相似性理论，并结合匿名图中边存在的后验概率，攻击匿名图中的链接关系-how well an dege based graph randomization approach can protect sensitive links
Date : 2026-01-01 Size : 187kb User : 谢小红
[Industry research] Community_Detection DL : 0: 社区发现和社会媒体挖掘，介绍了相关算法和演化-discuss graph-based community detection techniques and many important extensions that handle dynamic, heterogeneous networks in social media
Date : 2026-01-01 Size : 1.36mb User : gzy
[Industry research] x-graph DL : 0: data for c++ beginners to learn and install -data for c++ beginners to learn and install
Date : 2026-01-01 Size : 1kb User : rizwan pasha
[Industry research] tensorCode DL : 0: it is for graph mining
Date : 2026-01-01 Size : 5kb User : harsh
[Industry research] A-mail-community-partition- DL : 0: 基于核心图聚类的邮件网络社区发现.pdf-A mail community partition based on coring graph clustering.pdf
Date : 2026-01-01 Size : 358kb User : jzw
[Industry research] Matlab_test DL : 0: 寄存器分配，采用图着色算法进行处理，简化处理时间-Register graph coloring
Date : 2026-01-01 Size : 57kb User : 王
[Industry research] graph DL : 0: laboratory work on the and other-laboratory work on the and other
Date : 2026-01-01 Size : 57kb User : Lexa
[Industry research] p2p-networks-and-random-graphs DL : 0: 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.
Date : 2026-01-01 Size : 1.32mb User : stefan.petrov.beb
[Industry research] graph-embedding- DL : 0: graph embedding and extensions a general framework for dimensionality
Date : 2026-01-01 Size : 1.43mb User : 郑
[Industry research] re DL : 1: about graph colorin problem
Date : 2026-01-01 Size : 381kb User : jaouhari
[Industry research] edgebetweenness.m DL : 0: edge betweeness algorythm for graph creating
Date : 2026-01-01 Size : 1kb User : al
[Industry research] Graph-Theory DL : 0: 图论，主要是TSP问题的解决方法，用C++实现的过程-Graph theory, mainly TSP solution to the problem, with the realization of the process C++
Date : 2026-01-01 Size : 1kb User : 薛超
[Industry research] Coloring-Problem DL : 0: Cellular Learning Automata-based Graph Coloring Problem
Date : 2026-01-01 Size : 98kb User : mhfff
[Industry research] Parallel-graph-partitioning DL : 0: 对最大团问题的研究在速度和精度上都提出了更高的要求，考虑将搜索空间进行划分，并行独立运算求解子空间的最大团结构。 -Parallel graph partitioning
Date : 2026-01-01 Size : 252kb User : 李新晨

« 12 »