| MadaBoost: A modification of AdaBoost C Domingo, O Watanabe COLT, 180-189, 2000 | 272 | 2000 |
| Polynomial-time bounded truth-table reducibility of NP sets to sparse sets M Ogiwara, O Watanabe SIAM Journal on Computing 20 (3), 471-483, 1991 | 198 | 1991 |
| New collapse consequences of NP having small circuits J Köbler, O Watanabe SIAM Journal on Computing 28 (1), 311-324, 1998 | 134 | 1998 |
| Adaptive sampling methods for scaling up knowledge discovery algorithms C Domingo, R Gavalda, O Watanabe Data Mining and Knowledge Discovery 6 (2), 131-152, 2002 | 122 | 2002 |
| A Probabilistic 3—SAT Algorithm Further Improved T Hofmeister, U Schöning, R Schuler, O Watanabe Annual Symposium on Theoretical Aspects of Computer Science, 192-202, 2002 | 110 | 2002 |
| Polynomial-time 1-Turing reductions from# PH to# P S Toda, O Watanabe Theoretical Computer Science 100 (1), 205-221, 1992 | 105 | 1992 |
| Algorithms for learning finite automata from queries: A unified view JL Balcázar, J Díaz, R Gavalda, O Watanabe Advances in Algorithms, Languages, and Complexity, 53-72, 1997 | 104 | 1997 |
| Performance evaluation of a vector supercomputer SX-Aurora TSUBASA K Komatsu, S Momose, Y Isobe, O Watanabe, A Musa, M Yokokawa, ... SC18: International Conference for High Performance Computing, Networking …, 2018 | 96 | 2018 |
| A random sampling technique for training support vector machines J Balcázar, Y Dai, O Watanabe International Conference on Algorithmic Learning Theory, 119-134, 2001 | 83 | 2001 |
| A comparison of polynomial time completeness notions O Watanabe Theoretical Computer Science 54 (2-3), 249-265, 1987 | 81 | 1987 |
| Instance complexity P Orponen, KI Ko, U Schöning, O Watanabe Journal of the ACM (JACM) 41 (1), 96-121, 1994 | 80 | 1994 |
| How hard are sparse sets? LA Hemachandra, M Ogiwara, O Watanabe 1992 Seventh Annual Structure in Complexity Theory Conference, 222,223,224 …, 1992 | 80 | 1992 |
| Kolmogorov complexity and computational complexity O Watanabe Springer, 1992 | 70 | 1992 |
| Relating equivalence and reducibility to sparse sets E Allender, LA Hemachandra, M Ogiwara, O Watanabe SIAM Journal on Computing 21 (3), 521-539, 1992 | 64 | 1992 |
| An encryption-then-compression system for jpeg 2000 standard O Watanabe, A Uchida, T Fukuhara, H Kiya 2015 IEEE International Conference on Acoustics, Speech and Signal …, 2015 | 61 | 2015 |
| Nanofabrication induced by near-field exposure from a nanosecond laser pulse O Watanabe, T Ikawa, M Hasegawa, M Tsuchimori, Y Kawata Applied Physics Letters 79 (9), 1366-1368, 2001 | 61 | 2001 |
| Identification of meflin as a potential marker for mesenchymal stromal cells K Maeda, A Enomoto, A Hara, N Asai, T Kobayashi, A Horinouchi, ... Scientific reports 6 (1), 1-15, 2016 | 59 | 2016 |
| Generalized hierarchical encryption of JPEG 2000 codestreams for access control S Imaizumi, O Watanabe, M Fujiyoshi, H Kiya IEEE International Conference on Image Processing 2005 2, II-1094, 2005 | 58 | 2005 |
| Non-inductive plasma initiation and plasma current ramp-up on the TST-2 spherical tokamak Y Takase, A Ejiri, H Kakuda, T Oosako, T Shinya, T Wakatsuki, T Ambo, ... Nuclear Fusion 53 (6), 063006, 2013 | 56 | 2013 |
| Simple sampling techniques for discovery science O Watanabe IEICE Transactions on Information and Systems 83 (1), 19-26, 2000 | 56 | 2000 |
Jose L. BalcazarProfessor, Computer Science, Universitat Politècnica de CatalunyaVerified email at upc.edu
