Publications

Export 7151 results:
Author Title Type [ Year(Desc)]
1991
Dorr BJ.  1991.  Machine translation: A principle-based approach. Artificial intelligence at MIT expanding frontiers. :326-361.
Cardenas-Garcia S, Zelkowitz MV.  1991.  A management tool for evaluation of software design. Software Engineering, IEEE Transactions on. 17(9):961-971.
Elgot-drapkin J, Miller M, Perlis D.  1991.  Memory, reason and time: the Step-Logic approach. Philosophy and AI: Essays at the Interface. :79-103.
Selby RW, Porter A, Schmidt DC, Berney J.  1991.  Metric-driven analysis and feedback systems for enabling empirically guided software development. Proceedings of the 13th international conference on Software engineering. :288-298.
Clemens DT, Jacobs DW.  1991.  Model group indexing for recognition. Computer Vision and Pattern Recognition, 1991. Proceedings CVPR '91., IEEE Computer Society Conference on. :4-9.
Agrawala AK, Sanghi D.  1991.  Modeling of cross traffic in conjunction with deterministic analysis of queues.
Roussopoulos N, Delis A.  1991.  Modern client-server DBMS architectures. ACM SIGMOD RecordSIGMOD Rec.. 20(3):52-61.
Spetsakis M, Aloimonos Y.  1991.  A multi-frame approach to visual motion perception. International Journal of Computer Vision. 6(3):245-255.
Etherington DW, Kraus S, Perlis D.  1991.  Nonmonotonicity and the scope of reasoning. Artificial Intelligence. 52(3):221-261.
Wu SA, JaJa JF.  1991.  Optimal algorithms for adjacent side routing. Algorithmica. 6(1):565-578.
Jacobs DW.  1991.  Optimal matching of planar models in 3D scenes. Computer Vision and Pattern Recognition, 1991. Proceedings CVPR '91., IEEE Computer Society Conference on. :269-274.
Plaisant C.  1991.  An overview of Hyperties, its user interface and data model. Hypermedia/Hypertext And Object-Oriented Databases. Chapman & Hall. :17-31.
JaJa JF, Chang S-C.  1991.  Parallel Algorithms for Channel Routing in the Knock-Knee Model. SIAM Journal on Computing. 20(2):228-245.
JaJa JF.  1991.  Parallel algorithms for VLSI routing. Integration, the VLSI Journal. 12(3):305-320.
Matias Y, Vishkin U.  1991.  On parallel hashing and integer sorting. Journal of Algorithms. 12(4):573-606.
Varshney A.  1991.  Parallel radiosity techniques for mesh-connected SIMD computers.
Hua KA, Hannenhalli S.  1991.  Parallel transitive closure computations using topological sort. , Proceedings of the First International Conference on Parallel and Distributed Information Systems, 1991. :122-129.
Roussopoulos N, Kang H.  1991.  A pipeline N-way join algorithm based on the 2-way semijoin program. IEEE Transactions on Knowledge and Data Engineering. 3(4):486-495.
Khuller S, Vazirani VV.  1991.  Planar graph coloring is not self-reducible, assuming P ≠ NP. Theoretical Computer Science. 88(1):183-189.
Kurkulos M, Weinberg JM, Pepling ME, Mount SM.  1991.  Polyadenylylation in copia requires unusually distant upstream sequences. Proceedings of the National Academy of SciencesPNAS. 88(8):3038-3042.
desJardins M.  1991.  Probabilistic evaluation of bias for learning systems. Proceedings of the Eighth International Workshop on Machine Learning. :495-499.
Perlis D.  1991.  Putting One's Foot in One's Head–Part I: Why. Noûs. :435-455.
Banerjee S, Mount D, Rosenfeld A.  1991.  Pyramid computation of neighbor distance statistics in dot patterns. CVGIP: Graphical Models and Image Processing. 53(4):373-381.
Kraus S, Perlis D, Horty JF.  1991.  Reasoning about ignorance: A note on the Bush-Gorbachev problem. Fundam. Inform.. 15(3-4):325-332.
Reggia JA, Peng Y, Bourret P.  1991.  Recent applications of competitive activation mechanisms. Neural Networks: Advances and Applications. :33-62.

Pages