论文发表

108.

Chenguang Zhu, Weizhu Chen, Zeyuan Allen Zhu, Gang Wang, Dong Wang, Zheng Chen. A General Magnitude-Preserving Boosting Algorithm for Search Ranking. The 18th ACM Conference on Information and Knowledge Management (CIKM 2009), pp. 817-825, November 2-6, 2009, Hong Kong.  

107.

Ming Zhou, Long Jiang, and Jing He. Generating Chinese Couplets and Quatrain Using a Statistical Approach. The 23rd Pacific Asia Conference on Language, Information and Computation (PACLIC 2009), pp.43-52, Dec. 3-5, 2009, Hong Kong, China.  

106.

Jing He, Hongyu Liang. An approximation algorithm for word-replacement using a bi-gram language model. The 1st IEEE Youth Conference on Information, Computing and Telecommunications (YC-ICT’09), pp. 27-30, Sep. 20-21, 2009, Beijing, China.  

105.

Bin Ma and Hongyi Yao. Seed Optimization for i.i.d Similarities Is No Easier than Optimal Golomb Ruler. Information Processing Letters, Vol.109,Issue 19,pp.1120-1124,2009.  

104.

Yang Ye,Yu Liu, Chi Wang, Dapeng Lv, Jianhua Feng. Decomposition:Privacy Preservation for Multiple Sensitive Attributes. The 14th International Conference on Database Systems for Advanced Applications (DASFAA 2009), pp. 486-490, April 21-23, 2009, Brisbane, Australia.  

103.

Yuchen Zhang, Xiaoming Sun. The antimagicness of the Cartesian product of graphs. Theoretical Computer Science, Vol.410, pp.727-735, 2009.  

102.

Xi Chen, Li-Sha Huang, Shang-Hua Teng. Market equilibria with hybrid linear-Leontief utilities. Theoretical Computer Science, Vol.410, pp.1573-1580, 2009.  

101.

Jin-Yi Cai, Vinay Choudhary, Pinyan Lu. On the Theory of Matchgate Computations. Theory of Computing Systems, Vol.45, pp.108-132, 2009.  

100.

Xi Chen, Xiaotie Deng. On the Complexity of 2D Discrete Fixed Point Problem. Theoretical Computer Science, Vol.410, pp.4448-4456,2009.  

99.

Yingchao Zhao, Shang-hua Teng. Combinatorial and spectral aspects of nearest neighbor graphs in doubling dimens. Theoretical Computer Science, Vol.410, pp.1081-1092,2009.  

98.

Decheng Dai, Rong Ge. New Results on Simple Stochastic Games. The 20th International Symposium on Algorithms and Computation (ISAAC 2009), pp. 1014-1023, December 16-18, 2009, Hawaii, USA.  

97.

Pinyan Lu and Changyuan Yu. An improved randomized truthful mechanism for scheduling unrelated machines. Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science(STACS 2008), pp.527-538, 2008.  

96.

Chakrabarty Deeparnab, Goel Gagan, Vazirani Vijay V., Wang Lei, Yu Changyuan. Efficiency, Fairness and Competitiveness in Nash Bargaining Games. Proceedings of Internet and Network Economics - 4th International Workshop(WINE 2008), v 5385 LNCS, p 498-505, 2008, .  

95.

JinYi Cai, Pinyan Lu. Signature Theory in Holographic Algorithms. Proceedings of 19th International Symposium of Algorithms and Computation (ISAAC 2008), v.5369 LNCS, pp.568-579, 2008, .  

94.

Yongxi Cheng and Ding-Zhu Du. New constructions of one and two stage pooling designs. Journal of Computational Biology, Vol. 15, No. 2, pp. 195-205, 2008.  

93.

Yongxi Cheng. A New Class of Antimagic Cartesian Product Graphs. Discrete Mathematics, Vol. 308, pp. 6441-6448, 2008.  

92.

Jing Zhang, Xin Gao, Jinbo Xu, Ming Li. Rapid and Accurate Protein Side Chain Packing using Local Backbone Information. The 12th Annual International Conference on Research in Computational Molecular Biology (RECOMB 2008), pp. 285-299, March 30-April 2, 2008, NUS, Singapore.  

91.

Jing Xiao, Lusheng Wang, Xiaowen Liu and Tao Jiang. Finding additive biclusters with random background. The 19th Annual Symposium on Combinatorial Pattern Matching (CPM 2008), pp. 263-276, June 18-20, 2008, Pisa, Italy.