Publications

Found 4120 results
Author [ Title(Desc)] 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
Aziz-Zadeh, L., Wilson S.. M., & Iacoboni M. (2005).  A Comparison of Premotor Areas Activated by Action Observation and Action Phrases.
Zhang, H., & Knightly E. W. (1994).  Comparison of Rate-Controlled Static Priority and Stop-and-Go.
Eddy, W. M., & Allman M. (2003).  A Comparison of RED's Byte and Packet Modes.
Eddy, W. M., & Allman M. (2002).  A Comparison of RED's Byte and Packet Modes.
Yaman, S., & Lee C-H. (2008).  A Comparison of Single- and Multi-Objective Programming Approaches to Problems with Multiple Design Objectives. Journal of Signal Processing Systems.
Weaver, N., & Wawrzynek J. (2000).  A Comparison of the AES Candidates Amenability to FPGA Implementation.
Kääriäinen, M., & Langford J. (2005).  A Comparison of Tight Generalization Error Bounds. Proceedings of the 22nd International Conference on Machine Learning (ICML 2005). 409-416.
Lei, H., & Mirghafori N. (2008).  Comparisons of Recent Speaker Recognition Approaches Based on Word Conditioning.
Hermansky, H., Bayya A., Morgan N., & Kohn P. (1991).  Compensation for the effect of the communication channel in Perceptual Linear Predictive (PLP) analysis of speech. Proceedings of the Second European Conference on Speech Communication and Technology (Eurospeech '91). 1367-1370.
El-Yaniv, R., Fiat A., Karp R. M., & Turpin G. (1992).  Competitive analysis of financial games. Proceedings 33rd Annual Symposium on Foundations of Computer Science. 327-333.
El-Yaniv, R., Fiat A., Karp R. M., & Turpin G. (1992).  Competitive Analysis of Financial Games.
Shetty, N., Schwartz G., Felegyhazi M., & Walrand J. (2009).  Competitive Cyber-Insurance and Internet Security.
Irani, S. (1992).  Competitive On-line Algorithms for Paging and Graph Coloring.
Fiat, A., Karp R. M., Luby M., McGeoch L.. A., Sleator D.. D., & Young N.. E. (1991).  Competitive paging algorithms. Journal of Algorithms. 12(4), 685-699.
Feldman, J., & Curry J.. (1967).  The Compiler-compiler in a Time-Sharing Environment.
Feldman, J., & Curry J.. (1967).  The Compiler-compiler in a Time-Sharing Environment. Bit Dropper.
Hampton, M.., & Asanović K. (2008).  Compiling for Vector-Thread Architectures. 205-215.
Harren, M.., Hellerstein J. M., Huebsch R., Loo B. Thau, Shenker S., & Stoica I. (2002).  Complex Queries in DHT-based Peer-to-Peer Networks. Proceedings of the First International Workshop on Peer-to-Peer Systems (IPTPS '02). 2429, 242-250.
Blum, L., Cucker F., Shub M., & Smale S. (1995).  Complexity and Real Computation: A Manifesto.
Santos, E. E. (1994).  Complexity Issues for Solving Triangular Linear Systems in Parallel.
Karpinski, M., & der Heide F. Meyer auf (1990).  On the Complexity of Genuinely Polynomial Computation.
Gramm, J., Nierhoff T., Sharan R., & Tantau T. (2004).  On the Complexity of Haplotyping via Perfect Phylogeny. Proceedings of the Second RECOMB Satellite Workshop on Computational Methods for SNPs and Haplotypes. 35-46.
Karp, R. M. (1985).  The complexity of parallel computation. Proceedings of the 23rd Annual Allerton Conference on Communication, Control, and Computing. 1.
Karp, R. M. (1986).  The complexity of parallel computation. Proceedings of the Fourth MIT Conference on Advanced Resarch in VLSI.
Karp, R. M., Upfal E., & Wigderson A. (1988).  The Complexity of Parallel Search. Journal of Computer and System Sciences. 36,

Pages