Publications

Found 529 results
Author [ Title(Desc)] Type Year
Filters: First Letter Of Last Name is W  [Clear All Filters]
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
Hardy, J.., Frederick C.., Kay P., & Werner J.. (2005).  Color Naming Lens Aging and Grue: What the Optics of the Aging Eye Can Teach Us About Color Language. Psychological Science. 16(4), 321-327.
Albers, S., von Stengel B., & Werchner R. (1995).  A Combined BIT and TIMESTAMP Algorithm for the List Update Problem.
Wendelken, C., & Shastri L. (2002).  Combining Belief and Utility in a Structured Connectionist Agent Architecture. Proceedings of the 24th Annual Conference of the Cognitive Science Society (CogSci 2002).
Demers, A. J., Weiser M., Hayes B., Boehm H-J.., Bobrow D., & Shenker S. J. (1990).  Combining Generational and Conservative Garbage Collection: Framework and Implementations. Proceedings of the 17th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL). 261-269.
Valente, F., Magimai-Doss M., Plahl C., Ravuri S., & Wang W. (2010).  A Comparative Large Scale Study of MLP Features for Mandarin ASR. 2630-2633.
Govil, K., Chan E., & Wasserman H. (1995).  Comparing Algorithms for Dynamic Speed-Setting of a Low-Power CPU.
Wester, M., & Fosler-Lussier E. (2000).  A Comparison of Data-Derived and Knowledge-Based Modeling of Pronunciation Variation. Proceedings of the 6th International Conference on Spoken Language Processing (ICSLP 2000).
Aziz-Zadeh, L., Wilson S.. M., & Iacoboni M. (2005).  A Comparison of Premotor Areas Activated by Action Observation and Action Phrases.
Weaver, N., & Wawrzynek J. (2000).  A Comparison of the AES Candidates Amenability to FPGA Implementation.
Weaver, N., & Wawrzynek J. (2000).  A Comparison of the AES Candidates Amenability to FPGA Implementation.
Shetty, N., Schwartz G., Felegyhazi M., & Walrand J. (2009).  Competitive Cyber-Insurance and Internet Security.
Karp, R. M., Upfal E., & Wigderson A. (1988).  The Complexity of Parallel Search. Proceedings of the 17th Annual ACM Symposium on the Theory of Computing. 225-253.
Karp, R. M., Upfal E., & Wigderson A. (1988).  The Complexity of Parallel Search. Journal of Computer and System Sciences. 36,
von Stengel, B., & Werchner R. (1995).  Complexity of Searching an Immobile Hider in a Graph.
Liu, D., Allman M., Jin S., & Wang L. (2007).  Congestion Control Without a Startup Phase.
Krause, M., Hall M., Williams J. Jay, Paritosh P., Prip J., & Caton S. (2016).  Connecting Online Work and Online Education at Scale. Proceedings of the 2016 CHI Conference Extended Abstracts on Human Factors in Computing Systems. 3536-3541.
Wendelken, C., & Shastri L. (2004).  Connectionist Mechanisms for Cognitive Control.
Garagnani, M., Shastri L., & Wendelken C. (2002).  A Connectionist Model of Planning via Back-Chaining Search. Proceedings of the 24th Annual Conference of the Cognitive Science Society (CogSci 2002).
Garagnani, M., Shastri L., & Wendelken C. (2001).  A Connectionist Model of Planning via Back-Chaining Search. Proceedings of the 20th Workshop of the UK Planning and Scheduling Special Interest Group (PLANSIG 2001).
[Anonymous] (1988).  Connectionist Models and Their Applications. (Waltz, D.., & Feldman J., Ed.).
Renals, S., Morgan N., Bourlard H., Cohen M., Franco H., Wooters C., et al. (1991).  Connectionist Speech Recognition: Status and Prospects.
Wooters, C., & Morgan N. (1992).  Connectionist-Based Acoustic Word Models. Proceedings of the IEEE Workshop on Neural Networks for Signal Processing. 157-163.
Blanton, E., Allman M., Fall K., & Wang L. (2003).  A Conservative Selective Acknowledgment (SACK)-Based Loss Recovery Algorithm for TCP.
Weaver, N., & Allman M. (2009).  On Constructing a Trusted Path to the User.
de Melo, G., & Weikum G. (2012).  Constructing and Utilizing Wordnets using Statistical Methods. Journal of Language Resources and Evaluation. 46(2), 287-311.

Pages