| |
 |      |
                                         |
Note: Links lead to the DBLP on the Web. Mitsunori Ogihara 64 Tao Li , Shenghuo Zhu , Mitsunori Ogihara: A New Distributed Data Mining Model Based on Similarity. SAC 2003 : 432-436 63 Tao Li , Shenghuo Zhu , Qi Li , Mitsunori Ogihara: Gene Functional Classification by Semisupervised Learning from Heterogeneous Data. SAC 2003 : 78-82 62 Jin-yi Cai , Venkatesan T. Chakaravarthy , Lane A. Hemaspaandra , Mitsunori Ogihara: Competing Provers Yield Improved Karp-Lipton Collapse Results. STACS 2003 : 535-546 61 Rahul Bijlani , Yinhe Cheng , David A. Pearce , Andrew I. Brooks , Mitsunori Ogihara: Prediction of biologically significant components from microarray data: Independently Consistent Expression Discriminator (ICED). Bioinformatics 19 (1): 62-70 (2003) 60 Maciej Liskiewicz , Mitsunori Ogihara, Seinosuke Toda : The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes. TCS 1-3 (304): 129-156 (2003) 59 Tao Li , Shenghuo Zhu , Mitsunori Ogihara, Yinhe Cheng : Estimating Joint Probabilities from Marginal Ones. DaWaK 2002 : 31-41 58 Shenghuo Zhu , Tao Li , Mitsunori Ogihara: CoFD : An Algorithm for Non-distance Based Clustering in High Dimensional Spaces. DaWaK 2002 : 52-62 57 Alina Beygelzimer , Mitsunori Ogihara: On the Enumerability of the Determinant and the Rank. IFIP TCS 2002 : 59-70 56 Mitsunori Ogihara, Animesh Ray : The Minimum-Model DNA Computation on a Sequence of Probe Arrays. UMC 2002 : 38-49 55 Alina Beygelzimer , Mitsunori Ogihara: On the Enumerability of the Determinant and the Rank. Electronic Colloquium on Computational Complexity (ECCC) (016): (2002) 54 Lane A. Hemaspaandra , Mitsunori Ogihara, Gerd Wechsung : Reducing the Number of Solutions of NP Functions. JCSS 64 (2): 311-328 (2002) 53 Tao Li , Qi Li , Shenghuo Zhu , Mitsunori Ogihara: A Survey on Wavelet Applications in Data Mining. SIGKDD Explorations 4 (2): 49-68 (2002) 52 Mitsunori Ogihara, Anne Condon : Guest Editors' Foreword. Theory of Computing Systems 35 (5): 469 (2002) 51 Mitsunori Ogihara, Seinosuke Toda : The Complexity of Computing the Number of Self-Avoiding Walks in Two-Dimensional Grid Graphs and in Hypercube Graphs. MFCS 2001 : 585-597 50 Mitsunori Ogihara, Seinosuke Toda : The Complexity of Computing the Number of Self-Avoiding Walks in Two-Dimensional Grid Graphs and in Hypercube Graphs. Electronic Colloquium on Computational Complexity (ECCC) 8 (061): (2001) 49 Srinivasan Parthasarathy , Mohammed Javeed Zaki , Mitsunori Ogihara, Wei Li : Parallel Data Mining for Association Rules on Shared-Memory Systems. Knowledge and Information Systems 3 (1): 1-29 (2001) 48 Sergio Díaz , Juan Luis Esteban , Mitsunori Ogihara: A DNA-Based Random Walk Method for Solving k-SAT. DNA Computing 2000 : 209-219 47 Srinivasan Parthasarathy , Mitsunori Ogihara: Exploiting Dataset Similarity for Distributed Mining. IPDPS Workshops 2000 : 399-406 46 Lane A. Hemaspaandra , Mitsunori Ogihara, Gerd Wechsung : Reducing the Number of Solutions of NP Functions. MFCS 2000 : 394-404 45 Srinivasan Parthasarathy , Mitsunori Ogihara: Clustering Distributed Homogeneous Datasets. PKDD 2000 : 566-574 44 Mohammed Javeed Zaki , Neal Lesh , Mitsunori Ogihara: PlanMine: Predicting Plan Failures Using Sequence Mining. Artificial Intelligence Review 14 (6): 421-446 (2000) 43 Neal Lesh , Mohammed Javeed Zaki , Mitsunori Ogihara: Scalable Feature Mining for Sequential Data. IEEE Intelligent Systems 15 (2): 48-56 (2000) 42 Judy Goldsmith , Mitsunori Ogihara, Jörg Rothe : Tally NP Sets and Easy Census Functions. Information and Computation 158 (1): 29-52 (2000) 41 Lane A. Hemaspaandra , Albrecht Hoene , Mitsunori Ogihara: Erratum to "Reducibility classes of P-selective sets". TCS 234 (1-2): 323 (2000) 40 Srinivasan Parthasarathy , Mohammed Javeed Zaki , Mitsunori Ogihara, Sandhya Dwarkadas : Incremental and Interactive Sequence Mining. CIKM 1999 : 251-258 39 Neal Lesh , Mohammed Javeed Zaki , Mitsunori Ogihara: Mining Features for Sequence Classification. KDD 1999 : 342-346 38 Srinivasan Parthasarathy , Sandhya Dwarkadas , Mitsunori Ogihara: Active Mining in a Distributed Setting. Large-Scale Parallel Data Mining 1999 : 65-82 37 Mitsunori Ogihara, Animesh Ray : Simulating Boolean Circuits on a DNA Computer. Algorithmica 25 (2-3): 239-250 (1999) 36 Eric Allender , Robert Beals , Mitsunori Ogihara: The Complexity of Matrix Rank and Feasible Systems of Linear Equations. Computational Complexity 8 (2): 99-126 (1999) 35 Mohammed Javeed Zaki , Neal Lesh , Mitsunori Ogihara: PlanMine: Sequence Mining for Plan Failures. KDD 1998 : 369-374 34 Judy Goldsmith , Mitsunori Ogihara, Jörg Rothe : Tally NP Sets and Easy Census Functions. MFCS 1998 : 483-492 33 Mitsunori Ogihara: The PL Hierarchy Collapses. SIAM J. Comput. 27 (5): 1430-1437 (1998) 32 Ioan I. Macarie , Mitsunori Ogihara: Properties of Probabilistic Pushdown Automata. TCS 207 (1): 117-130 (1998) 31 Dieter van Melkebeek , Mitsunori Ogihara: Sparse Hard Sets for P. Advances in Algorithms, Languages, and Complexity 1997 : 191-208 30 Mohammed Javeed Zaki , Srinivasan Parthasarathy , Mitsunori Ogihara, Wei Li : New Algorithms for Fast Discovery of Association Rules. KDD 1997 : 283-286 29 Mitsunori Ogihara, Animesh Ray : Simulating Boolean circuits on a DNA computer. RECOMB 1997 : 226-231 28 Mohammed Javeed Zaki , Srinivasan Parthasarathy , Wei Li , Mitsunori Ogihara: Evaluation of Sampling for Data Mining of Association Rules. RIDE 1997 : 0- 27 Mohammed Javeed Zaki , Srinivasan Parthasarathy , Mitsunori Ogihara, Wei Li : Parallel Algorithms for Discovery of Association Rules. Data Mining and Knowledge Discovery 1 (4): 343-373 (1997) 26 Lane A. Hemaspaandra , Mitsunori Ogihara: Universally Serializable Computation. JCSS 55 (3): 547-560 (1997) 25 Stephen A. Fenner , Steven Homer , Mitsunori Ogihara, Alan L. Selman : Oracles that Compute Values. SIAM J. Comput. 26 (4): 1043-1065 (1997) 24 Eric Allender , Robert Beals , Mitsunori Ogihara: The Complexity of Matrix Rank and Feasible Systems of Linear Equations (Extended Abstract). STOC 1996 : 161-167 23 Mitsunori Ogihara: The PL Hierarchy Collapses. STOC 1996 : 84-88 22 Mitsunori Ogihara: The PL Hierarchy Collapses. Electronic Colloquium on Computational Complexity (ECCC) 3 (13): (1996) 21 Mitsunori Ogihara: Sparse Hard Sets for P Yields Space-Efficient Algorithms. Electronic Colloquium on Computational Complexity (ECCC) 3 (14): (1996) 20 Eric Allender , Robert Beals , Mitsunori Ogihara: The complexity of matrix rank and feasible systems of linear equations. Electronic Colloquium on Computational Complexity (ECCC) 3 (24): (1996) 19 Lane A. Hemaspaandra , Ashish V. Naik , Mitsunori Ogihara, Alan L. Selman : Computing Solutions Uniquely Collapses the Polynomial Hierarchy. Electronic Colloquium on Computational Complexity (ECCC) 3 (27): (1996) 18 Eric Allender , Mitsunori Ogihara: Relationships Among PL, #L, and the Determinant. ITA 30 (1): 1-21 (1996) 17 Mitsunori Ogihara: Functions Computable with Limited Access to NP. Information Processing Letters 58 (1): 35-38 (1996) 16 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) 15 Edith Hemaspaandra , Ashish V. Naik , Mitsunori Ogihara, Alan L. Selman : P-Selektive Sets and Reducing Search to Decision vs Self-Reducibility. JCSS 53 (2): 194-209 (1996) 14 Lane A. Hemaspaandra , Ashish V. Naik , Mitsunori Ogihara, Alan L. Selman : Computing Solutions Uniquely Collapses the Polynomial Hierarchy. SIAM J. Comput. 25 (4): 697-708 (1996) 13 Lane A. Hemaspaandra , Albrecht Hoene , Mitsunori Ogihara: Reducibility Classes of P-Selective Sets. TCS 155 (2): 447-457 (1996) 12 Ioan I. Macarie , Mitsunori Ogihara: Properties of Probabilistic Pushdown Automata (Extended Abstract). FCT 1995 : 343-352 11 Mitsunori Ogihara: Sparse P-Hard Sets Yield Space-Efficient Algorithms. FOCS 1995 : 354-361 10 Jin-yi Cai , Richard J. Lipton , Luc Longpré , Mitsunori Ogihara, Kenneth W. Regan , D. Sivakumar : Communication Complexity of Key Agreement on Small Ranges. STACS 1995 : 38-49 9 Mitsunori Ogihara: On Helping by Parity-Like Languages. Information Processing Letters 54 (1): 41-43 (1995) 8 Mitsunori Ogihara: Equivalence of NC^k and AC^k-1 closures of NP and Other Classes. Information and Computation 120 (1): 55-58 (1995) 7 Lane A. Hemaspaandra , Albrecht Hoene , Ashish V. Naik , Mitsunori Ogihara, Alan L. Selman , Thomas Thierauf , J. Wang : Nondeterministically Selective Sets. International Journal of Foundations of Computer Science 6 (4): 403-416 (1995) 6 Mitsunori Ogihara: Polynomial-Time Membership Comparable Sets. SIAM J. Comput. 24 (5): 1068-1081 (1995) 5 Lane A. Hemaspaandra , Ashish V. Naik , Mitsunori Ogihara, Alan L. Selman : Computing Solutions Uniquely collapses the Polynomial Hierarchy. ISAAC 1994 : 56-64 4 Mitsunori Ogihara: Polynomial-Time Membership Comparable Sets. Structure in Complexity Theory Conference 1994 : 2-11 3 Eric Allender , Mitsunori Ogihara: Relationships Among PL, #L, and the Determinant. Structure in Complexity Theory Conference 1994 : 267-278 2 Lane A. Hemaspaandra , Mitsunori Ogihara, Seinosuke Toda : Space-Efficient Recognition of Sparse Self-Reducible Languages. Computational Complexity 4 : 262-296 (1994) 1 Mitsunori Ogihara: On Serializable Languages. International Journal of Foundations of Computer Science 5 (3/4): 303-318 (1994)  DiSC'03 © 2003 Association for Computing Machinery |
