| |
 |      |
                                            |
Note: Links lead to the DBLP on the Web. Osamu Watanabe 87 Osamu Watanabe: Algorithmic Aspects of Boosting. Progress in Discovery Science 2002 : 349-359 86 Thomas Hofmeister , Uwe Schöning , Rainer Schuler , Osamu Watanabe: A Probabilistic 3-SAT Algorithm Further Improved. STACS 2002 : 192-202 85 Shin Aida , Marcel Crasmaru , Kenneth W. Regan , Osamu Watanabe: Games with a Uniqueness Property. STACS 2002 : 396-407 84 Carlos Domingo , Ricard Gavaldà , Osamu Watanabe: Adaptive Sampling Methods for Scaling Up Knowledge Discovery Algorithms. Data Mining and Knowledge Discovery 6 (2): 131-152 (2002) 83 José L. Balcázar , Yang Dai , Osamu Watanabe: A Random Sampling Technique for Training Support Vector Machines. ALT 2001 : 119-134 82 Kyoichi Okamoto , Osamu Watanabe: Deterministic Application of Grover's Quantum Search Algorithm. COCOON 2001 : 493-501 81 José L. Balcázar , Yang Dai , Osamu Watanabe: Provably Fast Training Algorithms for Support Vector Machines. ICDM 2001 : 43-50 80 Kazuyuki Amano , John Tromp , Paul M. B. Vitányi , Osamu Watanabe: On a Generalized Ruin Problem. RANDOM-APPROX 2001 : 181-191 79 Ricard Gavaldà , Osamu Watanabe: Sequential Sampling Algorithms: Unified Analysis and Lower Bounds. SAGA 2001 : 173-188 78 Osamu Watanabe: How Can Computer Science Contribute to Knowledge Discovery? SOFSEM 2001 : 136-151 77 Shin Aida , Rainer Schuler , Tatsuie Tsukiji , Osamu Watanabe: On the Difference between Polynomial-Time Many-One and Truth-Table Reducibilities on Distributional Problems. STACS 2001 : 51-62 76 Jan van Leeuwen , Osamu Watanabe, Masami Hagiya , Peter D. Mosses , Takayasu Ito : Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics, International Conference IFIP TCS 2000, Sendai, Japan, August 17-19, 2000, Proceedings. Springer 2000 75 Osamu Watanabe: Sequential Sampling Techniques for Algorithmic Learning Theory. ALT 2000 : 27-40 74 Carlos Domingo , Osamu Watanabe: MadaBoost: A Modification of AdaBoost. COLT 2000 : 180-189 73 Carlos Domingo , Osamu Watanabe: Scaling Up a Boosting-Based Learner via Adaptive Sampling. PAKDD 2000 : 317-328 72 Shin Aida , Rainer Schuler , Tatsuie Tsukiji , Osamu Watanabe: On the difference between polynomial-time many-one and truth-table reducibilities on distributional problems. Electronic Colloquium on Computational Complexity (ECCC) 7 (81): (2000) 71 Rajesh P. N. Rao , Jörg Rothe , Osamu Watanabe: Corrigendum to "Upward separation for FewP and related classes". Information Processing Letters 74 (1-2): 89 (2000) 70 Wolfgang Lindner , Rainer Schuler , Osamu Watanabe: Resource-Bounded Measure and Learnability. Theory of Computing Systems 33 (2): 151-170 (2000) 69 Osamu Watanabe, Takashi Yokomori : Algorithmic Learning Theory, 10th International Conference, ALT '99, Tokyo, Japan, December 6-8, 1999, Proceedings. Springer 1999 68 Peter Bro Miltersen , N. V. Vinodchandran , Osamu Watanabe: Super-Polynomial Versus Half-Exponential Circuit Size in the Exponential Hierarchy. COCOON 1999 : 210-220 67 Carlos Domingo , Ricard Gavaldà , Osamu Watanabe: Adaptive Sampling Methods for Scaling Up Knowledge Discovery Algorithms. Discovery Science 1999 : 172-183 66 Osamu Watanabe: From Computational Learning Theory to Discovery Science. ICALP 1999 : 134-148 65 Carlos Domingo , Ricard Gavaldà , Osamu Watanabe: Practical Algorithms for On-line Sampling. Discovery Science 1998 : 150-161 64 Wolfgang Lindner , Rainer Schuler , Osamu Watanabe: Resource Bounded Measure and Learnability. IEEE Conference on Computational Complexity 1998 : 261- 63 Carlos Domingo , Osamu Watanabe, Tadashi Yamazaki : A Role of Constraint in Self-Organization. RANDOM 1998 : 307-318 62 Johannes Köbler , Osamu Watanabe: New Collapse Consequences of NP Having Small Circuits. SIAM J. Comput. 28 (1): 311-324 (1998) 61 Lane A. Hemaspaandra , Zhigen Jiang , Jörg Rothe , Osamu Watanabe: Boolean Operations, Joins, and the Extended Low Hierarchy. TCS 205 (1-2): 317-327 (1998) 60 Carlos Domingo , Tatsuie Tsukiji , Osamu Watanabe: Partial Occam's Razor and Its Applications. ALT 1997 : 85-99 59 José L. Balcázar , Ricard Gavaldà , Osamu Watanabe: Coding Complexity: The Computational Complexity of Succinct Descriptions. Advances in Algorithms, Languages, and Complexity 1997 : 73-91 58 Satoshi Horie , Osamu Watanabe: Hard Instance Generation for SAT (Extended Abstract). ISAAC 1997 : 22-31 57 Carlos Domingo , Tatsuie Tsukiji , Osamu Watanabe: Partial Occam's Razor and its Applications. Information Processing Letters 64 (4): 179-185 (1997) 56 Lane A. Hemaspaandra , Zhigen Jiang , Jörg Rothe , Osamu Watanabe: Polynomial-Time Multi-Selectivity. Journal of Universal Computer Science 3 (3): 197-229 (1997) 55 Lane A. Hemaspaandra , Zhigen Jiang , Jörg Rothe , Osamu Watanabe: The Join Can Lower Complexity. COCOON 1996 : 260-267 54 Osamu Watanabe, Osamu Yamashita : An Improvement of the Digital Cash Protocol of Okamoto and Ohta. ISAAC 1996 : 436-445 53 Hoong Chuin Lau , Osamu Watanabe: Randomized Approximation of the Constraint Satisfaction Problem (Extended Abstract). SWAT 1996 : 76-87 52 Thomas Thierauf , Seinosuke Toda , Osamu Watanabe: On Sets Bounded Truth-Table Reducible to P-Selective Sets. ITA 30 (2): 135-154 (1996) 51 Ronald V. Book , Osamu Watanabe: On Random Hard Sets for NP. Information and Computation 125 (1): 70-76 (1996) 50 Mitsunori Ogihara , Thomas Thierauf , Seinosuke Toda , Osamu Watanabe: On Closure Properties of #P in the Context of PF ° #P. JCSS 53 (2): 171-179 (1996) 49 José L. Balcázar , Josep Díaz , Ricard Gavaldà , Osamu Watanabe: An Optimal Parallel Algorithm for Learning DFA. Journal of Universal Computer Science 2 (3): 97-112 (1996) 48 Johannes Köbler , Osamu Watanabe: New Collapse Consequences of NP Having Small Circuits. ICALP 1995 : 196-207 47 Rainer Schuler , Osamu Watanabe: Towards Average-Case Complexity Analysis of NP Optimization Problems. Structure in Complexity Theory Conference 1995 : 148-159 46 Luc Longpré , Osamu Watanabe: On Symmetry of Information and Polynomial Time Invertibility. Information and Computation 121 (1): 14-22 (1995) 45 José L. Balcázar , Josep Díaz , Ricard Gavaldà , Osamu Watanabe: An Optimal Parallel Algorithm for Learning DFA. COLT 1994 : 208-217 44 Ronald V. Book , Osamu Watanabe: On Random Hard Sets for NP. ISAAC 1994 : 47-55 43 Thomas Thierauf , Seinosuke Toda , Osamu Watanabe: On Sets Bounded Truth-Table Reducible to P-selective Sets. STACS 1994 : 427-438 42 Osamu Watanabe: Test Instance Generation for Promise NP Search Problems. Structure in Complexity Theory Conference 1994 : 205-216 41 Thomas Thierauf , Seinosuke Toda , Osamu Watanabe: On Closure Properties of GapP. Computational Complexity 4 : 242-261 (1994) 40 Rajesh P. N. Rao , Jörg Rothe , Osamu Watanabe: Upward Separation for FewP and Related Classes. Information Processing Letters 52 (4): 175-180 (1994) 39 Pekka Orponen , Ker-I Ko , Uwe Schöning , Osamu Watanabe: Instance Complexity. JACM 41 (1): 96-121 (1994) 38 Osamu Watanabe: A Framework for Polynomial-Time Query Learnability. Mathematical Systems Theory 27 (3): 211-229 (1994) 37 Osamu Watanabe, Ricard Gavaldà : Structural Analysis of Polynomial-Time Query Learnability. Mathematical Systems Theory 27 (3): 231-256 (1994) 36 José L. Balcázar , Josep Díaz , Ricard Gavaldà , Osamu Watanabe: The Query Complexity of Learning DFA. New Generation Computing 12 (4): 337-358 (1994) 35 Mitsunori Ogiwara , Thomas Thierauf , Seinosuke Toda , Osamu Watanabe: On Closure Properties of #P in the Context of PF°#P. Structure in Complexity Theory Conference 1993 : 139-146 34 Osamu Watanabe, Seinosuke Toda : Structural Analysis of the Complexity of Inverse Functions. Mathematical Systems Theory 26 (2): 203-214 (1993) 33 Ricard Gavaldà , Osamu Watanabe: On the Computational Complexity of Small Descriptions. SIAM J. Comput. 22 (6): 1257-1275 (1993) 32 José L. Balcázar , Josep Díaz , Ricard Gavaldà , Osamu Watanabe: A Note on the Query Complexity of Learning DFA (Extended Abstract). ALT 1992 : 53-62 31 Luc Longpré , Osamu Watanabe: On Symmetry of Information and Polynomial Time Invertibility. ISAAC 1992 : 410-419 30 Kaoru Kurosawa , Osamu Watanabe: Computational and Statistical Indistinguishabilities. ISAAC 1992 : 430-438 29 Osamu Watanabe: On the Complexity of Small Description and Related Topics. MFCS 1992 : 82-94 28 Lane A. Hemachandra , Mitsunori Ogiwara , Osamu Watanabe: How Hard Are Sparse Sets? Structure in Complexity Theory Conference 1992 : 222-238 27 Osamu Watanabe: On Polynomial Time One-Truth-Table Reducibility to a Sparse Set. JCSS 44 (3): 500-516 (1992) 26 Eric Allender , Lane A. Hemachandra , Mitsunori Ogiwara , Osamu Watanabe: Relating Equivalence and Reducibility to Sparse Sets. SIAM J. Comput. 21 (3): 521-539 (1992) 25 Seinosuke Toda , Osamu Watanabe: Polynomial Time 1-Turing Reductions from #PH to #P. TCS 100 (1): 205-221 (1992) 24 Osamu Watanabe, Shouwen Tang : On Polynomial-Time Turing and Many-One Completeness in PSPACE. TCS 97 (2): 199-215 (1992) 23 Eric Allender , Lane A. Hemachandra , Mitsunori Ogiwara , Osamu Watanabe: Relating Equivalence and Reducibility to Sparse Sets. Structure in Complexity Theory Conference 1991 : 220-229 22 Ricard Gavaldà , Osamu Watanabe: On the Computational Complexity of Small Descriptions. Structure in Complexity Theory Conference 1991 : 89-101 21 Osamu Watanabe: On Intractability of the Class UP. Mathematical Systems Theory 24 (1): 1-10 (1991) 20 Mitsunori Ogiwara , Osamu Watanabe: On Polynomial-Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets. SIAM J. Comput. 20 (3): 471-483 (1991) 19 Osamu Watanabe: On the p-Isomorphism Conjecture. TCS 83 (2): 337-343 (1991) 18 Osamu Watanabe: A Formal Study of Learning via Queries. ICALP 1990 : 139-152 17 Ricard Gavaldà , Leen Torenvliet , Osamu Watanabe, José L. Balcázar : Generalized Kolmogorov Complexity in Relativized Separations (Extended Abstract). MFCS 1990 : 269-276 16 Osamu Watanabe, Seinosuke Toda : Structural Analyses on the Complexity of Inverting Functions. SIGAL International Symposium on Algorithms 1990 : 31-38 15 Mitsunori Ogiwara , Osamu Watanabe: On Polynomial Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets. STOC 1990 : 457-467 14 Mitsunori Ogiwara , Osamu Watanabe: On Polynominal Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets (Abstract). Structure in Complexity Theory Conference 1990 : 2 13 Eric Allender , Osamu Watanabe: Kolmogorov Complexity and Degrees of Tally Sets. Information and Computation 86 (2): 160-178 (1990) 12 Osamu Watanabe, Shouwen Tang : On Polynomial Time Turing and Many-One Completeness in PSPACE. Structure in Complexity Theory Conference 1989 : 15-23 11 Shouwen Tang , Osamu Watanabe: On Tally Relativizations of BP-Complexity Classes. SIAM J. Comput. 18 (3): 449-462 (1989) 10 Osamu Watanabe: On <=^P_{1-tt}-Sparseness and Nondeterministic Complexity Classes (Extended Abstract). ICALP 1988 : 697-709 9 Osamu Watanabe: On Hardness of One-Way Functions. Information Processing Letters 27 (3): 151-157 (1988) 8 Ronald V. Book , Pekka Orponen , David A. Russo , Osamu Watanabe: Lowness Properties of Sets in the Exponential-Time Hierarchy. SIAM J. Comput. 17 (3): 504-516 (1988) 7 Osamu Watanabe: A Comparison of Polynomial Time Completeness Notions. TCS 54 : 249-265 (1987) 6 Ronald V. Book , Pekka Orponen , David A. Russo , Osamu Watanabe: On Exponential Lowness. ICALP 1986 : 40-49 5 Ker-I Ko , Pekka Orponen , Uwe Schöning , Osamu Watanabe: What Is a Hard Instance of a Computational Problem?. Structure in Complexity Theory Conference 1986 : 197-217 4 Osamu Watanabe: On One-One Polynomial Time Equivalence Relations. TCS 38 : 157-165 (1985) 3 Osamu Watanabe: The Time-Precision Tradeoff Problem on On-Line Probabilistic Turing Machines. TCS 24 : 105-117 (1983) 2 Osamu Watanabe: A Fast Algorithm for Finding all Shortest Paths. Information Processing Letters 13 (1): 1-3 (1981) 1 Osamu Watanabe: Another Application of Recursion Introduction. Information Processing Letters 10 (3): 116-119 (1980)  DiSC'02 © 2003 Association for Computing Machinery |
