C. Zhang,
K. Kelsey,
X. Shen,
C. Ding,
M. Hertz,
and M. Ogihara.
Program-level adaptive memory management.
In Proceedings of the International Symposium on Memory Management (ISMM'06).
C. Zhang,
Y. Zhong,
C. Ding,
and M. Ogihara.
A hierarchy model of data locality.
In Proceedings of the 33rd Annual ACM Symposium on Principles of Programming Languages (POPL'06).
T. Li and
M. Ogihara.
Toward intelligent music information retrieval. IEEE Transactions on Multimedia, in press.
T. Li and
M. Ogihara.
Music genre classification with taxonomy.
In Proceedings of the 2005 International Conference on Acoustic, Speech, and Signal Processing (ICASSP'05),
pages V198-201, 2005.
T. Li
and M. Ogihara.
Semi-supervised learning for music artist clasification.
In Proceedings of the IEEE Conference on Information and Knowledge Management (CIKM'04),
pages 152-153, 2004.
T. Li,
S, Ma,
and M. Ogihara.
On combining multiple clusterings.
In Proceedings of the IEEE Conference on Information and Knowledge Management (CIKM'04),
pages 294-303, 2004.
T. Li
and M. Ogihara.
Music artist style identification by semisupervised learningmusic artist clasification.
In Proceedings of the IEEE Conference on Information and Knowledge Management (CIKM'04),
pages 152-153, 2004.
T. Li,
S. Ma, and M. Ogihara,
Document clustering via adaptive subspace iteration.
In Proceedings of the 12th ACM International Conference on Multimedia (MM'04),
pages 364-367, 2004.
T. Li,
S. Ma, and M. Ogihara.
Entropy-based criterion for categorical data clustering.
In Proceedings of the 21st International Conference on Machine Learning (ICML'04), pages 536-543.
T. Li
and M. Ogihara.
Content-based music similarity search and emotion detection.
In Proceedings of the 2004 International Conference on Acoustic, Speech, and Signal Processing (ICASSP'04)
IEEE Computer Society Press, pages V705-V708, 2004.
T. Li
and
M. Ogihara.
Semi-supervised learning from different information sources: an experimental investigation.
KAIS Journal,
in press.
T. Li and
M. Ogihara,
Detecting emotion in music.
In Proceedings of the Fifth International Symposium on Music
Information Retrieval,
pages 239-240, 2003.
T. Li,
S. Zhu, and
M. Ogihara,
Algorithms for clustering high dimensional and distributed data.
Intelligent Data Analysis 7(4):305-326, 2003.
T. Li,
M. Ogihara, and
S. Zhu,
Association-based similarity testing and its applications.
Intelligent Data Analysis 7(3):209-232, 2003.
T. Li,
S. Zhu,
M. Ogihara, and
Y. Chen,
Estimating joint probabilities from marginal ones.
In Proceedings of the 4th International Conference on Data Warehousing
and Knowledge Discovery,
pages 31-41.
Springer-Verlag Lecture Notes in Computer Science Vol. 2454, 2002.
S. Zhu,
T. Li,
M. Ogihara, and
Y. Chen,
CoFD: an algorithm for non-distance based clustering in high
dimensional spaces.
In Proceedings of the 4th International Conference on Data Warehousing
and Knowledge Discovery,
pages 52-62.
Springer-Verlag Lecture Notes in Computer Science Vol. 2454, 2002.
S. Parthasarathy,
M. J. Zaki,
M. Ogihara, and
S. Dwarkadas,
Sequence mining in dynamic and interactive environments.
In W. Abramowicz and J. Zurada, eds.,
Knowledge Discovery for Business Information Systems,
Chapter 16, pages 377--376.
Kluwer Academic Publishers, 2001.
M. J. Zaki,
N. Lesh,
and M. Ogihara.
Predicting failures in event sequences.
In R. Grossman, C. Kamath, P. Kegelmeyer, V. Kumar, and R. R. Namburu
eds. Data Mining for Scientific and Engineering Applications
Kluwer Academic Publishers, 2001.
S. Parthasarathy
and
M. Ogihara.
Exploiting dataset similarity for distributed mining.
In J. P. Rolim et al., eds.,
Parallel and Distributed Processing, 15 IPDPS 2000 Workshops Proceedings,
pages 390--398.
Springer-Verlag Lecture Notes in Computer Science Volume 1800, 2000.
S. Parthasarathy
and
M. Ogihara.
Clustering distributed homogeneous datasets.
In D. A. Zighed, H. J. Komorowski, and J. M. Zytkow, eds.,
Proceedings of the Fourth European Conference on Principles of Data Mining
and Knowledge Discovery,
pages 566--574.
Springer-Verlag Lecture Notes in Computer Science Volume 1910, 2000.
M. J. Zaki,
S. Parthasarathy,
M. Ogihara, and W. LI.
Parallel algorithms for discovery of association rules.
In P. Stolorz and R. Musick, eds.,
Scalable High Performance Computing for Knowledge
Discovery and Data Mining.
Kluwer Academic Publishers, 1998.
T. Li,
C. Zhang,
and M. Ogihara.
A comparative study of feature selection and multiclass classification methods for tissue classification based on gene expression.
Bioinformatics, 20:2421-2428, 2004.
S. Diaz, J. L. Esteban, and M. Ogihara,
A DNA-based random walk method for solving k-SAT. Proceedings of the Sixth International Workshop on DNA-based Computers,
Springer-Verlag Lecture Notes in Computer Science, 2000.
GZIP-ed postscripted file
GZIP-ed PDF file
M. Ogihara and A. Ray,
DNA computing on a chip. Nature 403:143--144, 2000.
M. Ogihara,
Relating the minimum model for DNA computation and Boolean circuits. Proceedings of the Genetic and Evolutionary Computation Conference,
pages 1817--1821,
Morgan Kaufman Publishers, San Francisco, CA, 1999.
GZIP-ed postscripted file
GZIP-ed PDF file
M. Ogihara and A. Ray,
Executing parallel logical operations with DNA.Proceedings of the Congress on Evolutionary Computation,
pages 972--979,
IEEE Computer Society Press, Piscataway, NJ, 1999.
GZIP-ed postscripted file
GZIP-ed PDF file
M. Ogihara and A. Ray,
DNA-based parallel computation by counting.
In DNA Based Computers III,
(H. Rubin and D. H. Wood, eds.),
DIMACS Series in Discrete Mathematics and Theoretical Computer Science Volume 48
,
The American Mathematics Society Press, pages 255--264, 1999.
GZIP-ed postscripted file
GZIP-ed PDF file
M. Ogihara and A. Ray,
DNA-based self-propagating algorithm for solving bounded-fan-in
Boolean circuitsThird Conference on Genetic Programming,
pages 725--730,
Morgan Kaufman Publishers, San Francisco, CA, 1998.
GZIP-ed postscripted file
GZIP-ed PDF file
M. Ogihara and A. Ray,
Circuit evaluation: thoughts on a killer application in DNA computing,
In Computing with Bio-Molecules. Theory and Experiments,
G. Paun, ed., pages 111--126,
Springer-Verlag, Singapore, 1998.
GZIP-ed postscripted file
GZIP-ed PDF file
M. Ogihara and A. Ray,
The minimum DNA computation model and its computational power. Unconventional Models of Computation
(C. S. Calude, J. Casti, and M. J. Dinneen, eds.),
pages 309--322, Springer, Singapore, 1998.
GZIP-ed postscripted file
GZIP-ed PDF file
M. Ogihara and A. Ray,
Simulating Boolean circuits on a DNA computer. First Annual Conference on Computational Molecular Biology,
pages 326--331, ACM Press, 1997.
The final version: Algorithmica 25:239--250, 1999.
GZIP-ed postscripted file
GZIP-ed PDF file
M. Ogihara,
Breadth first search 3SAT algorithms for DNA computers.
Technical Report TR-629, Department of Computer Science,
University of Rochester, July 1996.
GZIP-ed postscripted file
GZIP-ed PDF file
J. Cai,
V. Chakaravarthy,
L. Hemaspaandra,
and M. Ogihara,
Computing provers yield improved Karp-Lipton collapse results.
Accepted for publication in
Information and Computation.
A. Beygelzimer
M. Ogihara
The enumerability of P collapses P to NC.
In Proceedings of the 29th International Symposium on Mathematical Foundations of Computer Science,
Springer-Verlag Lecture Notes in Computer Science Volume 3153,
pages 364-355, 2004. Journal version, Theoretical Computer Science 345(2-3):248-259, 2005.
R. Lipton, M. Ogihara, and Y. Zalcstein,
A note on square rooting of time functions of Turing machines.
Theory of Computing Systems
36(3):295-299, 2003.
Also, available as Georgia Institute of Technology, College of Computing Technical Report GIT-CC-02-04.
A. Beygelzimer
and
M. Ogihara,
The (non)enumerability of the determinant and the rank.
Theory of Computing Systems
36(4):359-374, 2003.
An earlier version is available as
ECCC Technical Report TR02-016.
M. Ogihara and
S. Toda,
The Complexity of Computing the Number of Self-Avoiding Walks
in Two-Dimensional Grid Graphs and in Hypercube Graphs Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science, pages 585--597.
Springer-Verlag Lecture Notes in Computer Science Volume 2136, 2001.
J. Cai
and M. Ogihara,
Sparse hard sets.
In Complexity Theory Retrospective
(L. A. Hemaspaandra and A. L. Selman, eds.), pages 53--80,
Springer-Verlag, New York, 1997.
M. Ogiwara,
A characterization of P^{C=P}. The Transactions of the Institute of Electronics,
Information and Communication Engineers
E75-D, 44--49 (1992).