Publications

Found 4070 results
Author Title Type [ Year(Asc)]
1987
Ramachandran, V. (1987).  A Minimax Arc Theorem for Reducible Flow Graphs.
Moody, J. (1987).  Perspectives on Associative Memories. Proceedings of the IEEE First International Conference on Neural Networks.
Feldman, J., & Brown C. M. (1987).  Recent Progress of the Rochester Image Understanding Project. Proceedings of the DARPA Image Understanding Workshop. 65-70.
Adler, I., Karp R. M., & Shamir R. (1987).  A Simplex variant solving an m*d linear program in O(min(m2, d2)) expected number of pivot steps. Journal of Complexity. 3(4), 372-387.
Shenker, S. (1987).  Some Conjectures on the Behavior of Acknowledgement-Based Transmission Control of Random Access Communication Channels. Proceedings of the 1987 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems (SIGMETRICS '87). 245-255.
1986
Frankle, J.., & Karp R. M. (1986).  Circuit placements and costs bounds by eigenvector decomposition. Proceedings of the IEEE International Conference on Computer-Aided Design (ICCAD-86), A Conference for the EE CAD Professional. 414-417.
Karp, R. M. (1986).  Combinatorics, Complexity, and Randomness. Communications of the ACM. 29(2), 98-109.
Karp, R. M. (1986).  Combinatorics, Complexity and Stochastic Algorithms. Informatie. 28(9), 722-733.
Karp, R. M. (1986).  The complexity of parallel computation. Proceedings of the Fourth MIT Conference on Advanced Resarch in VLSI.
Feldman, J., McClelland J.. L., Bower G.., & McDermott D.. (1986).  Connectionist Models and Cognitive Science: Goals, Directions and Implications.
Adler, I., Karp R. M., & Shamir R. (1986).  A family of simplex variants solving an m*d linear program in expected number of pivot steps depending on d only. Mathematics of Operations Research. 11(4), 570-590.
Floyd, S., & Karp R. M. (1986).  FED bin packing for item sizes with distributions on (0,1/2). Proceedings of the 27th Annual Symposium on Foundations of Computer Science. 322-330.
Bialek, W.., Moody J., & Wilczek F. (1986).  Macroscopic T Nonconservation: Prospects for a New Experiment. 56,
Feldman, J., & Shastri L. (1986).  Neural Nets, Routines and Semantic Networks.
Moody, J., Shapere A. D., & Wilczek F. (1986).  Realizations of Magnetic Monopole Gauge Fields: Diatoms and Spin-Precession. 56,
Karp, R. M., Saks M., & Wigderson A. (1986).  On a Search Problem Related to Branch-and-Bound Procedures. Proceedings of the 27th Annual Symposium on Foundations of Computer Science. 19-28.
Fillmore, C. J. (1986).  U-Semantics, Second Round. Quaderni di Semantica. 49-58.
Fillmore, C. J. (1986).  Varieties of Conditional Sentences. Proceedings of the Third Eastern States Conference on Linguistics. 163-182.
1985
Feldman, J., Brown C. M., Ellis C. S., LeBlanc T. J., & Peterson G. L. (1985).  Artificial Intelligence Research on the Butterfly Multicomputer. Proceedings of the Workshop on Artificial Intelligence and Distributed Problem Solving. 109-118.
Krauss, L.., Moody J., Wilczek F., & Morris D.. (1985).  Calculations for Cosmic Axion Detection. 55(17), 1797-1800.
Karp, R. M. (1985).  The complexity of parallel computation. Proceedings of the 23rd Annual Allerton Conference on Communication, Control, and Computing. 1.
Feldman, J. (1985).  Connectionist Models and Parallelism in High Level Vision.
Feldman, J. (1985).  Connectionist Models and Parallelism in High Level Vision. CVGIP. 31, 178-200.
Feldman, J. (1985).  Connectionist Models and Their Applications. 9(1), 1-2.
Feldman, J. (1985).  Connections: Massive Parallelism in Natural and Artificial Intelligence. 277-284.

Pages