Publications
Export 969 results:
Author Title Type [ Year] Filters: First Letter Of Last Name is A [Clear All Filters]
1988. The Maryland approach to image understanding. Science Applications International Corp, Proceedings: Image Understanding Workshop,. 1
1988. Optimal Computing Of Structure From Motion Using Point Correspondences In Two Frames. Proceedings of Second International Conference on Computer Vision. :449-453.
1988. Robust computation of intrinsic images from multiple cues. Advances in Computer Vision. 1:115-163.
1988. Using flow field divergence for obstacle avoidance in visual navigation. Science Applications International Corp, Proceedings: Image Understanding Workshop,. 2
1987. Determining three dimensional transformation parameters from images: Theory. 1987 IEEE International Conference on Robotics and Automation. Proceedings. 4:57-61.
1987. Spatiotemporal blur paths for image flow estimation (A). Journal of the Optical Society of America A. 4:35-35.
1987. Tight comparison bounds on the complexity of parallel sorting. SIAM J. Comput.. 16(3):458-464.
1987. Time Stress Effects on Two Menu Selection Systems. Proceedings of the Human Factors and Ergonomics Society Annual MeetingProceedings of the Human Factors and Ergonomics Society Annual Meeting. 31(7):727-731.
1986. Algorithm for concurrency control in replicated databases.. COMP. SYST. SCI. ENG.. 1(2):75-81.
1986. Computing Intrinsic Images..
1986. The parsimonious covering model for inexact abductive reasoning in diagnostic systems. Recent Developments in the Theory and Applications of Fuzzy Sets. Proceedings of NAFIPS. :86-1986.
1986. Practicality of non-interfering checkpoints in distributed database systems. IEEE Real-Time Systems Symposium, New Orleans, Louisiana. :234-241.
1986. Shape and 3-d motion from contour without point to point correspondences: General principles. CVPR86. :518-527.
1986. Tight complexity bounds for parallel comparison sorting. 27th Annual Symposium on Foundations of Computer Science. :502-510.
1986. Tight complexity bounds for parallel comparison sorting. 27th Annual Symposium on Foundations of Computer Science. :502-510.
1986. Using abductive inferencing to derive complex error classifications for discrete sequential processes. Proceedings of the 19th annual symposium on Simulation. :207-225.