The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Osamu Watanabe: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. José L. Balcázar, Josep Díaz, Ricard Gavaldà, Osamu Watanabe
    A Note on the Query Complexity of Learning DFA (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ALT, 1992, pp:53-62 [Conf]
  2. José L. Balcázar, Yang Dai, Osamu Watanabe
    A Random Sampling Technique for Training Support Vector Machines. [Citation Graph (0, 0)][DBLP]
    ALT, 2001, pp:119-134 [Conf]
  3. Carlos Domingo, Tatsuie Tsukiji, Osamu Watanabe
    Partial Occam's Razor and Its Applications. [Citation Graph (0, 0)][DBLP]
    ALT, 1997, pp:85-99 [Conf]
  4. Kohei Hatano, Osamu Watanabe
    Learning r-of-k Functions by Boosting. [Citation Graph (0, 0)][DBLP]
    ALT, 2004, pp:114-126 [Conf]
  5. Osamu Watanabe
    Sequential Sampling Techniques for Algorithmic Learning Theory. [Citation Graph (0, 0)][DBLP]
    ALT, 2000, pp:27-40 [Conf]
  6. José L. Balcázar, Ricard Gavaldà, Osamu Watanabe
    Coding Complexity: The Computational Complexity of Succinct Descriptions. [Citation Graph (0, 0)][DBLP]
    Advances in Algorithms, Languages, and Complexity, 1997, pp:73-91 [Conf]
  7. Eric Allender, Lane A. Hemachandra, Mitsunori Ogiwara, Osamu Watanabe
    Relating Equivalence and Reducibility to Sparse Sets. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1991, pp:220-229 [Conf]
  8. Ricard Gavaldà, Osamu Watanabe
    On the Computational Complexity of Small Descriptions. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1991, pp:89-101 [Conf]
  9. Lane A. Hemachandra, Mitsunori Ogiwara, Osamu Watanabe
    How Hard Are Sparse Sets? [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1992, pp:222-238 [Conf]
  10. Ker-I Ko, Pekka Orponen, Uwe Schöning, Osamu Watanabe
    What Is a Hard Instance of a Computational Problem?. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1986, pp:197-217 [Conf]
  11. Wolfgang Lindner, Rainer Schuler, Osamu Watanabe
    Resource Bounded Measure and Learnability. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1998, pp:261-0 [Conf]
  12. Mitsunori Ogiwara, Thomas Thierauf, Seinosuke Toda, Osamu Watanabe
    On Closure Properties of #P in the Context of PF°#P. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1993, pp:139-146 [Conf]
  13. Mitsunori Ogiwara, Osamu Watanabe
    On Polynominal Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets (Abstract). [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1990, pp:2- [Conf]
  14. Rainer Schuler, Osamu Watanabe
    Towards Average-Case Complexity Analysis of NP Optimization Problems. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1995, pp:148-159 [Conf]
  15. Osamu Watanabe
    Test Instance Generation for Promise NP Search Problems. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1994, pp:205-216 [Conf]
  16. Osamu Watanabe, Shouwen Tang
    On Polynomial Time Turing and Many-One Completeness in PSPACE. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1989, pp:15-23 [Conf]
  17. Jin-yi Cai, Osamu Watanabe
    On Proving Circuit Lower Bounds against the Polynomial-Time Hierarchy: Positive and Negative Results. [Citation Graph (0, 0)][DBLP]
    COCOON, 2003, pp:202-211 [Conf]
  18. Lane A. Hemaspaandra, Zhigen Jiang, Jörg Rothe, Osamu Watanabe
    The Join Can Lower Complexity. [Citation Graph (0, 0)][DBLP]
    COCOON, 1996, pp:260-267 [Conf]
  19. Peter Bro Miltersen, N. V. Vinodchandran, Osamu Watanabe
    Super-Polynomial Versus Half-Exponential Circuit Size in the Exponential Hierarchy. [Citation Graph (0, 0)][DBLP]
    COCOON, 1999, pp:210-220 [Conf]
  20. Kyoichi Okamoto, Osamu Watanabe
    Deterministic Application of Grover's Quantum Search Algorithm. [Citation Graph (0, 0)][DBLP]
    COCOON, 2001, pp:493-501 [Conf]
  21. José L. Balcázar, Josep Díaz, Ricard Gavaldà, Osamu Watanabe
    An Optimal Parallel Algorithm for Learning DFA. [Citation Graph (0, 0)][DBLP]
    COLT, 1994, pp:208-217 [Conf]
  22. Carlos Domingo, Osamu Watanabe
    MadaBoost: A Modification of AdaBoost. [Citation Graph (0, 0)][DBLP]
    COLT, 2000, pp:180-189 [Conf]
  23. Carlos Domingo, Ricard Gavaldà, Osamu Watanabe
    Practical Algorithms for On-line Sampling. [Citation Graph (0, 0)][DBLP]
    Discovery Science, 1998, pp:150-161 [Conf]
  24. Carlos Domingo, Ricard Gavaldà, Osamu Watanabe
    Adaptive Sampling Methods for Scaling Up Knowledge Discovery Algorithms. [Citation Graph (0, 0)][DBLP]
    Discovery Science, 1999, pp:172-183 [Conf]
  25. Osamu Watanabe
    Algorithmic Aspects of Boosting. [Citation Graph (0, 0)][DBLP]
    Progress in Discovery Science, 2002, pp:349-359 [Conf]
  26. Jin-yi Cai, Osamu Watanabe
    Stringent Relativization. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2003, pp:408-419 [Conf]
  27. Ronald V. Book, Pekka Orponen, David A. Russo, Osamu Watanabe
    On Exponential Lowness. [Citation Graph (0, 0)][DBLP]
    ICALP, 1986, pp:40-49 [Conf]
  28. Johannes Köbler, Osamu Watanabe
    New Collapse Consequences of NP Having Small Circuits. [Citation Graph (0, 0)][DBLP]
    ICALP, 1995, pp:196-207 [Conf]
  29. Osamu Watanabe
    On <=^P_{1-tt}-Sparseness and Nondeterministic Complexity Classes (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:697-709 [Conf]
  30. Osamu Watanabe
    A Formal Study of Learning via Queries. [Citation Graph (0, 0)][DBLP]
    ICALP, 1990, pp:139-152 [Conf]
  31. Osamu Watanabe
    From Computational Learning Theory to Discovery Science. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:134-148 [Conf]
  32. José L. Balcázar, Yang Dai, Osamu Watanabe
    Provably Fast Training Algorithms for Support Vector Machines. [Citation Graph (0, 0)][DBLP]
    ICDM, 2001, pp:43-50 [Conf]
  33. Hitoshi Kiya, Shoko Imaizumi, Osamu Watanabe
    Partial-scrambling of images encoded using JPEG2000 without generating marker codes. [Citation Graph (0, 0)][DBLP]
    ICIP (3), 2003, pp:205-208 [Conf]
  34. Osamu Watanabe, Akiko Nakazaki, Hitoshi Kiya
    A fast image-scramble method using public-key encryption allowing backward compatibility with jpeg2000. [Citation Graph (0, 0)][DBLP]
    ICIP, 2004, pp:3435-3438 [Conf]
  35. Shoko Imaizumi, Osamu Watanabe, Masaaki Fujiyoshi, Hitoshi Kiya
    Generalized hierarchical encryption of JPEG 2000 codestreams for access control. [Citation Graph (0, 0)][DBLP]
    ICIP (2), 2005, pp:1094-1097 [Conf]
  36. Akio Kawana, Shinya Tsuzuki, Osamu Watanabe
    Analysis of Dynamics of Cultured Neuronal Networks Using I&F Model. [Citation Graph (0, 0)][DBLP]
    ICONIP (1), 2006, pp:547-553 [Conf]
  37. Osamu Watanabe
    A Neural Model for Stereo Transparency with the Population of the Disparity Energy Models. [Citation Graph (0, 0)][DBLP]
    ICONIP (1), 2006, pp:165-174 [Conf]
  38. Ronald V. Book, Osamu Watanabe
    On Random Hard Sets for NP. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1994, pp:47-55 [Conf]
  39. Jin-yi Cai, Osamu Watanabe
    Random Access to Advice Strings and Collapsing Results. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:209-220 [Conf]
  40. Satoshi Horie, Osamu Watanabe
    Hard Instance Generation for SAT (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ISAAC, 1997, pp:22-31 [Conf]
  41. Kaoru Kurosawa, Osamu Watanabe
    Computational and Statistical Indistinguishabilities. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1992, pp:430-438 [Conf]
  42. Luc Longpré, Osamu Watanabe
    On Symmetry of Information and Polynomial Time Invertibility. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1992, pp:410-419 [Conf]
  43. Mikael Onsjö, Osamu Watanabe
    A Simple Message Passing Algorithm for Graph Partitioning Problems. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2006, pp:507-516 [Conf]
  44. Osamu Watanabe, Osamu Yamashita
    An Improvement of the Digital Cash Protocol of Okamoto and Ohta. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1996, pp:436-445 [Conf]
  45. Osamu Watanabe, Hitoshi Kiya
    ROI-based scalability for progressive transmission in JPEG2000 coding. [Citation Graph (0, 0)][DBLP]
    ISCAS (2), 2003, pp:416-419 [Conf]
  46. Osamu Watanabe, Akiko Nakazaki, Hitoshi Kiya
    A scalable encryption method allowing backward compatibility with JPEG2000 images. [Citation Graph (0, 0)][DBLP]
    ISCAS (6), 2005, pp:6324-6327 [Conf]
  47. Ricard Gavaldà, Leen Torenvliet, Osamu Watanabe, José L. Balcázar
    Generalized Kolmogorov Complexity in Relativized Separations (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    MFCS, 1990, pp:269-276 [Conf]
  48. Osamu Watanabe
    On the Complexity of Small Description and Related Topics. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:82-94 [Conf]
  49. Carlos Domingo, Osamu Watanabe
    Scaling Up a Boosting-Based Learner via Adaptive Sampling. [Citation Graph (0, 0)][DBLP]
    PAKDD, 2000, pp:317-328 [Conf]
  50. Kazuyuki Amano, John Tromp, Paul M. B. Vitányi, Osamu Watanabe
    On a Generalized Ruin Problem. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2001, pp:181-191 [Conf]
  51. Carlos Domingo, Osamu Watanabe, Tadashi Yamazaki
    A Role of Constraint in Self-Organization. [Citation Graph (0, 0)][DBLP]
    RANDOM, 1998, pp:307-318 [Conf]
  52. Ricard Gavaldà, Osamu Watanabe
    Sequential Sampling Algorithms: Unified Analysis and Lower Bounds. [Citation Graph (0, 0)][DBLP]
    SAGA, 2001, pp:173-188 [Conf]
  53. Osamu Watanabe
    Some Heuristic Analysis of Local Search Algorithms for SAT Problems. [Citation Graph (0, 0)][DBLP]
    SAGA, 2005, pp:14-25 [Conf]
  54. Osamu Watanabe, Takeshi Sawai, Hayato Takahashi
    Analysis of Randomized Local Search Algorithm for LDPCC Decoding Problem. [Citation Graph (0, 0)][DBLP]
    SAGA, 2003, pp:50-60 [Conf]
  55. Osamu Watanabe, Masaki Yamamoto
    Average-Case Analysis for the MAX-2SAT Problem. [Citation Graph (0, 0)][DBLP]
    SAT, 2006, pp:277-282 [Conf]
  56. Osamu Watanabe, Seinosuke Toda
    Structural Analyses on the Complexity of Inverting Functions. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:31-38 [Conf]
  57. Osamu Watanabe
    How Can Computer Science Contribute to Knowledge Discovery? [Citation Graph (0, 0)][DBLP]
    SOFSEM, 2001, pp:136-151 [Conf]
  58. Shin Aida, Marcel Crâsmaru, Kenneth W. Regan, Osamu Watanabe
    Games with a Uniqueness Property. [Citation Graph (0, 0)][DBLP]
    STACS, 2002, pp:396-407 [Conf]
  59. Shin Aida, Rainer Schuler, Tatsuie Tsukiji, Osamu Watanabe
    On the Difference between Polynomial-Time Many-One and Truth-Table Reducibilities on Distributional Problems. [Citation Graph (0, 0)][DBLP]
    STACS, 2001, pp:51-62 [Conf]
  60. Thomas Hofmeister, Uwe Schöning, Rainer Schuler, Osamu Watanabe
    A Probabilistic 3-SAT Algorithm Further Improved. [Citation Graph (0, 0)][DBLP]
    STACS, 2002, pp:192-202 [Conf]
  61. Thomas Thierauf, Seinosuke Toda, Osamu Watanabe
    On Sets Bounded Truth-Table Reducible to P-selective Sets. [Citation Graph (0, 0)][DBLP]
    STACS, 1994, pp:427-438 [Conf]
  62. Mitsunori Ogiwara, Osamu Watanabe
    On Polynomial Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets [Citation Graph (0, 0)][DBLP]
    STOC, 1990, pp:457-467 [Conf]
  63. Hoong Chuin Lau, Osamu Watanabe
    Randomized Approximation of the Constraint Satisfaction Problem (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SWAT, 1996, pp:76-87 [Conf]
  64. Jin-yi Cai, Osamu Watanabe
    Random Access to Advice Strings and Collapsing Results. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:46, n:1, pp:43-57 [Journal]
  65. Thomas Thierauf, Seinosuke Toda, Osamu Watanabe
    On Closure Properties of GapP. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1994, v:4, n:, pp:242-261 [Journal]
  66. Satoshi Horie, Osamu Watanabe
    Hard instance generation for SAT [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  67. Lane A. Hemaspaandra, Zhigen Jiang, Jörg Rothe, Osamu Watanabe
    Polynomial-Time Multi-Selectivity [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  68. Lane A. Hemaspaandra, Zhigen Jiang, Jörg Rothe, Osamu Watanabe
    Boolean Operations, Joins, and the Extended Low Hierarchy [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  69. Carlos Domingo, Ricard Gavaldà, Osamu Watanabe
    Practical algorithms for on-line sampling [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  70. Carlos Domingo, Osamu Watanabe, Tadashi Yamazaki
    A role of constraint in self-organization [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  71. Carlos Domingo, Ricard Gavaldà, Osamu Watanabe
    Adaptive Sampling Methods for Scaling Up Knowledge Discovery Algorithms. [Citation Graph (0, 0)][DBLP]
    Data Min. Knowl. Discov., 2002, v:6, n:2, pp:131-152 [Journal]
  72. Ronald V. Book, Osamu Watanabe
    A view of structural complexity theory. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1989, v:39, n:, pp:122-138 [Journal]
  73. Shin Aida, Rainer Schuler, Tatsuie Tsukiji, Osamu Watanabe
    On the difference between polynomial-time many-one and truth-table reducibilities on distributional problems [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:81, pp:- [Journal]
  74. Eric Allender, Osamu Watanabe
    Kolmogorov Complexity and Degrees of Tally Sets [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1990, v:86, n:2, pp:160-178 [Journal]
  75. Ronald V. Book, Osamu Watanabe
    On Random Hard Sets for NP. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1996, v:125, n:1, pp:70-76 [Journal]
  76. Luc Longpré, Osamu Watanabe
    On Symmetry of Information and Polynomial Time Invertibility [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:121, n:1, pp:14-22 [Journal]
  77. Jin-yi Cai, Osamu Watanabe
    Relativized collapsing between BPP and PH under stringent oracle access. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:90, n:3, pp:147-154 [Journal]
  78. Carlos Domingo, Tatsuie Tsukiji, Osamu Watanabe
    Partial Occam's Razor and its Applications. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:64, n:4, pp:179-185 [Journal]
  79. Ryoichi Kato, Osamu Watanabe
    Substring search and repeat search using factor oracles. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:93, n:6, pp:269-274 [Journal]
  80. Rajesh P. N. Rao, Jörg Rothe, Osamu Watanabe
    Corrigendum to "Upward separation for FewP and related classes". [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:74, n:1-2, pp:89- [Journal]
  81. Rajesh P. N. Rao, Jörg Rothe, Osamu Watanabe
    Upward Separation for FewP and Related Classes. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:52, n:4, pp:175-180 [Journal]
  82. Osamu Watanabe
    Another Application of Recursion Introduction. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1980, v:10, n:3, pp:116-119 [Journal]
  83. Osamu Watanabe
    A Fast Algorithm for Finding all Shortest Paths. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:13, n:1, pp:1-3 [Journal]
  84. Osamu Watanabe
    On Hardness of One-Way Functions. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1988, v:27, n:3, pp:151-157 [Journal]
  85. Thomas Thierauf, Seinosuke Toda, Osamu Watanabe
    On Sets Bounded Truth-Table Reducible to P-Selective Sets. [Citation Graph (0, 0)][DBLP]
    ITA, 1996, v:30, n:2, pp:135-154 [Journal]
  86. Pekka Orponen, Ker-I Ko, Uwe Schöning, Osamu Watanabe
    Instance Complexity. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1994, v:41, n:1, pp:96-121 [Journal]
  87. Mitsunori Ogihara, Thomas Thierauf, Seinosuke Toda, Osamu Watanabe
    On Closure Properties of #P in the Context of PF ° #P. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1996, v:53, n:2, pp:171-179 [Journal]
  88. Osamu Watanabe
    On Polynomial Time One-Truth-Table Reducibility to a Sparse Set. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1992, v:44, n:3, pp:500-516 [Journal]
  89. José L. Balcázar, Josep Díaz, Ricard Gavaldà, Osamu Watanabe
    An Optimal Parallel Algorithm for Learning DFA. [Citation Graph (0, 0)][DBLP]
    J. UCS, 1996, v:2, n:3, pp:97-112 [Journal]
  90. Lane A. Hemaspaandra, Zhigen Jiang, Jörg Rothe, Osamu Watanabe
    Polynomial-Time Multi-Selectivity. [Citation Graph (0, 0)][DBLP]
    J. UCS, 1997, v:3, n:3, pp:197-229 [Journal]
  91. Shin Aida, Marcel Crâsmaru, Kenneth W. Regan, Osamu Watanabe
    Games with Uniqueness Properties. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2004, v:37, n:1, pp:29-47 [Journal]
  92. Shin Aida, Rainer Schuler, Tatsuie Tsukiji, Osamu Watanabe
    The Difference between Polynomial-Time Many-One and Truth-Table Reducibilities on Distributional Problems. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2002, v:35, n:4, pp:449-463 [Journal]
  93. Wolfgang Lindner, Rainer Schuler, Osamu Watanabe
    Resource-Bounded Measure and Learnability. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2000, v:33, n:2, pp:151-170 [Journal]
  94. Osamu Watanabe
    A Framework for Polynomial-Time Query Learnability. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1994, v:27, n:3, pp:211-229 [Journal]
  95. Osamu Watanabe, Ricard Gavaldà
    Structural Analysis of Polynomial-Time Query Learnability. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1994, v:27, n:3, pp:231-256 [Journal]
  96. Osamu Watanabe, Seinosuke Toda
    Structural Analysis of the Complexity of Inverse Functions. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1993, v:26, n:2, pp:203-214 [Journal]
  97. Osamu Watanabe
    On Intractability of the Class UP. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1991, v:24, n:1, pp:1-10 [Journal]
  98. José L. Balcázar, Josep Díaz, Ricard Gavaldà, Osamu Watanabe
    The Query Complexity of Learning DFA. [Citation Graph (0, 0)][DBLP]
    New Generation Comput., 1994, v:12, n:4, pp:337-358 [Journal]
  99. Hoong Chuin Lau, Osamu Watanabe
    Randomized Approximation of the Constraint Satisfaction Problem. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1996, v:3, n:4, pp:405-424 [Journal]
  100. Osamu Watanabe, Kunihiko Fukushima
    Stereo algorithm that extracts a depth cue from interocularly unpaired points. [Citation Graph (0, 0)][DBLP]
    Neural Networks, 1999, v:12, n:4-5, pp:569-578 [Journal]
  101. Osamu Watanabe, Masanori Idesawa
    Computational model for neural representation of multiple disparities. [Citation Graph (0, 0)][DBLP]
    Neural Networks, 2003, v:16, n:1, pp:25-37 [Journal]
  102. Osamu Watanabe, Masayuki Kikuchi
    Nonlinearity of the population activity to transparent motion. [Citation Graph (0, 0)][DBLP]
    Neural Networks, 2005, v:18, n:1, pp:15-22 [Journal]
  103. Eric Allender, Lane A. Hemachandra, Mitsunori Ogiwara, Osamu Watanabe
    Relating Equivalence and Reducibility to Sparse Sets. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:3, pp:521-539 [Journal]
  104. Ronald V. Book, Pekka Orponen, David A. Russo, Osamu Watanabe
    Lowness Properties of Sets in the Exponential-Time Hierarchy. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1988, v:17, n:3, pp:504-516 [Journal]
  105. Jin-yi Cai, Osamu Watanabe
    On Proving Circuit Lower Bounds against the Polynomial-Time Hierarchy. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:4, pp:984-1009 [Journal]
  106. Ricard Gavaldà, Osamu Watanabe
    On the Computational Complexity of Small Descriptions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:6, pp:1257-1275 [Journal]
  107. Johannes Köbler, Osamu Watanabe
    New Collapse Consequences of NP Having Small Circuits. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:1, pp:311-324 [Journal]
  108. Mitsunori Ogiwara, Osamu Watanabe
    On Polynomial-Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1991, v:20, n:3, pp:471-483 [Journal]
  109. Shouwen Tang, Osamu Watanabe
    On Tally Relativizations of BP-Complexity Classes. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1989, v:18, n:3, pp:449-462 [Journal]
  110. Lane A. Hemaspaandra, Zhigen Jiang, Jörg Rothe, Osamu Watanabe
    Boolean Operations, Joins, and the Extended Low Hierarchy. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:205, n:1-2, pp:317-327 [Journal]
  111. Seinosuke Toda, Osamu Watanabe
    Polynomial Time 1-Turing Reductions from #PH to #P. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:100, n:1, pp:205-221 [Journal]
  112. Osamu Watanabe
    Sequential sampling techniques for algorithmic learning theory. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:348, n:1, pp:3-14 [Journal]
  113. Osamu Watanabe
    The Time-Precision Tradeoff Problem on On-Line Probabilistic Turing Machines. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1983, v:24, n:, pp:105-117 [Journal]
  114. Osamu Watanabe
    On One-One Polynomial Time Equivalence Relations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:38, n:, pp:157-165 [Journal]
  115. Osamu Watanabe
    A Comparison of Polynomial Time Completeness Notions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:54, n:, pp:249-265 [Journal]
  116. Osamu Watanabe
    On the p-Isomorphism Conjecture. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:83, n:2, pp:337-343 [Journal]
  117. Osamu Watanabe, Arun Sharma
    Preface [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:288, n:2, pp:195-196 [Journal]
  118. Osamu Watanabe, Shouwen Tang
    On Polynomial-Time Turing and Many-One Completeness in PSPACE. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:97, n:2, pp:199-215 [Journal]
  119. Osamu Watanabe, Mikael Onsjö
    Finding Most Likely Solutions. [Citation Graph (0, 0)][DBLP]
    CiE, 2007, pp:758-767 [Conf]
  120. Edith Hemaspaandra, Lane A. Hemaspaandra, Till Tantau, Osamu Watanabe
    On the Complexity of Kings. [Citation Graph (0, 0)][DBLP]
    FCT, 2007, pp:328-340 [Conf]
  121. Masaaki Fujiyoshi, Wataru Saitou, Osamu Watanabe, Hitoshi Kiya
    Hierarchical Encryption of Multimedia Contents for Access Control. [Citation Graph (0, 0)][DBLP]
    ICIP, 2006, pp:1977-1980 [Conf]
  122. Toshiya Itoh, Osamu Watanabe
    Weighted Random Popular Matchings [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  123. Thomas Hofmeister, Uwe Schöning, Rainer Schuler, Osamu Watanabe
    Randomized Algorithms for 3-SAT. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2007, v:40, n:3, pp:249-262 [Journal]

  124. Scale Free Interval Graphs. [Citation Graph (, )][DBLP]


  125. Propagation Connectivity of Random Hypergraphs. [Citation Graph (, )][DBLP]


  126. One-Way Functions and the Berman-Hartmanis Conjecture. [Citation Graph (, )][DBLP]


  127. Identification of JPEG 2000 images in encrypted domain for digital cinema. [Citation Graph (, )][DBLP]


  128. A new structure of lifting wavelet for reducing rounding error. [Citation Graph (, )][DBLP]


  129. A New Model for a Scale-Free Hierarchical Structure of Isolated Cliques. [Citation Graph (, )][DBLP]


  130. An extension of ROI-based scalability for progressive transmission in JPEG2000 coding. [Citation Graph (, )][DBLP]


  131. A Replacement Model for a Scale-Free Property of Cliques. [Citation Graph (, )][DBLP]


  132. A new class of lifting wavelet transform for guaranteeing losslessness of specific signals. [Citation Graph (, )][DBLP]


  133. The Complexity of Kings [Citation Graph (, )][DBLP]


Search in 0.022secs, Finished in 0.025secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002