Technical
Reports
Publications Aaron, E. and S. Allen. Justifying
Calculational Logic by a Conventional Metalinguistic Semantics. TR99-1771,
September 22, 1999.
Editorial Activities of the Faculty ACM Computing Surveys
(Schneider, Editor) Ahmed, Nawaaz. “Synthesizing Transformations for Locality Enhancement of Imperfectly-nested Loop Nests.” International Conference on Supercomputing (ICS’00), ACM SIGARCH. Santa Fe, NM. May 2000. Aguilera, Marcos. “Revisiting the Weakest Failure Detector for Uniform Reliable Broadcast.” 13th International Symposium on Distributed Computing. Bratislava, Slovak Republic. September 27-29, 1999. Glew, Neal. “Advanced Type Structure for Assembly Language.” Computer Science Weekly Seminar, Victoria Univ. of Wellington. January 21, 2000. Grossman, Dan. “Principles in Programming: A Syntactic Proof Technique.” Presented at the 4th ACM SIGPLAN International Conference on Functional Programming. September 28, 1999 (with S. Zdancewic and G. Morrisett). Howe, Nicholas. “Data as Ensembles of Records: Representation and Comparison.” Proceedings of the 17th International Conference on Machine Learning, 2000. June 30, 2000. —. “Using Artificial Queries to Evaluate Image Retrieval.” IEEE Workshop on Content-based Access of Image and Video Databases, 2000. June 12, 2000. —. “Bayesian Reconstruction of 3D Human Motion from Single-camera Video.” Advances in Neural Information Processing Systems. November 30, 1999 (with M. Leventon and W. Freeman). Huang, Y. C. “Control Knowledge in Planning: Benefits and Tradeoffs.” The 16th National Conference on Artificial Intelligence. Orlando, FL. July 21, 1999. Kempe, David. “Connectivity and Inference Problems for Temporal Networks.” STOC 2000. May 23, 2000. Liu, Xiaoming. “Building Reliable, High-Performance Communication Systems from Components.” 17th ACM Symposium on Operating Systems Principles (SOSP 1999) (with C. Kreitz, R. van Renesse, J. Hickey, M. Hayden, K. Birman, and R. Constable). Mardis, Scott. “Partial Parsing for Linguistic Relationship Identification.” Holy Cross College. January 12, 2000. Invited. Mateev, Nikolay. “Next-generation Generic Programming and its Application to Sparse Matrix Computations.” International Conference on Supercomputing (ICS’00), ACM SIGARCH. Santa Fe, NM. May 2000. —. “Matrix Codes: Compiling for High Performance.” HP Labs. Cambridge, MA. April 11, 2000. —. “Matrix Codes: Compiling for High Performance.” Los Alamos National Laboratory. Los Alamos, NM. April 19, 2000. Qiu, Lili. “On Individual and Aggregate TCP Performance.” 7th International Conference on Network Protocols (ICNP ’99). Toronto, Canada. October 1999. Shapiro, Michael. “The Word Problem and Nested Stack Automata.” Dept. of Computer Science, Cornell Univ. Theory Seminar. Wagstaff, Kiri. “A Comparison of Two Clustering Algorithms: BIRCH and CURE.” CS 732, Data Mining Seminar, Cornell Univ., Ithaca, NY. March 15, 2000. —. “An Overview of Clustering Algorithms.” CS 478, Machine Learning, Cornell Univ., Ithaca, NY. April 27, 2000. —. “Using Background Knowledge to Constrain Clustering.” Center for the Study of Language and Intelligence. Stanford, CA. June 22, 2000. —. “Clustering with Instance-level Constraints.” International Conference on Machine Learning. Stanford, CA. June 30, 2000. Walker, David. “Alias Types.” Carnegie Mellon Computer Science Department POP Seminar. Pittsburgh, PA. April 25, 2000. Invited. —. “Secure Certifying Compilation.” IBM T.J. Watson Research Center. Hawthorne, NY. April 12, 2000. Invited. —. “A Type System for Expressive Security Policies.” PoPL ’00. Boston, MA. January 20, 2000. Wang, Jia. “Network Aware Clustering of Web Clients.” AT&T Labs, Florham Park, NJ. August 1999. —. “Efficient and Accurate Ethernet Simulation.” 24th IEEE Annual Conference on Local Computer Networks (LCN ’99). Boston, MA. October 1999. Weirich, Stephanie. “Flexible Type Analysis.” AMC SIGPLAN International Conference on Functional Programming. Paris, France. September 29, 1999. —. “Resource Bound Computation.” AMC SIGPLAN-SIGACT Symposium on Principles of Programming Languages. Boston, MA. January 20, 2000. —. “Resource Bound Computation.” IBM T.J. Watson Research Center. Hawthorne, NY. June 1, 2000. Zdancewic, Steve. “Principles in Programming: A Syntactic Proof Technique.” Presented at the 4th ACM SIGPLAN International Conference on Functional Programming. September 28, 1999 (with D. Grossman and G. Morrisett). Zhang, Yin. “Stepping Stone Detection.” New Research Session, SIGCOMM ’99. Boston, MA. September 1999. —. “Speeding Up Short Date Transfers: Theory, Architectural Support, and Simulation Results.” NOSSDAV’00. Chapel Hill, NC. June 2000. Ahmed, Nawaaz. “Synthesizing Transformations for Locality Enhancement of Imperfectly-nested Loop Nests.” International Conference on Supercomputing, ACM SIGARCH. Santa Fe, NM (May 2000), (with N. Mateev and K. Pingali). Aguilera, Marcos. “On Quiescent Reliable Communication.” SIAM Journal on Computing, Vol 29, No. 6 (April 2000), 2040–2073 (with W. Chen and S. Toueg). —. “Failure Detection and Consensus in the Crash-Recovery Model.” Distributed Computing, Vol. 13, No. 2 (April 2000), 99–125 (with W. Chen and S. Toueg). —. “Revisiting the Weakest Failure Detector for Uniform Reliable Broadcast.” In Proceedings of the 13th International Symposium on Distributed Computing. LNCS, Springer-Verlag (September 1999), 19–33 (Paper won the best student paper award) (with S. Toueg and B. Deianov). —. “A Simple Bivalency Proof that $t$-Resilient Consensus Requires $t+1$ Rounds.” Information Processing Letters. Vol 71, No. 3-4 (August 1999), 155–158 (with S. Toueg). —. “On the Quality of Service of Failure Detectors.” In Proceedings of the International Conference on Dependable Systems and Networks. In pub. (with W. Chen and S. Toueg). Barr, Rimon. “Efficiently Publishing Relational Data as XML Documents.” VLDB 2000 (with J. Shanmugasundaram, E. Shekita, M. Carey, B. Lindsay, H. Pirahesh, and B. Reinwald). Batu, Tugkan. “Fast Approximate PCPs for Multidimensional Bin-Packing Problems.” RANDOM 1999 (with R. Rubinfeld and P. White). —. “Runtime Verification of Remotely Executed Code Using Probabilistically Checkable Proof Systems.” Run-time Result Verification Workshop, FloC 1999 (with R. Rubinfeld and P. White). Chen, Wei. “Failure Detection and Consensus in the Crash-recovery Model.” Distributed Computing, Vol. 13, No. 2 (April 2000), 99–125 (with M. Aguiler and S. Toueg). —. “On Quiescent Reliable Communication.” SIAM Journal on Computing, Vol 29, No. 6 (April 2000), 2040–2073 (with M. Aguiler and S. Toueg). —. “On the Quality of Service of Failure Detectors.” In Proceedings of the International Conference on Dependable Systems and Networks. In pub. (with M. Aguiler and S. Toueg). Chen, Zhiyuan. “An Algebraic Compression Framework for Query Results.” 16th International Conference on Data Engineering (ICDE 2000). San Diego, CA (March 2000), 177–188 (with P. Seshadri). —. “Selectivity Estimation for Boolean Queries.” 19th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS200). Dallas, TX (May 2000), 216–225 (with F. Korn, N. Koudas, and S. Muthukrishnan). Deianov, Borislav. “Revisiting the Weakest Failure Detector for Uniform Reliable Broadcast.” In Proceedings of the 13th International Symposium on Distributed Computing. LNCS, Springer-Verlag (September 1999), 19–33 (Paper won the best student paper award) (with S. Toueg and M. Aguilera). Glew, Neal. “Type Dispatch for Named Hierarchical Types.” In 1999 International Conference of Functional Programming, Paris, France (September 1999), 172–182. —. “Object Closure Conversion.” In 3rd International Workshop on Higher-Order Operational Techniques in Semantics. Paris, France, (September 1999). Grossman, Dan. “Principles in Programming Languages: A Syntactic Proof Technique.” In Proceedings of the 4th ACM SIGPLAN International Conference on Functional Programming. Paris, France (September 1999) (Won Best Paper Award for PLI ’99) (with S. Zdancewic and G. Morrisett). Howe, Nicholas. “Data as Ensembles of Records: Representation and Comparison.” Proceedings of the 17th International Conference on Machine Learning, (2000). —. “Integrating Color, Texture, and Geometry for Image Retrieval.” Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, (2000) (with D. Huttenlocher). —. “Using Artificial Queries to Evaluate Image Retrieval.” IEEE workshop on Content-based Access of Image and Video Databases, (2000). —. “Bayesian Reconstruction of 3D Human Motion from Single-Camera Video.” Advances in Neural Information Processing Systems 12, 2000 (with M. Leventon and W. Freeman). Huang, Y.C. “Control Knowledge in Planning: Benefits and Tradeoffs.” In Proceedings of the 16th National Conference on Artificial Intelligence (July 1999), 511-517 (with B. Selman and H. Kautz). Kempe, David. “Connectivity and Inference Problems for Temporal Networks.” In Proceedings of STOC 2000 (with J. Kleinberg and A. Kumar). Kumar, Amit. “Connectivity and Inference Problems for Temporal Networks.” In Proceedings of STOC 2000 (with J. Kleinberg and D. Kempe). Mateev, Nikolay. “Next-generation Generic Programming and its Application to Sparse Matrix Computations.” International Conference on Supercomputing, ACM SIGARCH. Santa Fe, NM (May 2000), (with V. Kotlyar, K. Pingali, and P. Stodghill). —. “Synthesizing Transformations for Locality Enhancement of Imperfectly-nested Loop Nests.” International Conference on Supercomputing, ACM SIGARCH. Santa Fe, NM (May 2000), (with N. Ahmed and K. Pingali). Mayr, Tobias. “Query Processing with Heterogeneous Resources.” Technical Report TR00-1790, Cornell Univ., Dept. of Computer Science, Ithaca, NY (March 2000), (with P. Bonnet and J. Gehrke). Mittal, Anurag. “Site Modeling for Wide Area Surveillance and Image Synthesis.” In IEEE Conference on Computer Vision and Pattern Recognition. Hilton Head, SC (June 2000), (with D. Huttenlocher). Mukhopadhyay, Sugata. “Passive Capture and Structuring of Lectures.” ACM Multimedia Conference. Orlando, FL (October /November 1999), (Recipient of the Best Student Paper Award) (with B. Smith). Ng, Vincent. “Examining the Role of Statistical and Linguistic Knowledge Sources in a General-knowledge Question-answering System.” Proceedings of the 6th Applied Natural Language Processing Conference (ANLP-2000) (May 2000), 180-187 (with C. Cardie, D. Pierce, and C. Buckeley). Nogin, Alexey. “Writing Constructive Proofs Yielding Efficient Extracted Programs.” Final Proceedings will be published as a volume in Electronic Notes in Theoretical Computer Science, Elsevier Science Publishers. Ooi, Wei Tsang. “Design and Implementation of Programmable Media Gateways.” To appear in NOSSDAV 2000. Chapel Hill, NC (June 2000), (with R. van Renesse and B. Smith). Pellacini, Fabio. “Toward a Psychophysically-based Light Reflection Model for Image Synthesis.” Accepted for publication in SIGGRAPH 2000 (with J. Ferwerda and D. Greenberg). Pierce, David. “Examining the Role of Statistical and Linguistic Knowledge Sources in a General-knowledge Question-answering System.” Proceedings of the 6th Applied Natural Language Processing Conference (ANLP-2000) (May 2000), 180-187 (with C. Cardie, V. Ng, and C. Buckeley). Qiu, Lili. “Integrating Packet FEC into Adaptive Voice Playout Buffer Algorithms on the Internet.” Proceedings of IEEE Infocom 2000. Tel-Aviv, Israel (March 2000), (with J. Rosenberg and H. Schulzrinne). —. “On Individual and Aggregate TCP Performance.” Proceedings of 7th International Conference on Network Protocols (ICNP ’99). Toronto, Canada (October, 1999), (with Y. Zhang and S. Keshav). —. “Speeding Up Short Data Transfers: Theory, Architectural Support, and Simulation Results.” Proceedings of NOSSDAV 2000. Chapel Hill, NC (June 2000), (with Y. Zhang and S. Keshav). —. “The Content and Access Dynamics of a Busy Web Server.” Extended Abstract in Proceedings of ACM SIGMETRICS 2000. Santa Clara, CA (June 2000), (with V. Padmanabhan). Rosenberg, Jonathan. “Integrating Packet FEC into Adaptive Voice Playout Buffer Algorithms on the Internet.” Proceedings of IEEE Infocom 2000. Tel-Aviv, Israel, (March 2000), (with L. Qiu and H. Schulzrinne). Smith, Frederick. “Alias Types.” The European Symposium on Programming. Berlin, Germany, (March 2000), (with D. Walker and G. Morrisett). —. “A Type System for Expressive Security Policies.” Twenty-seventh ACM SIGPLAN Symposium on Principles of Programming Languages. Boston, MA, (January 2000), (with D. Walker). —. “A Type System for Expressive Security Policies.” FLOC ’99 Workshop on Run-time Result Verification. Trento, Italy (July 1999), (with D. Walker). —. “Hancock: A Language for Processing Very Large-Scale Data.” in USENIX 2nd Conference on Domain Specific Languages (1999), 163–176 (with D. Bonachea, K. Fisher, and A. Rogers). Wagstaff, Kiri. “Clustering with Instance-level Constraints.” Proceedings of the International Conference on Machine Learning (June 2000), (with C. Cardie). Walker, David. “A Type System for Expressive Security Policies.” FLOC ’99 Workshop on Run-time Result Verification. Trento, Italy (July 1999), (with F. Smith). —. “A Type System for Expressive Security Policies.” Twenty-seventh ACM SIGPLAN Symposium on Principles of Programming Languages. Boston, MA (January 2000) (with F. Smith). —. “Alias Types.” The European Symposium on Programming. Berlin, Germany (March 2000) (with F. Smith and G. Morrisett). Wang, Jia;. “The Implication of Network Performance on Service Quality.” Technical Report TR99-1754. Department of Computer Science, Cornell Univ. (June 30, 1999) (with Y. Zhang and S. Keshav). —. “A Scalable Efficient Robust Adaptive Architecture for the Next Generation of Web Services.” Technical Report TR99-1767. Department of Computer Science, Cornell Univ. (September 14, 1999). Weirich, Stephanie. “Flexible Type Analysis.” ACM SIGPLAN International Conference on Functional Programming. Paris, France. (September 1999), 233–248 (with K. Crary). —. “Resource Bound Computation.” In Proceedings of the 27th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. Boston, MA (January 2000), 184–198 (with K. Crary). White, Patrick. “Fast Approximate PCP’s for Multidimensional Bin-Packing Problems.” RANDOM 1999 (with T. Batu and R. Rubinfeld ). —. “Runtime Verification of Remotely Executed Code Using Probabilistically Checkable Proof Systems.” Run-time Result Verification Workshop, FloC 1999 (with T. Batu and R. Rubinfeld). Zdancewic, Steve. “Principles in Programming Languages: A Syntactic Proof Technique.” In Proceedings of the 4th ACM SIGPLAN International Conference on Functional Programming. Paris, France, (September 1999), (Won Best Paper Award for PLI’99) (with D. Grossman and G. Morrisett). Zhang, Yin. “On Individual and Aggregate TCP Performance.” Proceedings of 7th International Conference on Network Protocols (ICNP’99). Toronto, Canada, (October, 1999) (with L. Qui and S. Keshav). —. “Speeding Up Short Data Transfers: Theory, Architectural Support, and Simulation Results.” Proceedings of NOSSDAV 2000. Chapel Hill, NC (June 2000) (with L. Qiu and S. Keshav). —. “Stepping Stone Detection.” New Research Session, SIGCOMM ’99. Boston, MA (September 1999) (with V. Paxon). Zhou, Lidong. “Securing Ad Hoc Networks.” IEEE Networks, Special Issue on Network Security (November/December 1999), 24-30 (with Z. Haas).
|
||