位置：成果数据库 > 期刊 > 期刊详情页
A new algorithm to determine minimally k-edgeconnected graphs with odd k
  • ISSN号：1935-0090
  • 期刊名称：Applied Mathematics and Information Sciences
  • 时间：2013
  • 页码：983-989
  • 相关项目：特定主题社会化媒体内容的动态识别关键技术研究
作者： Yunming Ye|Yueping Li|
同期刊论文项目
特定主题社会化媒体内容的动态识别关键技术研究
期刊论文 15 会议论文 5 专利 1
同项目期刊论文
On Multivariate Markov Chains for Common and Non-common Objects in Multiple Networks.
Unknown Chinese Word Extraction based on Variety of Overlapping Strings
TPS: an Unsupervised Web Page Segmentation Algorithm Based on Dom Tree Structure Mining
Extensions of Kmeans-type Algorithms: A New Clustering Framework by Integrating Intra-cluster Compac
Multidimensional Latent Semantic Analysis Using Term Spatial Information
TW-k-Means: Automated Two-Level Variable Weighting Clustering Algorithm for Multiview Data
An ensemble of decision cluster crotches for classification of high dimensional data
Classifying Very High-Dimensional Data with Random Forests Built from Small Subspaces
A Novel Decision Cluster Classifier with Nested Agglomerative K-Means
A Novel Graph Partition based Page Segmentation Algorithm
SNP Selection and Classification of Genome-Wide SNP Data Using Stratified Sampling Random Forests
Stratified sampling for feature subspaceselection in random forests for high dimensional data
A Topic Detection Approach Through Hierarchical Clustering on Concept Graph