Follow
Osamu Watanabe
Osamu Watanabe
Verified email at c.titech.ac.jp
Title
Cited by
Cited by
Year
MadaBoost: A modification of AdaBoost
C Domingo, O Watanabe
COLT, 180-189, 2000
2792000
On polynomial time bounded truth-table reducibility of NP sets to sparse sets
M Ogiwara, O Watanabe
Proceedings of the twenty-second annual ACM symposium on Theory of computing …, 1990
1981990
Inhibition of HIV-1 protease by water-soluble lignin-like substance from an edible mushroom, Fuscoporia obliqua
T Ichimura, O Watanabe, S Maruyama
Bioscience, biotechnology, and biochemistry 62 (3), 575-577, 1998
1521998
Expression of twist and wnt in human breast cancer
O Watanabe, H Imamura, T Shimizu, J Kinoshita, T Okabe, A Hirano, ...
Anticancer research 24 (6), 3851-3856, 2004
1442004
New collapse consequences of NP having small circuits
J Köbler, O Watanabe
SIAM Journal on Computing 28 (1), 311-324, 1998
1381998
Adaptive sampling methods for scaling up knowledge discovery algorithms
C Domingo, R Gavalda, O Watanabe
Data Mining and Knowledge Discovery 6, 131-152, 2002
1242002
A Probabilistic 3—SAT Algorithm Further Improved
T Hofmeister, U Schöning, R Schuler, O Watanabe
STACS 2002: 19th Annual Symposium on Theoretical Aspects of Computer Science …, 2002
1102002
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
1061997
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
1022018
Polynomial-time 1-Turing reductions from# PH to# P
S Toda, O Watanabe
Theoretical Computer Science 100 (1), 205-221, 1992
1011992
Instance complexity
P Orponen, KI Ko, U Schöning, O Watanabe
Journal of the ACM (JACM) 41 (1), 96-121, 1994
861994
A random sampling technique for training support vector machines: For primal-form maximal-margin classifiers
J Balcįzar, Y Dai, O Watanabe
Algorithmic Learning Theory: 12th International Conference, ALT 2001 …, 2001
852001
A comparison of polynomial time completeness notions
O Watanabe
Theoretical Computer Science 54 (2-3), 249-265, 1987
851987
Relationship between the morphological and biological characteristics of intraductal components accompanying invasive ductal breast carcinoma and patient age
H Imamura, S Haga, T Shimizu, O Watanabe, J Kinoshita, H Nagumo, ...
Breast cancer research and treatment 62, 177-184, 2000
802000
How hard are sparse sets?
LA Hemachandra, M Ogiwara, O Watanabe
1992 Seventh Annual Structure in Complexity Theory Conference, 222,223,224 …, 1992
771992
Expression of cyclooxygenase-2 in malignant and benign breast tumors.
O Watanabe, T Shimizu, H Imamura, J Kinoshita, Y Utada, T Okabe, ...
Anticancer research 23 (4), 3215-3221, 2003
762003
Kolmogorov complexity and computational complexity
O Watanabe
Springer, 1992
751992
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
712016
Expression of a CD44 variant and VEGF-C and the implications for lymphatic metastasis and long-term prognosis of human breast cancer.
O Watanabe, J Kinoshita, T Shimizu, H Imamura, A Hirano, T Okabe, ...
Journal of Experimental & Clinical Cancer Research: CR 24 (1), 75-82, 2005
672005
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
652015
The system can't perform the operation now. Try again later.
Articles 1–20