中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR

Search Results

Help

Item hits: (Results 1-5 of 5)

Filters    
Items/Page:    Sort:
dichotomy for holant* problems of boolean domain [会议论文]
22nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, San Francisco, CA, United states, 23-Jan
Cai Jin-Yi; Lu Pinyan; Xia Mingji
  |  
 
the complexity and approximability of minimum contamination problems [会议论文]
Theory and Applications of Models of Computation 8th Annual Conference, TAMC 2011, Tokyo Japan, 2011
Li Angsheng; Tang Linqing
  |  
 
用圆锥体拟合线性模型点云数据的优化计算 [期刊论文]
计算机辅助设计与图形学学报, 2010-01-01, 卷号: 22, 期号: 8, 页码: 1324-1330
孙春娟; 朱滨海; 王文成
  |  
 
approximation and hardness results for label cut and related problems [会议论文]
6th Annual Conference on Theory and Applications of Models of Computation, TAMC 2009, Changsha, China, 43969
Zhang Peng; Cai Jin-Yi; Tang Linqing; Zhao Wenbo

 
近似骨架导向的归约聚类算法 [期刊论文]
电子与信息学报, 2009-01-01, 卷号: 31, 期号: 12, 页码: 2953-2957
宗瑜; 李明楚; 江贺

 

1

 

Valid XHTML 1.0!
Copyright © 2007-2020  中国科学院软件研究所 - Feedback
Powered by CSpace