| |
 |      |
                                              |
Note: Links lead to the DBLP on the Web. Mitsunori Ogihara Lane A. Hemaspaandra , Mitsunori Ogihara, Mohammed Javeed Zaki , Marius Zimand : The Complexity of Finding Top-Toda-Equivalence-Class Members. LATIN 2004 : 90-99 Tao Li , Shenghuo Zhu , Mitsunori Ogihara: Efficient multi-way text categorization via generalized discriminant analysis. CIKM 2003 : 317-324 Tao Li , Shenghuo Zhu , Mitsunori Ogihara: Using Discriminant Analysis for Multi-class Classification. ICDM 2003 : 589-592 Tao Li , Shenghuo Zhu , Mitsunori Ogihara: A New Distributed Data Mining Model Based on Similarity. SAC 2003 : 432-436 Tao Li , Shenghuo Zhu , Qi Li , Mitsunori Ogihara: Gene Functional Classification by Semisupervised Learning from Heterogeneous Data. SAC 2003 : 78-82 Tao Li , Mitsunori Ogihara, Qi Li : A comparative study on content-based music genre classification. SIGIR 2003 : 282-289 Tao Li , Shenghuo Zhu , Mitsunori Ogihara: Topic hierarchy generation via linear discriminant projection. SIGIR 2003 : 421-422 Jin-yi Cai , Venkatesan T. Chakaravarthy , Lane A. Hemaspaandra , Mitsunori Ogihara: Competing Provers Yield Improved Karp-Lipton Collapse Results. STACS 2003 : 535-546 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) Tao Li , Mitsunori Ogihara, Shenghuo Zhu : Association-based similarity testing and its applications. Intell. Data Anal. 7 (3): 209-232 (2003) Tao Li , Shenghuo Zhu , Mitsunori Ogihara: Algorithms for clustering high dimensional and distributed data. Intell. Data Anal. 7 (4): 305-326 (2003) Maciej Liskiewicz , Mitsunori Ogihara, Seinosuke Toda : The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes. Theor. Comput. Sci. 1-3 (304): 129-156 (2003) Richard J. Lipton , Mitsunori Ogihara, Yechezkel Zalcstein : A Note on Square Rooting of Time Functions of Turing Machines. Theory Comput. Syst. 36 (3): 295-299 (2003) Alina Beygelzimer , Mitsunori Ogihara: The (Non)Enumerability of the Determinant and the Rank. Theory Comput. Syst. 36 (4): 359-374 (2003) Tao Li , Shenghuo Zhu , Mitsunori Ogihara, Yinhe Cheng : Estimating Joint Probabilities from Marginal Ones. DaWaK 2002 : 31-41 Shenghuo Zhu , Tao Li , Mitsunori Ogihara: CoFD : An Algorithm for Non-distance Based Clustering in High Dimensional Spaces. DaWaK 2002 : 52-62 Alina Beygelzimer , Mitsunori Ogihara: On the Enumerability of the Determinant and the Rank. IFIP TCS 2002 : 59-70 Mitsunori Ogihara, Animesh Ray : The Minimum-Model DNA Computation on a Sequence of Probe Arrays. UMC 2002 : 38-49 Alina Beygelzimer , Mitsunori Ogihara: On the Enumerability of the Determinant and the Rank Electronic Colloquium on Computational Complexity (ECCC) (016): (2002) Lane A. Hemaspaandra , Mitsunori Ogihara, Gerd Wechsung : Reducing the Number of Solutions of NP Functions. J. Comput. Syst. Sci. 64 (2): 311-328 (2002) Tao Li , Qi Li , Shenghuo Zhu , Mitsunori Ogihara: A Survey on Wavelet Applications in Data Mining. SIGKDD Explorations 4 (2): 49-68 (2002) Mitsunori Ogihara, Anne Condon : Guest Editors' Foreword. Theory Comput. Syst. 35 (5): 469 (2002) 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 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) Srinivasan Parthasarathy , Mohammed Javeed Zaki , Mitsunori Ogihara, Wei Li : Parallel Data Mining for Association Rules on Shared-Memory Systems. Knowl. Inf. Syst. 3 (1): 1-29 (2001) Sergio Díaz , Juan Luis Esteban , Mitsunori Ogihara: A DNA-Based Random Walk Method for Solving k-SAT. DNA Computing 2000 : 209-219 Srinivasan Parthasarathy , Mitsunori Ogihara: Exploiting Dataset Similarity for Distributed Mining. IPDPS Workshops 2000 : 399-406 Lane A. Hemaspaandra , Mitsunori Ogihara, Gerd Wechsung : Reducing the Number of Solutions of NP Functions. MFCS 2000 : 394-404 Srinivasan Parthasarathy , Mitsunori Ogihara: Clustering Distributed Homogeneous Datasets. PKDD 2000 : 566-574 Mohammed Javeed Zaki , Neal Lesh , Mitsunori Ogihara: PlanMine: Predicting Plan Failures Using Sequence Mining. Artif. Intell. Rev. 14 (6): 421-446 (2000) Neal Lesh , Mohammed Javeed Zaki , Mitsunori Ogihara: Scalable Feature Mining for Sequential Data. IEEE Intelligent Systems 15 (2): 48-56 (2000) Judy Goldsmith , Mitsunori Ogihara, Jörg Rothe : Tally NP Sets and Easy Census Functions. Inf. Comput. 158 (1): 29-52 (2000) Lane A. Hemaspaandra , Albrecht Hoene , Mitsunori Ogihara: Erratum to "Reducibility classes of P-selective sets". Theor. Comput. Sci. 234 (1-2): 323 (2000) Srinivasan Parthasarathy , Mohammed Javeed Zaki , Mitsunori Ogihara, Sandhya Dwarkadas : Incremental and Interactive Sequence Mining. CIKM 1999 : 251-258 Neal Lesh , Mohammed Javeed Zaki , Mitsunori Ogihara: Mining Features for Sequence Classification. KDD 1999 : 342-346 Srinivasan Parthasarathy , Sandhya Dwarkadas , Mitsunori Ogihara: Active Mining in a Distributed Setting. Large-Scale Parallel Data Mining 1999 : 65-82 Mitsunori Ogihara, Animesh Ray : Simulating Boolean Circuits on a DNA Computer. Algorithmica 25 (2-3): 239-250 (1999) Eric Allender , Robert Beals , Mitsunori Ogihara: The Complexity of Matrix Rank and Feasible Systems of Linear Equations. Computational Complexity 8 (2): 99-126 (1999) Mohammed Javeed Zaki , Neal Lesh , Mitsunori Ogihara: PlanMine: Sequence Mining for Plan Failures. KDD 1998 : 369-374 Judy Goldsmith , Mitsunori Ogihara, Jörg Rothe : Tally NP Sets and Easy Census Functions. MFCS 1998 : 483-492 Mitsunori Ogihara: The PL Hierarchy Collapses. SIAM J. Comput. 27 (5): 1430-1437 (1998) Ioan I. Macarie , Mitsunori Ogihara: Properties of Probabilistic Pushdown Automata. Theor. Comput. Sci. 207 (1): 117-130 (1998) Dieter van Melkebeek , Mitsunori Ogihara: Sparse Hard Sets for P. Advances in Algorithms, Languages, and Complexity 1997 : 191-208 Mohammed Javeed Zaki , Srinivasan Parthasarathy , Mitsunori Ogihara, Wei Li : New Algorithms for Fast Discovery of Association Rules. KDD 1997 : 283-286 Mitsunori Ogihara, Animesh Ray : Simulating Boolean circuits on a DNA computer. RECOMB 1997 : 226-231 Mohammed Javeed Zaki , Srinivasan Parthasarathy , Wei Li , Mitsunori Ogihara: Evaluation of Sampling for Data Mining of Association Rules. RIDE 1997 : 0- Mohammed Javeed Zaki , Srinivasan Parthasarathy , Mitsunori Ogihara, Wei Li : Parallel Algorithms for Discovery of Association Rules. Data Min. Knowl. Discov. 1 (4): 343-373 (1997) Lane A. Hemaspaandra , Mitsunori Ogihara: Universally Serializable Computation. J. Comput. Syst. Sci. 55 (3): 547-560 (1997) Stephen A. Fenner , Steven Homer , Mitsunori Ogihara, Alan L. Selman : Oracles that Compute Values. SIAM J. Comput. 26 (4): 1043-1065 (1997) Eric Allender , Robert Beals , Mitsunori Ogihara: The Complexity of Matrix Rank and Feasible Systems of Linear Equations (Extended Abstract). STOC 1996 : 161-167 Mitsunori Ogihara: The PL Hierarchy Collapses. STOC 1996 : 84-88 Mitsunori Ogihara: The PL Hierarchy Collapses Electronic Colloquium on Computational Complexity (ECCC) 3 (13): (1996) Mitsunori Ogihara: Sparse Hard Sets for P Yields Space-Efficient Algorithms Electronic Colloquium on Computational Complexity (ECCC) 3 (14): (1996) 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) 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) Eric Allender , Mitsunori Ogihara: Relationships Among PL, #L, and the Determinant. ITA 30 (1): 1-21 (1996) Mitsunori Ogihara: Functions Computable with Limited Access to NP. Inf. Process. Lett. 58 (1): 35-38 (1996) Mitsunori Ogihara, Thomas Thierauf , Seinosuke Toda , Osamu Watanabe : On Closure Properties of #P in the Context of PF ° #P. J. Comput. Syst. Sci. 53 (2): 171-179 (1996) Edith Hemaspaandra , Ashish V. Naik , Mitsunori Ogihara, Alan L. Selman : P-Selektive Sets and Reducing Search to Decision vs Self-Reducibility. J. Comput. Syst. Sci. 53 (2): 194-209 (1996) 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) Lane A. Hemaspaandra , Albrecht Hoene , Mitsunori Ogihara: Reducibility Classes of P-Selective Sets. Theor. Comput. Sci. 155 (2): 447-457 (1996) Ioan I. Macarie , Mitsunori Ogihara: Properties of Probabilistic Pushdown Automata (Extended Abstract). FCT 1995 : 343-352 Mitsunori Ogihara: Sparse P-Hard Sets Yield Space-Efficient Algorithms. FOCS 1995 : 354-361 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 Mitsunori Ogihara: Equivalence of NC^k and AC^k-1 closures of NP and Other Classes Inf. Comput. 120 (1): 55-58 (1995) Mitsunori Ogihara: On Helping by Parity-Like Languages. Inf. Process. Lett. 54 (1): 41-43 (1995) Lane A. Hemaspaandra , Albrecht Hoene , Ashish V. Naik , Mitsunori Ogihara, Alan L. Selman , Thomas Thierauf , J. Wang : Nondeterministically Selective Sets. Int. J. Found. Comput. Sci. 6 (4): 403-416 (1995) Mitsunori Ogihara: Polynomial-Time Membership Comparable Sets. SIAM J. Comput. 24 (5): 1068-1081 (1995) Lane A. Hemaspaandra , Ashish V. Naik , Mitsunori Ogihara, Alan L. Selman : Computing Solutions Uniquely collapses the Polynomial Hierarchy. ISAAC 1994 : 56-64 Mitsunori Ogiwara: NC^k(NP) = AC^(k-1)(NP). STACS 1994 : 313-324 Mitsunori Ogihara: Polynomial-Time Membership Comparable Sets. Structure in Complexity Theory Conference 1994 : 2-11 Eric Allender , Mitsunori Ogihara: Relationships Among PL, #L, and the Determinant. Structure in Complexity Theory Conference 1994 : 267-278 Lane A. Hemaspaandra , Mitsunori Ogihara, Seinosuke Toda : Space-Efficient Recognition of Sparse Self-Reducible Languages. Computational Complexity 4 : 262-296 (1994) Mitsunori Ogihara: On Serializable Languages. Int. J. Found. Comput. Sci. 5 (3/4): 303-318 (1994) Mitsunori Ogiwara: Generalized Theorems on Relationships Among Reducibility Notions to Certain Complexity Classes. Mathematical Systems Theory 27 (3): 189-200 (1994) Lane A. Hemachandra , Albrecht Hoene , Mitsunori Ogiwara, Alan L. Selman , Thomas Thierauf , J. Wang : Selectivity. ICCI 1993 : 55-59 Stephen A. Fenner , Steven Homer , Mitsunori Ogiwara, Alan L. Selman : On Using Oracles That Compute Values. STACS 1993 : 398-407 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 Ashish V. Naik , Mitsunori Ogiwara, Alan L. Selman : P-Selective Sets, and Reducing Search to Decision vs. Self-Reducability. Structure in Complexity Theory Conference 1993 : 52-64 Mitsunori Ogiwara, Lane A. Hemachandra : A Complexity Theory for Feasible Closure Properties. J. Comput. Syst. Sci. 46 (3): 295-325 (1993) Richard Beigel , Richard Chang , Mitsunori Ogiwara: A Relationship Between Difference Hierarchies and Relativized Polynomial Hierarchies. Mathematical Systems Theory 26 (3): 291-310 (1993) Mitsunori Ogiwara, Antoni Lozano : On Sparse Hard Sets for Counting Classes. Theor. Comput. Sci. 112 (2): 255-275 (1993) Vikraman Arvind , Y. Han , Lane A. Hemachandra , Johannes Köbler , Antoni Lozano , Martin Mundhenk , Mitsunori Ogiwara, Uwe Schöning , Riccardo Silvestri , Thomas Thierauf : Reductions to Sets of Low Information Content. Complexity Theory: Current Research 1992 : 1-46 Vikraman Arvind , Y. Han , Lane A. Hemachandra , Johannes Köbler , Antoni Lozano , Martin Mundhenk , Mitsunori Ogiwara, Uwe Schöning , Riccardo Silvestri , Thomas Thierauf : Reductions to Sets of Low Information Content. ICALP 1992 : 162-173 Lane A. Hemachandra , Mitsunori Ogiwara, Osamu Watanabe : How Hard Are Sparse Sets? Structure in Complexity Theory Conference 1992 : 222-238 Lane A. Hemachandra , Mitsunori Ogiwara: Is #P Closed under Substraction? Bulletin of the EATCS 46 : 107-123 (1992) Seinosuke Toda , Mitsunori Ogiwara: Counting Classes are at Least as Hard as the Polynomial-Time Hierarchy. SIAM J. Comput. 21 (2): 316-328 (1992) Eric Allender , Lane A. Hemachandra , Mitsunori Ogiwara, Osamu Watanabe : Relating Equivalence and Reducibility to Sparse Sets. SIAM J. Comput. 21 (3): 521-539 (1992) Mitsunori Ogiwara, Antoni Lozano : On One Query Self-Reducible Sets. Structure in Complexity Theory Conference 1991 : 139-151 Mitsunori Ogiwara, Lane A. Hemachandra : A Complexity Theory for Feasible Closure Properties. Structure in Complexity Theory Conference 1991 : 16-29 Seinosuke Toda , Mitsunori Ogiwara: Counting Classes Are at Least as Hard as the Polynomial-Time Hierarchy. Structure in Complexity Theory Conference 1991 : 2-12 Eric Allender , Lane A. Hemachandra , Mitsunori Ogiwara, Osamu Watanabe : Relating Equivalence and Reducibility to Sparse Sets. Structure in Complexity Theory Conference 1991 : 220-229 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) Mitsunori Ogiwara, Osamu Watanabe : On Polynomial Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets STOC 1990 : 457-467 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 1 [ 4 ] [ 8 ] [ 24 ] [ 40 ] [ 42 ] [ 46 ] [ 58 ] 2 [ 12 ] [ 13 ] 3 [ 42 ] [ 46 ] [ 58 ] 4 [ 15 ] 5 [ 77 ] [ 79 ] [ 82 ] 6 [ 87 ] 7 [ 87 ] 8 [ 32 ] [ 88 ] 9 [ 88 ] 10 [ 15 ] 11 [ 81 ] [ 87 ] 12 [ 74 ] 13 [ 70 ] 14 [ 60 ] [ 62 ] 15 [ 70 ] 16 [ 19 ] [ 47 ] 17 [ 56 ] [ 64 ] 18 [ 12 ] [ 13 ] 19 [ 4 ] [ 6 ] [ 8 ] [ 10 ] [ 11 ] [ 12 ] [ 13 ] [ 16 ] [ 20 ] 20 [ 37 ] 21 [ 23 ] [ 27 ] [ 29 ] [ 35 ] [ 36 ] [ 41 ] [ 48 ] [ 63 ] [ 68 ] [ 76 ] [ 88 ] [ 95 ] 22 [ 20 ] [ 29 ] [ 35 ] [ 63 ] 23 [ 19 ] [ 47 ] 24 [ 12 ] [ 13 ] 25 [ 57 ] [ 61 ] [ 65 ] [ 66 ] 26 [ 75 ] [ 90 ] [ 91 ] 27 [ 75 ] [ 80 ] [ 81 ] [ 85 ] [ 86 ] [ 89 ] [ 90 ] [ 91 ] [ 92 ] [ 93 ] [ 94 ] 28 [ 49 ] [ 50 ] [ 52 ] [ 71 ] 29 [ 32 ] [ 83 ] 30 [ 84 ] 31 [ 32 ] 32 [ 7 ] [ 12 ] [ 13 ] [ 14 ] 33 [ 34 ] [ 54 ] 34 [ 53 ] 35 [ 12 ] [ 13 ] 36 [ 17 ] [ 27 ] [ 29 ] [ 36 ] [ 37 ] [ 41 ] 37 [ 49 ] [ 50 ] [ 52 ] [ 60 ] [ 62 ] [ 67 ] [ 69 ] [ 71 ] 38 [ 87 ] 39 [ 51 ] [ 59 ] [ 78 ] 40 [ 32 ] 41 [ 56 ] [ 64 ] 42 [ 12 ] [ 13 ] 43 [ 17 ] [ 19 ] [ 20 ] [ 27 ] [ 29 ] [ 36 ] [ 37 ] [ 41 ] [ 47 ] 44 [ 12 ] [ 13 ] 45 [ 32 ] 46 [ 12 ] [ 13 ] [ 18 ] [ 20 ] [ 29 ] [ 38 ] 47 [ 5 ] [ 9 ] [ 18 ] [ 23 ] [ 38 ] [ 72 ] [ 73 ] [ 84 ] 48 [ 20 ] [ 29 ] 49 [ 1 ] [ 2 ] [ 3 ] [ 4 ] [ 8 ] [ 11 ] [ 18 ] [ 38 ] 50 [ 68 ] [ 76 ] 51 [ 49 ] [ 50 ] [ 52 ] [ 57 ] [ 61 ] [ 62 ] [ 65 ] [ 66 ] [ 71 ] [ 95 ] 52 [ 83 ] 53 [ 75 ] [ 80 ] [ 81 ] [ 85 ] [ 86 ] [ 89 ] [ 91 ] [ 92 ] [ 93 ] [ 94 ] 54 [ 95 ]  ©2004 Association for Computing Machinery |
