Publications

Found 4228 results
[ Author(Asc)] Title Type Year
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
C
Cole, R., Hirschman L., Atlas L., Beckman M., Biermann A., Bush M., et al. (1995).  The Challenge of Spoken Language Systems: Research Directions for the Nineties. IEEE Transactions on Speech and Audio Processing. 3(1), 1-21.
Coja-Oghlan, A.., Krumke S.. O., & Nierhoff T. (2003).  A Heuristic for the Stacker Crane Problem on Trees Which is Almost Surely Exact. Algorithms and Computation, 14th International Symposium, ISAAC 2003, LNCS 2906. 605-614.
Cohen, E., Halperin E., & Kaplan H.. (2005).  Performance Aspects of Distributed Caches Using TTL-Based Consistency. Theoretical Computer Science. 331(1), 73-96.
Cohen, M., Franco H., Morgan N., Rumelhart D., & Abrash V. (1992).  Multiple-State Context-Dependent Phonetic Modeling with MLPs. Proceedings of the Speech Research Symposium XII.
Cohen, M., Franco H., Morgan N., Rumelhart D., & Abrash V. (1993).  Context-Dependent Multiple Distribution Phonetic Modeling. V, 649-657.
Cohen, M., Franco H., Morgan N., Rumelhart D., & Abrash V. (1992).  Hybrid Neural Network / Hidden Markov Model Continuous Speech Recognition. Proceedings of the International Conference on Spoken Language Processing (ICSLP'92). 915-918.
Cohen, E., & Shenker S. J. (2002).  Replication Strategies in Unstructured Peer-to-Peer Networks. Proceedings of ACM Special Interest Group on Data Communications Conference (SIGCOMM 2002). 177-190.
Codenotti, B., & Margara L. (1992).  Efficient Clustering Techniques for the Geometric Traveling Salesman Problem.
Codenotti, B., & Margara L. (1992).  Local Properties of Some NP-Complete Problems.
Codenotti, B., Leoncini M., & Resta G. (1991).  Oracle Computations in Parallel Numerical Linear Algebra.
Codenotti, B., Manzini G., Margara L., & Resta G. (1993).  Perturbation: An Efficient Technique for the Solution of Very Large Instances of the Euclidean TSP.
Codenotti, B., Datta B. N., Datta K., & Leoncini M. (1994).  Fast and Efficient Parallel Algorithms for Problems in Control Theory.
Cocchi, R., Shenker S. J., Estrin D., & Zhang L. (1993).  Pricing in Computer Networks: Motivation, Formulation, and Example. IEEE/ACM Transactions on Networking. 1(6), 614-627.
Cocchi, R., Estrin D., Shenker S. J., & Zhang L. (1991).  A Study of Priority Pricing in Multiple Service Class Networks. Proceedings of the ACM SIGCOMM '91 Conference on Communications Architecture & Protocols. 123-130.
Cleve, R., & Dagum P. (1989).  A Constructive Omega(t(superscript 1.26)) Lower Bound for the Ramsey Number R (3,t).
Cleve, R., & Luby M. (1990).  A Note on Self-Testing/Correcting Methods for Trigonometric Functions.
Cleve, R. (1990).  Complexity Theoretic Issues Concerning Block Ciphers Related to D.E.S..
Cleve, R. (1990).  Towards Optimal Simulations of Formulas by Bounded-Width Programs.
Cleve, R. (1989).  Controlled Gradual Disclosure Schemes for Random Bits and Their Applications.
Clay, R. D., & Séquin C. H. (1991).  Limiting Fault-Induced Output Errors In ANNs.
Clausen, M., Dress A., Grabmeier J., & Karpinski M. (1989).  On Zero-Testing and Interpolation of k-Sparse Multivariate Polynomials over Finite Fields.
Clark, D. D., Shenker S. J., & Zhang L. (1992).  Supporting Real-Time Applications in an Integrated Services Packet Network: Architecture and Mechanism. Proceedings of the ACM SIGCOMM '92 Conference on Communications Architecture & Protocols. 14-26.
Clark, D. D., Estrin D., Herzog S., & Shenker S. J. (1996).  Pricing in Computer Networks: Reshaping the Research Agenda. 97-126.
Chuzhoy, J., Guha S., Halperin E., Khanna S., Kortsarz G., Krauthgamer R., et al. (2005).  Asymmetric K-Center Is Log* N-Hard to Approximate. Journal of the ACM. 52(4), 538-551.
Chuzhoy, J., Guha S., Halperin E., Khanna S., Kortsarz G., & Naor S.. (2004).  Tight Lower Bounds for the Asymetric k-Center Problem. Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC04).

Pages