Search the dblp DataBase

Publications of Author

1. Sanjay Jain, Hans-Ulrich Simon, Etsuji Tomita
   Editors' Introduction. [Citation Graph (0, 0)][DBLP]
   ALT, 2005, pp:1-9 [Conf]
   
2. Akinobu Miyata, Jun Tarui, Etsuji Tomita
   Learning Boolean Functions in AC⁰ on Attribute and Classification Noise. [Citation Graph (0, 0)][DBLP]
   ALT, 2004, pp:142-155 [Conf]
   
3. Dukka Bahadur, Tatsuya Akutsu, Etsuji Tomita, Tomokazu Seki
   Protein Side-chain Packing Problem: A Maximum Edge-weight Clique Algorithmic Approach. [Citation Graph (0, 0)][DBLP]
   APBC, 2004, pp:191-200 [Conf]
   
4. Dukka Bahadur, Etsuji Tomita, Jun'ichi Suzuki, Katsuhisa Horimoto, Tatsuya Akutsu
   Clique-based algorithms for protein threading with profiles and constraints. [Citation Graph (0, 0)][DBLP]
   APBC, 2005, pp:51-64 [Conf]
   
5. Tatsuya Akutsu, Morihiro Hayashida, Etsuji Tomita, Jun'ichi Suzuki, Katsuhisa Horimoto
   Protein Threading with Profiles and Constraints. [Citation Graph (0, 0)][DBLP]
   BIBE, 2004, pp:537-544 [Conf]
   
6. Etsuji Tomita, Akira Tanaka, Haruhisa Takahashi
   The Worst-Case Time Complexity for Generating All Maximal Cliques. [Citation Graph (0, 0)][DBLP]
   COCOON, 2004, pp:161-170 [Conf]
   
7. Etsuji Tomita, Tomokazu Seki
   An Efficient Branch-and-Bound Algorithm for Finding a Maximum Clique. [Citation Graph (0, 0)][DBLP]
   DMTCS, 2003, pp:278-289 [Conf]
   
8. Yasuhiro Tajima, Etsuji Tomita
   A Polynomial Time Learning Algorithm Simple Deterministic Languages via Membership Queries and a Representative Sample. [Citation Graph (0, 0)][DBLP]
   ICGI, 2000, pp:284-297 [Conf]
   
9. Mitsuo Wakatsuki, Kiyoshi Teraguchi, Etsuji Tomita
   Polynomial Time Identification of Strict Deterministic Restricted One-Counter Automata in Some Class from Positive Data. [Citation Graph (0, 0)][DBLP]
   ICGI, 2004, pp:260-272 [Conf]
   
10. Mitsuo Wakatsuki, Etsuji Tomita, Go Yamada
    A Unified Algorithm for Extending Classes of Languages Identifiable in the Limit from Positive Data. [Citation Graph (0, 0)][DBLP]
    ICGI, 2006, pp:161-174 [Conf]
    
11. Etsuji Tomita, Kazushi Seino
    The Extendes Equivalence Problem for a Class of Non-Real-Time Deterministic Pushdowen Automata [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1995, v:32, n:4, pp:395-413 [Journal]
    
12. Etsuji Tomita
    A Direct Branching Algorithm for Checking Equivalence of Some Classes of Deterministic Pushdown Automata [Citation Graph (0, 0)][DBLP]
    Information and Control, 1982, v:52, n:2, pp:187-238 [Journal]
    
13. K. C. Dukka Bahadur, Etsuji Tomita, Jun'ichi Suzuki, Tatsuya Akutsu
    Protein Side-chain Packing Problem: a Maximum Edge-weight Clique Algorithmic Approach. [Citation Graph (0, 0)][DBLP]
    J. Bioinformatics and Computational Biology, 2005, v:3, n:1, pp:103-126 [Journal]
    
14. Bahadur K. C. Dukka, Etsuji Tomita, Jun'ichi Suzuki, Katsuhisa Horimoto, Tatsuya Akutsu
    Protein Threading with Profiles and Distance Constraints Using Clique Based Algorithms. [Citation Graph (0, 0)][DBLP]
    J. Bioinformatics and Computational Biology, 2006, v:4, n:1, pp:19-42 [Journal]
    
15. Haruhisa Takahashi, Etsuji Tomita, Tsutomu Kawabata
    Separability of internal representations in multilayer perceptrons with application to learning. [Citation Graph (0, 0)][DBLP]
    Neural Networks, 1993, v:6, n:5, pp:689-703 [Journal]
    
16. Etsuji Tomita, Ken'ichi Imamatsu, Yasuhiro Kohata, Mitsuo Wakatsuki
    A simple and efficient branch and bound algorithm for finding a maximum clique with experimental evaluations. [Citation Graph (0, 0)][DBLP]
    Systems and Computers in Japan, 1997, v:28, n:5, pp:60-67 [Journal]
    
17. Yasuhiro Tajima, Etsuji Tomita, Mitsuo Wakatsuki, Matsuaki Terada
    Polynomial time learning of simple deterministic languages via queries and a representative sample. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:329, n:1-3, pp:203-221 [Journal]
    
18. Etsuji Tomita
    A Direct Branching Algorithm for Checking Equivalence of Strict Deterministic VS. LL(k) Grammars. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1983, v:23, n:, pp:129-154 [Journal]
    
19. Etsuji Tomita
    An Extended Direct Branching Algorithm for Checking Equivalence of Deterministic Pushdown Automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1984, v:32, n:, pp:87-120 [Journal]
    
20. Etsuji Tomita, Kazushi Seino
    A Weaker Sufficient Condition for the Equivalence of a Pair of DPDA's to be Decidable. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:41, n:, pp:223-230 [Journal]
    
21. Etsuji Tomita, Kazushi Seino
    A Direct Branching Algorithm for Checking the Equivalence of Two Deterministic Pushdown Transducers, one of which is Real-Time Strict. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1989, v:64, n:1, pp:39-53 [Journal]
    
22. Etsuji Tomita, Akira Tanaka, Haruhisa Takahashi
    The worst-case time complexity for generating all maximal cliques and computational experiments. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:363, n:1, pp:28-42 [Journal]
    
23. 
    Polynomial Time Identification of Strict Prefix Deterministic Finite State Transducers. [Citation Graph (, )][DBLP]
    
    
24. 
    A More Efficient Algorithm for Finding a Maximum Clique with an Improved Approximate Coloring. [Citation Graph (, )][DBLP]
    
    
25. 
    A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique. [Citation Graph (, )][DBLP]
    
    
26. 
    Clique-based data mining for related genes in a biomedical database. [Citation Graph (, )][DBLP]