Publications

Export 7148 results:
[ Author(Desc)] Title Type Year
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
A
Aloimonos Y.  1997.  Visual navigation: from biological systems to unmanned ground vehicles.
Alon N, Azar Y, Vishkin U.  1986.  Tight complexity bounds for parallel comparison sorting. 27th Annual Symposium on Foundations of Computer Science. :502-510.
Alon N, Srinivasan A.  1997.  Improved parallel approximation of a class of integer programming problems. Algorithmica. 17(4):449-462.
Alonso D L, Rose A, Plaisant C, Norman KL.  1998.  Viewing personal history records: A comparison of tabular format and graphical presentation using LifeLines. Behaviour & Information Technology. 17(5):249-262.
Alter TD, Jacobs DW.  1994.  Error propagation in full 3D-from-2D object recognition. Computer Vision and Pattern Recognition, 1994. Proceedings CVPR '94., 1994 IEEE Computer Society Conference on. :892-898.
Alter TD, Jacobs DW.  1994.  Error propagation in 3D-from-2D recognition: Scaled-orthographic and perspective projections. Proceedings: ARPA Image Understanding Workshop, Monterey, California.
Alter TD, Jacobs DW.  1998.  Uncertainty propagation in model-based recognition. International Journal of Computer Vision. 27(2):127-159.
Alva U, Gupta SK.  2001.  Automated design of sheet metal punches for bending multiple parts in a single setup. Robotics and Computer-Integrated Manufacturing. 17(1–2):33-47.
Alva U, Gupta SK.  1999.  Automated punch shape synthesis for sheet metal bending operations.
Alva U, Gupta SK, Gupta RK.  2000.  Automated design of sheet metal bending tools.
Alwen J, Katz J, Lindell Y, Persiano G, Shelat A, Visconti I.  2009.  Collusion-free multiparty computation in the mediated model. Advances in Cryptology-CRYPTO 2009. :524-540.
Ambainis A, Gasarch W, Srinivasan A, Utis A.  2006.  Session 8A-Combinatorial Optimization and Quantum Computing-Lower Bounds on the Deterministic and Quantum Communication Complexities of Hamming-Distance Problems. Lecture Notes in Computer Science. 4288:628-637.
Ambainis A, Gasarch W, Srinivasan A, Utis A.  2006.  Lower Bounds on the Deterministic and Quantum Communication Complexities of Hamming-Distance Problems. Algorithms and ComputationAlgorithms and Computation. 4288:628-637.
Amir A, Landau GM, Vishkin U.  1992.  Efficient pattern matching with scaling. Journal of Algorithms. 13(1):2-32.
Amir A, Roussopoulos N.  1990.  Optimal view caching. Information Systems. 15(2):169-171.
An J-hoon(D), Chaudhuri A, Foster JS, Hicks MW.  2011.  Dynamic inference of static types for ruby. Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages. :459-472.
Anagnostakis K, Hicks MW, Ioannidis S, Keromytis A, Smith J.  2000.  Scalable Resource Control in Active Networks. Active NetworksActive Networks. 1942:343-357.
Anand P, King J, Boyd-Graber J, Wagner E, Martell C, Oard D, Resnik P.  2011.  Believe Me—We Can Do This! Annotating Persuasive Acts in Blog Text. Workshops at the Twenty-Fifth AAAI Conference on Artificial Intelligence.
Ananthanarayanan A, Bejgerowski W, Mueller D, Gupta SK.  2008.  Development of a multi-piece multi-gate mold for manufacturing a flapping wing drive-mechanism. Transactions of North American Manufacturing Research Institution of SME. 36
Ananthanarayanan A, Gupta SK, Bruck HA.  2009.  Characterization and control of pin diameter during in-mold assembly of mesoscale revolute joints. North American Manufacturing Research Institute. 37
Ananthanarayanan A, Thamire C, Gupta SK.  2007.  Investigation of Revolute Joint Clearances Created by an In-Mold Assembly Process. :112-117.
Ananthanarayanan A, Ehrlich L, Desai JP, Gupta SK.  2011.  Design of Revolute Joints for In-Mold Assembly Using Insert Molding. Journal of Mechanical Design. 133:121010-121010.
Ananthanarayanan A, Gupta SK, Bruck HA, Yu Z, Rajurkar KP.  2007.  Development of in-mold assembly process for realizing mesoscale revolute joints. Transactions of North American Manufacturing Research Institution of SME. 35
Andersen DG, Feamster N.  2006.  Challenges and Opportunities in Internet Data Mining. CMU-PDL-06-102:44-44.
Andersen DG, Feamster N, Bauer S, Balakrishnan H.  2002.  Topology inference from BGP routing dynamics. Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment. :243-248.

Pages