Download 99-1 - RPI CS - Rensselaer Polytechnic Institute

<LI>99-1. An Insertion into the Chomsky Hierarchy? Robert McNaughton. </LI>
<LI>99-2. Consciousness as an Information State. Willard L. Miranker. </LI>
<LI>99-3. A Quantum State Model of Consciousness. Willard L. Miranker. </LI>
<LI>99-4. Conceptor - towards a modelling of consciousness. Konrad R. Fialkowski.
<LI>99-5. G isn't C! <em>LabVIEW and G as a Computing Language Course</em>. Mukkai
Krishnamoorthy, Sibylle Schupp. </LI>
<LI>99-6. Clusterability Detection and Initial Seed Selection in Large Data Sets. Scott Epter,
Mukkai Krishnamoorthy, Mohammed Zaki. </LI>
<LI>99-7. A Multiple-Resolution Method For Edge-Centric Data Clustering. Scott Epter, Mukkai
Krishnamoorthy.
<LI>99-8. PROCEEDINGS: Workshop on Large-Scale Parallel KDD Systems in conjunction with
the 5th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
(KDD99), August 15, 1999, San Diego, CA. Mohammed J. Zaki (IDepartment of Computer
Science, Rensselaer Polytechnic Institute), Ching-Tien (Howard) Ho (IBM Almaden Research
Center, San Jose, CA). </LI>
<LI>99-9. Extending Algebraic Axiom Techniques to Handle Object-Oriented Specifications.
Alyce Faulstich-Brady, David R. Musser, David L. Spooner. </LI>
<LI>99-10. CHARM: An Efficient Algorithm for Closed Association Rule Mining. Mohammed J.
Zaki, Ching-Jui Hsiao. </LI>
<LI>99-11. Internet Routing Behavior Analysis Using Traceroute. Selim Gurun, Boleslaw K.
Szymanski. </LI>
<LI>99-12. Generating Non-Redundant Association Rules. Mohammed J. Zaki. </LI>
<LI>99-13. Designing Algorithms by Sampling (to appear in <em>Discrete Applied
Mathematics</em>). Mark K. Goldberg, David L. Hollinger. </LI>
<LI>99-14. A Learning Algorithm for the Longest Common Subsequence Problem (to appear in
<em>Proceedings of 2nd Workshop on Algorithm Engineering and Experiments</em>). Eric A.
Breimer, Mark K. Goldberg, Darren T. Lim.