Leaders in Learning: Publications of Faculty & Staff


 

Computer Science 2004-2005

Bauer, M.A.

Abdu, H., H. Lutfiyya, and M.A. Bauer. 2004. A Framework for Determining Efficient Management Configurations. Computer Networks-the International Journal of Computer and Telecommunications Networking 46 (4): 437-463.

Perry, M., and M. Bauer. 2004. Policies, Rules and Their Engines: What Do They Mean for SLAs? Knowledge-Based Intelligent Information and Engineering Systems, Pt 1, Proceedings. Wellington, New Zealand: Lecture Notes in Computer Science. Berlin: Springer. 1164-1170.


Boykov, Y.

Boykov, Y., and V. Kolmogorov. 2004. An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision. IEEE Transactions on Pattern Analysis and Machine Intelligence 26 (9): 1124-1137.


Daley, M.

Daley, M., and I. Mcquillan. 2005. Formal Modelling of Viral Gene Compression. International Journal of Foundations of Computer Science 16 (3): 453-469.

Daley, M., and I. Mcquillan. 2005. Template-Guided Dna Recombination. Theoretical Computer Science 330 (2): 237-250.

Daley, M., and I. Mcquillan. 2005. Viral Gene Compression: Complexity and Verification. Implementation and Application of Automata, Proceedings 9th Annual. Kingston, Ontario: Lecture Notes in Computer Science. Berlin: Springer. 102-112.


El-Sakka, M.R.

Abdel-Dayem, A.R., A.K. Hamou, and M.R. El-Sakka. 2004. Novel Adaptive Filtering for Salt-and-Pepper Noise Removal From Binary Document Images. Image Analysis and Recognition, ICIAR Pt 2, Proceedings. Porto, Portugal: A. Campilho, and M. Kamel (Eds.). Lecture Notes in Computer Science. Berlin: Springer. 191-199.

Ouda, A.H., and M.R. El-Sakka. 2004. A Secure and Localizing Watermarking Technique for Image Authentication. Image Analysis and Recognition, ICIAR Pt 2, Proceedings. Porto, Portugal: A. Campilho, and M. Kamel (Eds.). Lecture Notes in Computer Science. Berlin: Springer. 759-769.


Gargantini, I.

Ye, J.T., R.E. Webber, and I. Gargantini. 2005. On the Impulse Method for Cloth Animation. Computational Science - ICCSA 2005, Pt 2, Proceedings. Singapore: O. Gervasi, M. Gavrilova, V. Kumar, A. Lagana, H. Pueh-Lee, Y. Mun, D. Taniar, and C. Tan (Eds.). Lecture Notes in Computer Science. Berlin: Springer. 331-334.


Ilie, L.

Constantinescu, S., and L. Ilie. 2005. Generalised Fine and Wilf's Theorem for Arbitrary Number of Periods. Theoretical Computer Science 339 (1): 49-60.

Ilie, L., G. Navarro, and S. Yu. 2004. On NFA Reductions. Theory Is Forever: Essays Dedicated to Arto Salomaa on the Occasion of His 70th Birthday. J. Karhumäki, H. Maurer, G. Paun, and G. Rozenberg (Eds.). Lecture Notes in Computer Science 3113. Berlin: Springer-Verlag. 112-124.

Ilie, L., P. Ochem, and J. Shallit. 2004. A Generalization of Repetition Threshold. Mathematical Foundations of Computer Science 2004, Proceedings. Prague, Czech Republic: J. Fiala, V. Koubek, and J. Kratochvil (Eds.). Lecture Notes in Computer Science. Berlin: Springer. 818-826.

Ilie, L., R. Solis-Oba, and S. Yu. 2005. Reducing the Size of NFAs by Using Equivalences and Preorders. Combinatorial Pattern Matching, Proceedings 16th Annual. Jeju Island, Korea: A. Apostolico, M. Crochemore, and K. Park (Eds.). Lecture Notes in Computer Science. 310-321.


Kari, L.

Freund, R., L. Kari, M. Oswald, and P. Sosik. 2005. Computationally Universal P Systems Without Priorities: Two Catalysts Are Sufficient. Theoretical Computer Science 330 (2): 251-266.

Kari, L., and S. Konstantinidis. 2005. Language Equations, Maximality and Error-Detection. Journal of Computer and System Sciences 70 (1): 157-178.

Kari, L., S. Konstantinidis, and P. Sosik. 2005. On Properties of Bond-Free DNA Languages. Theoretical Computer Science 334 (1-3): 131-159.

Kari, L., S. Konstantinidis, and P. Sosik. 2005. Operations on Trajectories With Applications to Coding and Bioinformatics. International Journal of Foundations of Computer Science 16 (3): 531-546.

Kari, L., S. Konstantinidis, and P. Sosik. 2005. Substitutions, Trajectories and Noisy Channels. Implementation and Application of Automata, Proceedings 9th Annual. Kingston, Ontario: Lecture Notes in Computer Science. Berlin: Springer. 202-212.

Kari, L., and P. Sosik. 2005. Aspects of Shuffle and Deletion on Trajectories. Theoretical Computer Science 332 (1-3): 47-61.

Wang, Y.W., K. Hill, S. Singh, and L. Kari. 2005. The Spectrum of Genomic Signatures: From Dinucleotides to Chaos Game Representation. Gene 346: 173-185.


Ling, C.X.

Fu, Y., Q. Yang, C.X. Ling, H.P. Wang, D.Q. Li, R.X. Sun, H. Zhou, R. Zeng, Y.Q. Chen, S.M. He, and W. Gao. 2004. A Kernel-Based Case Retrieval Algorithm With Application to Bioinformatics. Pricai 2004: Trends in Artificial Intelligence, Proceedings. Auckland, New Zealand: Lecture Notes in Artificial Intelligence. Berlin: Springer. 544-553.

Fu, Y., Q. Yang, R.X. Sun, D.Q. Li, R. Zeng, C.X. Ling, and W. Gao. 2004. Exploiting the Kernel Trick to Correlate Fragment Ions for Peptide Identification Via Tandem Mass Spectrometry. Bioinformatics 20 (12): 1948-1954.

Huang, J., and C.X. Ling. 2005. Using Auc and Accuracy in Evaluating Learning Algorithms. IEEE Transactions on Knowledge and Data Engineering 17 (3): 299-310.


Lutfiyya, H.

Abdu, H., H. Lutfiyya, and M.A. Bauer. 2004. A Framework for Determining Efficient Management Configurations. Computer Networks-the International Journal of Computer and Telecommunications Networking 46 (4): 437-463.


Ma, B.

Han, Y., B. Ma, and K.Z. Zhang. 2005. An Automata Approach to Match Gapped Sequence Tags Against Protein Database. International Journal of Foundations of Computer Science 16 (3): 487-497.

Han, Y.H., B. Ma, and K.Z. Zhang. 2005. An Automata Approach to Match Gapped Sequence Tags Against Protein Database. Implementation and Application of Automata, Proceedings. Kingston, Ontario: M. Domaratzki, A. Okhotin, K. Salomaa, and S. Yu (Ed.). Lecture Notes in Computer Science. Berlin: Springer. 167-177.

Kisman, D., M. Li, B. Ma, and L. Wang. 2005. Tpatternhunter: Gapped, Fast and Sensitive Translated Homology Search. Bioinformatics 21 (4): 542-544.

Li, M., X. Chen, X. Li, B. Ma, and P.M.B. Vitanyi. 2004. The Similarity Metric. IEEE Transactions on Information Theory 50 (12): 3250-3264.

Ma, B., L.Y. Wu, and K.Z. Zhang. 2005. Improving the Sensitivity and Specificity of Protein Homology Search by Incorporating Predicted Secondary Structures. Computational Science - ICCSA 2005, Pt 2, Proceedings. Singapore: O. Gervasi, M. Gavrilova, V. Kumar, A. Lagana, H. Pueh-Lee, Y. Mun, D. Taniar, and C. Tan (Eds.). Lecture Notes in Computer Science. Berlin: Springer. 960-967.

Ma, B., and K.Z. Zhang. 2005. On the Longest Common Rigid Subsequence Problem. Combinatorial Pattern Matching, Proceedings 16th Annual. Jeju Island, Korea: A. Apostolico, M. Crochemore, and K. Park (Eds.). Lecture Notes in Computer Science. 11-20.

Ma, B., K.Z. Zhang, and C.Z. Liang. 2005. An Effective Algorithm for Peptide De Novo Sequencing From Ms/Ms Spectra. Journal of Computer and System Sciences 70 (3): 418-430.

Xu, J., D.G. Brown, M. Li, and B. Ma. 2004. Optimizing Multiple Spaced Seeds for Homology Search. Combinatorial Pattern Matching, Proceedings 15th Annual. Istanbul, Turkey: S. Sahinalp, S. Muthukrishnan, and U. Dogrusov (Eds.). Lecture Notes in Computer Science. Berlin: Springer. 47-58.


Osborn, S.L.

Sheng, S.L., and S.L. Osborn. 2004. A Classifier-Based Approach to User-Role Assignment for Web Applications. Secure Data Management, Proceedings. Toronto, Ontario: Lecture Notes in Computer Science. Berlin: Springer. 163-171.


Sedig, K.

Morey, J., and K. Sedig. 2004. Adjusting Degree of Visual Complexity: An Interactive Approach for Exploring Four-Dimensional Polytopes. Visual Computer 20 (8-9): 565-585.

Sedig, K. 2004. Need for a Prescriptive Taxonomy of Interaction for Mathematical Cognitive Tools. Computational Science - ICCSA 2004, Pt 3, Proceedings. Assisi, Italy: A. Lagana, M. Gavrilova, V. Kumar, Y. Mun, C.J. Tan, and O. Gervasi (Eds.). Lecture Notes in Computer Science. Berlin: Springer. 1030-1037.


Solis-Oba, R.

Ilie, L., R. Solis-Oba, and S. Yu. 2005. Reducing the Size of NFAs by Using Equivalences and Preorders. Combinatorial Pattern Matching, Proceedings 16th Annual. Jeju Island, Korea: A. Apostolico, M. Crochemore, and K. Park (Eds.). Lecture Notes in Computer Science. 310-321.

Jansen, K., M. Mastrolilli, and R. Solis-Oba. 2005. Approximation Algorithms for Flexible Job Shop Problems. International Journal of Foundations of Computer Science 16 (2): 361-379.


Watt, S.M.

Smirnova, E.S., C.M. So, and S.M. Watt. 2004. An Architecture for Distributed Mathematical Web Services. Mathematical Knowledge Management, Proceedings 3rd International. Sep 19-21, 2004: A. Asperti, G. Bancerek, and A. Trybuluc (Eds.). Lecture Notes in Computer Science. Berlin: Springer. 363-377.


Webber, R.E.

Ye, J.T., R.E. Webber, and I. Gargantini. 2005. On the Impulse Method for Cloth Animation. Computational Science - ICCSA 2005, Pt 2, Proceedings. Singapore: O. Gervasi, M. Gavrilova, V. Kumar, A. Lagana, H. Pueh-Lee, Y. Mun, D. Taniar, and C. Tan (Eds.). Lecture Notes in Computer Science. Berlin: Springer. 331-334.


Yu, S.

Campeanu, C., N. Santean, and S. Yu. 2005. Mergible States in Large Nfa. Theoretical Computer Science 330 (1): 23-34.

Campeanu, C., and S. Yu. 2004. Pattern Expressions and Pattern Automata. Information Processing Letters 92 (6): 267-274.

Ilie, L., G. Navarro, and S. Yu. 2004. On NFA Reductions. Theory Is Forever: Essays Dedicated to Arto Salomaa on the Occasion of His 70th Birthday. J. Karhumäki, H. Maurer, G. Paun, and G. Rozenberg (Eds.). Lecture Notes in Computer Science 3113. Berlin: Springer-Verlag. 112-124.

Ilie, L., R. Solis-Oba, and S. Yu. 2005. Reducing the Size of NFAs by Using Equivalences and Preorders. Combinatorial Pattern Matching, Proceedings 16th Annual. Jeju Island, Korea: A. Apostolico, M. Crochemore, and K. Park (Eds.). Lecture Notes in Computer Science. 310-321.


Zhang, K.Z.

Alkan, C., E. Karakoc, J.H. Nadeau, S.C. Sahinalp, and K.Z. Zhang. 2005. RNA-RNA Interaction Prediction and Antisense RNA Target Search. Research in Computational Molecular Biology, Proceedings. Cambridge, Mass: S. Miyano, J. Mesirov, S. Kasif, S. Istrail, P. Pevzner, and M. Waterman (Eds.). Lecture Notes in Computer Science. Berlin: Springer. 152-171.

Chen, T.L., J.F. Wang, and K.Z. Zhang. 2004. A Wavelet Transform Based Method for Road Centerline Extraction. Photogrammetric Engineering and Remote Sensing 70 (12): 1423-1431.

Han, Y., B. Ma, and K.Z. Zhang. 2005. An Automata Approach to Match Gapped Sequence Tags Against Protein Database. International Journal of Foundations of Computer Science 16 (3): 487-497.

Han, Y.H., B. Ma, and K.Z. Zhang. 2005. An Automata Approach to Match Gapped Sequence Tags Against Protein Database. Implementation and Application of Automata, Proceedings. Kingston, Ontario: M. Domaratzki, A. Okhotin, K. Salomaa, and S. Yu (Ed.). Lecture Notes in Computer Science. Berlin: Springer. 167-177.

Ma, B., L.Y. Wu, and K.Z. Zhang. 2005. Improving the Sensitivity and Specificity of Protein Homology Search by Incorporating Predicted Secondary Structures. Computational Science - ICCSA 2005, Pt 2, Proceedings. Singapore: O. Gervasi, M. Gavrilova, V. Kumar, A. Lagana, H. Pueh-Lee, Y. Mun, D. Taniar, and C. Tan (Eds.). Lecture Notes in Computer Science. Berlin: Springer. 960-967.

Ma, B., and K.Z. Zhang. 2005. On the Longest Common Rigid Subsequence Problem. Combinatorial Pattern Matching, Proceedings 16th Annual. Jeju Island, Korea: A. Apostolico, M. Crochemore, and K. Park (Eds.). Lecture Notes in Computer Science. 11-20.

Ma, B., K.Z. Zhang, and C.Z. Liang. 2005. An Effective Algorithm for Peptide De Novo Sequencing From Ms/Ms Spectra. Journal of Computer and System Sciences 70 (3): 418-430.