Publications

Found 4258 results
Author Title Type [ Year(Asc)]
1991
Lim, C-C., & Stolcke A. (1991).  Sather Language Design and Performance Evaluation.
Utans, J., & Moody J. (1991).  Selecting Neural Network Architecture via the Prediction Risk: Application to Corporate Bond Rating Prediction. Proceedings of the First International Conference on Artificial Intelligence Applications on Wall Street.
Blum, M. E., Luby M., & Rubinfeld R. (1991).  Self-Testing/Correcting with Applications to Numerical Problems (Revised Version).
Grigoriev, D. Yu., Karpinski M., & Odlyzko A. M. (1991).  Short Proofs for Nondivisibility of Sparse Polynomials under the Extended Riemann Hypothesis.
Bürgisser, P., Karpinski M., & Lickteig T. Michael (1991).  Some Computational Problems in Linear Algebra as Hard as Matrix Multiplication.
Asanović, K., Beck J., Kingsbury B., Kohn P., Morgan N., & Wawrzynek J. (1991).  SPERT: A VLIW/SIMD Microprocessor for Artificial Neural Network Computations.
Sah, A., Oklobdjiza V. G., & Verma D. C. (1991).  A Study of I/O Architecture for High Performance Next Generation Computers.
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.
Bürgisser, P., Lickteig T. Michael, & Shub M. (1991).  Test Complexity of Generic Poynomials.
S. McCormick, T., Pinedo M. L., Shenker S. J., & Wolf B. (1991).  Transient Behavior in a Flexible Assembly System. International Journal of Flexible Manufacturing Systems. 27-44.
Gibbons, P. B., Karp R. M., Ramachandran V., Soroker D., & Tarjan R.. (1991).  Transitive Compaction in Parallel via Branchings. Journal of Algorithms. 12(1), 110-125.
Kurfess, F. (1991).  Unification with ICSIM.
Karpinski, M., & Werther T. (1991).  VC Dimension and Sampling Complexity of Learning Sparse Polynomials and Rational Functions.
Bürgisser, P., & Lickteig T. Michael (1991).  Verification Complexity of Linear Prime Ideals.
Maresca, M., & Li H. (1991).  Virtual Parallelism Support in Reconfigurable Processor Arrays.
Ahmad, S. (1991).  VISIT: An Efficient Computational Model Of Human Visual Attention.
1990
Guesgen, H. Werner, & Ladkin P. (1990).  An Algebraic Approach to General Boolean Constraint Problems.
Demers, A. J., Keshav S., & Shenker S. J. (1990).  Analysis and Simulation of a Fair Queuing Algorithm. Journal of Internetworking: Research and Experience. 1(1), 3-26.
Feldman, J. (1990).  Apparent Motion and Other Mysteries. 479-486.
Hirsch, M. D. (1990).  Applications of Topology to Lower Bound Estimates in Computer Science.
Karpinski, M., & Luby M. (1990).  Approximating the Number of Solutions of a GF[2] Polynomial.
Herrtwich, R. Guido (1990).  Audio and Video in Distributed Computer Systems: Why and How?.
Zimmermann, W. (1990).  Automatic Worst Case Complexity Analysis of Parallel Programs.
Ferrari, D., & Verma D. C. (1990).  Buffer Space Allocation for Real-Time Channels in a Packet-Switching Network.
Gusella, R. (1990).  Characterizing the Variability of Arrival Processes with Indices of Dispersion.

Pages