![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Yang Dai Hsiao-Mei Lu , Sumeet Gupta , Yang Dai: Reducing large diagonals in kernel matrices through semidefinite programming. BIOKDD 2003 : 57-62 Bing Liu , Yang Dai, Xiaoli Li , Wee Sun Lee , Philip S. Yu : Building Text Classifiers Using Positive and Unlabeled Examples. ICDM 2003 : 179-188 Lei Huang , Hsiao-Mei Lu , Yang Dai: Feature Selection of Support Vector Regression for Quantitative Structure-Activity Relationships (QSAR). METMBS 2003 : 88-93 José L. Balcázar , Yang Dai, Osamu Watanabe : A Random Sampling Technique for Training Support Vector Machines. ALT 2001 : 119-134 José L. Balcázar , Yang Dai, Osamu Watanabe : Provably Fast Training Algorithms for Support Vector Machines. ICDM 2001 : 43-50 Danny Z. Chen , Ovidiu Daescu , Yang Dai, Naoki Katoh , Xiaodong Wu , Jinhui Xu : Optimizing the sum of linear fractional functions and applications. SODA 2000 : 707-716 Yang Dai, Naoki Katoh , Siu-Wing Cheng : LMT-skeleton heuristics for several new classes of optimal triangulations. Comput. Geom. 17 (1-2): 51-68 (2000) Yang Dai, Naoki Katoh : On Computing New Classes of Optimal Trangulations with Angular Constraints. COCOON 1998 : 15-24 Yang Dai, Kazuo Iwano , Naoki Katoh : A New Probabilistic Analysis of Karger's Randomized Algorithm for Minimum Cut Problems. Inf. Process. Lett. 64 (5): 255-261 (1997) Yang Dai, Hiroshi Imai , Kazuo Iwanoc , Naoki Katoha , Keiji Ohtsukaa , Nobuhiko Yoshimuraa : A New Unifying Heuristic Algorithm for the Undirected Minimum Cut Problems Using Minimum Range Cut Algorithms. Discrete Applied Mathematics 65 (1-3): 167-190 (1996) Yang Dai, Hiroshi Imai , Kazuo Iwano , Naoki Katoh : How to Treat Delete Requests in Semi-Online Problems. ISAAC 1993 : 48-57 1 [ 7 ] [ 8 ] 2 [ 6 ] 3 [ 5 ] 4 [ 6 ] 5 [ 11 ] 6 [ 9 ] 7 [ 1 ] [ 2 ] 8 [ 1 ] [ 3 ] 9 [ 2 ] 10 [ 1 ] [ 3 ] [ 4 ] [ 5 ] [ 6 ] 11 [ 2 ] 12 [ 10 ] 13 [ 10 ] 14 [ 10 ] 15 [ 9 ] [ 11 ] 16 [ 2 ] 17 [ 7 ] [ 8 ] 18 [ 6 ] 19 [ 6 ] 20 [ 2 ] 21 [ 10 ] ![]() ©2004 Association for Computing Machinery |