Publications

Found 4258 results
Author Title [ Type(Desc)] Year
Technical Report
Ar, S., Blum M. E., Codenotti B., & Gemmell P. (1992).  Checking Approximate Computations Over the Reals.
Lei, H., Choi J., & Friedland G. (2011).  City-Identification on Flickr Videos Using Acoustic Features.
Ferrari, D. (1990).  Client Requirements for Real-Time Communication Services.
Schmidt, H. W., & Omohundro S. (1991).  CLOS, Eiffel, and Sather: A Comparison.
Asanović, K., Beck J., Callahan T. J., Feldman J., Irissou B., Kingsbury B., et al. (1993).  CNS-1 Architecture Specification: A Connectionist Network Supercomputer.
Feldman, J. (1993).  CNS-1 Architecture Specification: A Connectionist Network Supercomputer.
Seredynski, F. (1996).  Coevolutionary Game-Theoretic Multi-Agent Systems: the Application to Mapping and Scheduling Problems.
Jurafsky, D. (1993).  A Cognitive Model of Sentence Interpretation: the Construction Grammar Approach.
Privitera, C. M. (1995).  A Cognitive Off-line Model for Motor Interpretation of Handwritten Words.
Krämer, B., & Wegner L. (1997).  Collaboration Support in Networked Distance Learning.
Aberer, K. (1991).  Combinatory Differential Fields: An Algebraic Approach to Approximate Computation and Constructive Analysis.
Albers, S., von Stengel B., & Werchner R. (1995).  A Combined BIT and TIMESTAMP Algorithm for the List Update Problem.
Floyd, S. (1996).  Comments on Measurement-based Admissions Control for Controlled-Load Services.
Beigel, R. (1992).  Communicating with Low-Diffraction Lasers and Mirrors.
Böcking, S. (1995).  Communication Performance Models.
Govil, K., Chan E., & Wasserman H. (1995).  Comparing Algorithms for Dynamic Speed-Setting of a Low-Power CPU.
He, X., Papadopoulos C., Radoslavov P., & Govindan R. (2001).  A Comparison of Incremental Deployment Strategies for Router-Assisted Reliable Multicast.
Zhang, H., & Knightly E. W. (1994).  Comparison of Rate-Controlled Static Priority and Stop-and-Go.
El-Yaniv, R., Fiat A., Karp R. M., & Turpin G. (1992).  Competitive Analysis of Financial Games.
Irani, S. (1992).  Competitive On-line Algorithms for Paging and Graph Coloring.
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.
von Stengel, B., & Werchner R. (1995).  Complexity of Searching an Immobile Hider in a Graph.
Berman, P., Karpinski M., Larmore L. L., Plandowski W., & Rytter W. (1996).  The Complexity of Two-Dimensional Compressed Pattern Matching.

Pages