John Canny: Publications by topic

Activity Modeling + Collaborative Filtering
  1. Tye Rattenbury and John Canny, CAAD: An Automatic Task Support System, Proceedings of the 2007 ACM Conference on Human Factors in Computing Systems CHI’07 - pages 687-696 (PDF)
  2. Ryan Aipperspach, Tye Rattenbury, Allison Woodruff, and John Canny. A Quantitative Method for Revealing and Comparing Places in the Home in Proc. Ubicomp 2006, CA (PDF)
  3. Ryan Aipperspach, Elliot Cohen, and John Canny. Modeling Human Behavior from Simple Sensors in the Home IEEE Conf. on Pervasive Computing, Dublin Ireland, April 2006. (PDF)
  4. Marc Davis, Michael Smith, Fred Stentiford, Adetokunbo Bambidele, John Canny, Nathan Good, Simon King, and Rajkumar Janakiraman. Using Context and Similarity for Face and Location Identification. Proc. IS&T/SPIE 18th Annual Symposium on Electronic Imaging Science and Technology Internet Imaging VII, San Jose, California, IS&T/SPIE Press, 2006
  5. Marc Davis, Michael Smith, John Canny, Nathan Good, Simon King, and Rajkumar Janakiraman. Towards Context-Aware Face Recognition Proceedings 13th Annual ACM International Conference on Multimedia (MM 2005) in Singapore, ACM Press, 483-486, 2005
  6. John Canny: GAP: A Factor Model for Discrete Data, ACM Conference on Information Retrieval (SIGIR) July 2004, Sheffield, England (PDF)
  7. John Canny, Collaborative Filtering with Privacy via Factor Analysis, ACM SIGIR, Tampere Finland, August 2002. (PDF)

Computer-Supported Cooperative Work and CSCL

  1. Carle, A., Canny, J. & Clancy, M. (2006). PACT: A Pattern-Annotated Course Tool. In P. Kommers & G. Richards (Eds.), Proceedings of World Conference on Educational Multimedia, Hypermedia and Telecommunications 2006 (pp. 2054-2060). Chesapeake, VA: AACE. (pdf)
  2. Matthew Kam, Jingtao Wang, Alastair Iles, Eric Tse, Jane Chiu, Daniel Glaser, Orna Tarshish, and John Canny.  Livenotes: A System for Cooperative and Augmented Note-Taking in Lectures.  Proceedings of CHI 2005 ( Full paper) Portland , Oregon , April 5-7, 2005.  (PDF)
  3. Alastair Iles, Daniel Glaser, Matthew Kam, and John Canny. Distributed learning: Livenotes and handheld wireless technology. In ACM Conf. on Computer-Supported Collaborative Learning (CSCL), Jan 2002. (PDF)
  4. Joanie Connell, Jerry Mendelsohn, Rick Robins, and John Canny. Don’t hang up on the phone, yet! In ACM GROUP (Conf. on Group support), Sept 2001. (PDF)
  5. Francesca Barrientos and John Canny. Cursive, a novel interaction technique for controlling expressive avatar gesture. In ACM UIST, 2001. short paper. (PDF)

Real-time Simulation (non-linear FEM) of Soft Objects

  1. Y.Zhuang and J. Canny. Haptic Interactions with Global Deformations, 
    IEEE Int. Conf. on Rob. & Autom. (ICRA)
    , 2000. (PDF)
  2. Y.Zhuang and J. Canny. Real-Time Global Deformations, Workshop on Algorithmic Foundations of Robotics (WAFR-2000), 2000. (PDF)
  3. Yan Zhuang and John Canny. Real-time simulation of physically realistic global deformation. In IEEE Visualization Conf., San Francisco, 1999. (PDF)
  4. Yan Zhuang and John Canny. Real-time and physically realistic simulation of global deformation. In ACM SIGGRAPH, 1999. Technical Sketch. (PDF)

Impulse-based Simulation of Rigid (and articulated) Objects

  1. Brian Mirtich and John Canny. Impulse-based simulation of rigid bodies. In Symp. on Interactive 3D Graphics, 1995. Monterrey, CA. (PDF)
  2. Brian Mirtich and John Canny, ``Impulse-based Dynamic Simulation,'' in Proc. Workshop on  Algorithmic Foundations of Robotics (WAFR-94), February 1994 (PDF)

Fast Collision Detection

  1. M.C. Lin, D. Manocha, and J. Canny. Fast contact determination in dynamic environments. In IEEE Conference on Robotics and Automation, pages 602-609, 1994. (PDF)
  2. M. Lin and J. Canny. Efficient collision detection for animation. In Third Eurographics Workshop, 1992.
  3. M. Lin and J. Canny. A fast algorithm for incremental distance calculation.
    In IEEE Conf. on Robotics and Automation, pages 1008-1014, 1991. (PDF)

Computational Geometry

  1. I.Z. Emiris, J.F. Canny, and R. Seidel. Efficient perturbations for handling geometric degeneracies. Algorithmica, 19(1-2):219-242, 1997. (PDF)
  2. I.Z. Emiris and J.F. Canny. A general approach to removing degeneracies. SIAM J. Computing, 24(3):650-664, 1995. (PDF)
  3. David Parsons and John Canny. Geometric problems in molecular biology and robotics. In Proceedings of the Second International Conference on Intelligent Systems for Molecular Biology, Stanford, CA, August 1994.
  4. I. Emiris and J. Canny. An efficient approach to removing geometric degeneracies. In ACM Symposium on Computational Geometry, pages 74-82, 1992. (PDF)
  5. John Canny, Bruce Donald, and Gene Ressler. A rational rotation method for robust geometric algorithms. In ACM Symposium on Computational Geometry, pages 251-260, 1992. (PDF)
  6. I. Emiris and J. Canny. A general approach to removing degeneracies. In IEEE Conference on Foundations of Computer Science, pages 405-413, 1991. (PDF)
  7. Z. Gigus, J.F. Canny, and R. Seidel. Efficiently computing and representing aspect graphs of polyhedral objects. IEEE Trans. Pattern Analysis and Machine Intelligence, 13(6):542-551, 1991.
  8. J. F. Canny and B. R. Donald. Simplified voronoi diagrams. Discrete and  Computational Geometry, 3:219-236, 1988.
  9. Z. Gigus, J.F. Canny, and R. Seidel. Efficiently computing and representing aspect graphs of polyhedral objects. In Proc. 2nd Int. Conf. on Computer Vision, New York, pages 654-661, 1988.
  10. J. Canny and B. Donald. Simplified voronoi diagrams. In ACM Symposium on Computational Geometry, 1987.
  11. J. F. Canny. Collision detection for moving polyhedra. IEEE Trans. Pattern Analysis and Machine Intelligence, pages 200-209, 1986.
  12. J. Canny. On finding collisions between polyhedra. In Proc. ECAI-84 (European Conf. on Artificial Intelligence), 1984.

Computational Algebra - Sparse Resultants

  1. J. Canny and I. Emiris. A subdivision-based algorithm for the sparse resultant. Journal of the ACM, 47(3):417–451, 2000. (PDF)
  2. I.Z. Emiris and J.F. Canny. Efficient incremental algorithms for the sparse resultant and the mixed volume. Journal of Symbolic Computation, 20(2):117-149, 1995. (PDF)
  3. Dinesh Manocha and John Canny. Multipolynomial resultant algorithms. Journal of Symbolic Computation, 15(2):99-122, 1993.
  4. Ioannis Emiris and John Canny. A practical method for the sparse resultant. In M. Bronstein, editor,  Proc. of ACM Int. Symp. Symbolic Algebr. Computation (ISSAC), pages 183-192, Kiev, July 1993. (PDF)
  5. John Canny and Ioannis. Emiris. An efficient algorithm for the sparse mixed resultant. In G. Cohen, T. Mora, and O. Moreno, editors, Proc. 10th Intern. Symp. on Applied Algebra,  Algebraic Algorithms and Error-Correcting Codes, pages 89-104. Springer Verlag, May 1993. LNCS 263. (PDF)
  6. J.F. Canny and J.M. Rojas. An optimal condition for determining the exact number of roots of a polynomial system. In International Symposium on Symbolic and Algebraic Computation, 1991. Bonn, Germany.
  7. Dinesh Manocha and John Canny. Multipolynomial resultant algorithms. In Int. Symp. on Intelligent Robotics, 1991. Bangalore, India.
  8. Dinesh Manocha and John Canny. Efficient techniques for multipolynomial resultant algorithms. In ISSAC-91, 1991. Bonn, Germany. (PDF)
  9. J.F. Canny. Generalized characteristic polynomials. Journal of Symbolic Computation, 9(3), 1990.
  10. J.F. Canny. Generalized characteristic polynomials. In International Symposium on  Symbolic and Algebraic Computation, 1988.

Computational Algebra - Roadmaps and Quantifier Elimination

  1. John Canny. Improved algorithms for sign-determination and existential quantifier elimination. Computer Journal, 36(5):409-418, 1993. Special Issue on Quantifier Elimination. (PDF)
  2. John Canny. Computing roadmaps of general semi-algebraic sets. Computer Journal, 36(5):504-514, 1993. Special Issue on Quantifier Elimination. (PDF)
  3. J.F. Canny, D.Y. Grigor'ev, and N.N. Vorobjov. Finding connected components of a semialgebraic set in subexponential time. App. Algebra in Eng. Comm. and Comp., 2:217-238, 1992.
  4. J.F. Canny. An improved sign determination algorithm. In AAECC-91, 1991. New Orleans.
  5. J.F. Canny. Computing roadmaps of general semi-algebraic sets. In AAECC-91, 1991. New Orleans.
  6. C. Bajaj, J. Canny, T. Garrity, and J. Warren. Factoring rational polynomials over the complexes. SIAM Journal on Computing, 22(2):318-331, 1993.
  7. C. Bajaj, J. Canny, T. Garrity, and J. Warren. Factoring rational polynomials over the complexes.  In International Symposium on Symbolic and Algebraic Computation, pages 81-90, 1989.
  8. J. Canny, E. Kaltofen, and L. Yagati. Solving systems of non-linear polynomial equations faster. In International  Symposium on Symbolic and Algebraic Computation, pages 121-128, 1989. (PDF)
  9. J.F. Canny. Some algebraic and geometric computations in PSPACE. In ACM Symposium on  Theory of Computing, pages 460-467, 1988. (PDF)
  10. J.F. Canny. Constructing roadmaps of semi-algebraic sets I: Completeness. Artificial Intelligence, 37:203-222, 1988.
  11. J. Canny. A new algebraic method for robot motion planning and real geometry. In IEEE Conference on  Foundations of Computer Science, 1987.

Geometric Modeling

  1. D. Manocha and J.F. Canny. The implicit representation of rational parametric surfaces. Journal of Symbolic Computation, 13:485-510, 1992.
  2. D. Manocha and J.F. Canny. Algorithms for implicitizing rational parametric surfaces.  Journal of Computer-Aided Geometric Design, 9:25-50, 1992.
  3. D. Manocha and J.F. Canny. Detecting cusps and inflection points in curves. Computer Aided Geometric Design, 9:1-24, 1992.
  4. D. Manocha and J.F. Canny. A new approach for surface intersection. International Journal of Computational Geometry and Applications, 1(4):491-516, 1991. Special issue on Solid Modeling.
  5. D. Manocha and J.F. Canny. Rational curves with polynomial parametrization. Computer Aided Design, 23(9):645-652, 1991.
  6. D. Manocha and J. Canny. Polynomial parametrizations for rational curves. In SPIE Conf. on Curves and Surface in Computer Vision and Graphics, pages 151-162, 1990. Santa Clara, Ca.
  7. D. Manocha and J. Canny. Implicitizing rational parametric surfaces. In Conference on Algebraic  Algorithms and Error-Correcting Codes, 1990. Tokyo.
  8. D. Manocha and J. Canny. Detecting cusps and inflection points on curves. In International Symposium on Symbolic and Algebraic Computation, 1990. Tokyo.
  9. D. Manocha and J. Canny. Algorithms for implicitizating rational parametric surfaces.  In Fourth IMA Conf. on the Mathematics of Surface, 1990. Bath, England.

Edge Detection

  1. J. F. Canny. A computational approach to edge detection. IEEE Trans. Pattern Analysis and Machine Intelligence, pages 679-698, 1986.
  2. J. Canny. A variational approach to edge detection. In AAAI-83, 1983.

Inverse Kinematics

  1. D. Manocha and J.F. Canny. Efficient inverse kinematics for general 6R manipulators. IEEE Journal on Robotics and Automation, pages 648-657, 1994. (PDF)
  2. D. Manocha and J.F. Canny. Real time inverse kinematics of general 6R manipulators. In IEEE Conference on Robotics and Automation, pages 383-389, 1992. (PDF)

 

Developing Regions
  1. Matthew Kam, Divya Ramachandran, Varun Devanathan, Anuj Tewari, John Canny, Localized Iterative Design for Language Learning in Underdeveloped Regions: The PACE Framework, Proceedings of the 2007 ACM Conference on Human Factors in Computing Systems CHI’07 pages 1097-1106 (PDF)
  2. D. Ramachandran, M. Kam, J. Chiu, J. Canny, J. Frankel, Social Dynamics of Early Stage Co-Design in Developing Regions, Proceedings of the 2007 ACM Conference on Human Factors in Computing Systems CHI’07 1087-1096 (PDF)

Perceptual Interfaces

  1. Camera phone based motion sensing: interaction techniques, applications and performance study Jingtao Wang, Shumin Zhai, John Canny, UIST 2006, Montreux Switzerland, pages: 101 - 110 (PDF)

Private Computation

  1. Yitao Duan and John Canny. Zero-knowledge Test of Vector Equivalence and Granulation of User Data with Privacy GrC 2006, IEEE International Conference on Granular Computing, May 10 - 12, Atlanta, USA. (PDF)
  2. Yitao Duan, Jingtao Wang, Matthew Kam and John Canny. A Secure Online Algorithm for Link Analysis on Weighted Graph, SIAM Workshop on Link Analysis, Counterterrorism and Security, (at the SIAM Int. Conf. on Data Mining), Newport Beach, California, USA, 23rd April, 2005 (pdf)
  3. John Canny and Tom Duan: Protecting User Data in Ubiquitous Computing Environments: Towards Trustworthy Environments, Privacy-Enhancing Technologies (PET), Toronto, May 2004 (PDF)
  4. John Canny and Stephen Sorkin: Practical Large-Scale Distributed Key Generation, Eurocrypt May 2004, (PDF)
  5. John Canny, Collaborative Filtering with Privacy, IEEE Conf. on Security and Privacy, Oakland CA, May 2002. (PDF)
  6. Yitao Duan and John Canny. How to Construct Multicast Cryptosystems Provably Secure against Adaptive Chosen Ciphertext Attack RSA Conference 2006, Cryptographers' Track. February 13 - 17, 2006, San Jose, CA, USA. (PDF)

Telepresence

  1. David Nguyen and John Canny, MultiView: improving trust in group video conferencing through spatial faithfulness, Proceedings of the 2007 ACM Conference on Human Factors in Computing Systems CHI’07 pages 1465-1474 (Best paper prize) (PDF)
  2. David Nguyen and John Canny. MultiView: Spatially Faithful Group Video Conferencing. Proceedings of the 2005 Conference on Human Factors in Computing Systems (CHI’05) pp. 512-521. Portland, Oregon. (pdf)
  3. Eric Paulos and John Canny. Social tele-embodiment: Understanding presence. Autonomous Robots, 11(1):87–95, 2001. (PDF)
  4. Eric Paulos and John Canny. Designing personal tele-embodiment.
    In IEEE Conference on Robotics and Automation, 1998. (PDF)
  5. Eric Paulos and John Canny. Prop: Personal roving presence. ACM SIGCHI, 1998. Los Angeles. (PDF)
  6. Eric Paulos and John Canny. Ubiquitous tele-embodiment: Applications and implications. International Journal of Human-Computer Studies, 46(6):861-877, 1997. Special Issue on  Innovative Applications of the World Wide Web. (PDF)
  7. Eric Paulos and John Canny. A world wide web telerobotic remote environment browser. World Wide Web Journal, 1996.
  8. Eric Paulos and John Canny. Delivering real reality to the world wide web via telerobotics. In IEEE Conference on Robotics and Automation, 1996. (PDF)

Universal Planar Manipulation

  1. D. Reznik, J. Canny, and N. Alldrin. Leaving on a plane jet. In 2001 Int. Conf. on Intelligent  Robots & Systems (IROS), Maui, Hawaii, October 2001. (PDF)
  2. D. Reznik and J. Canny. C’mon part, do the local motion! In 2001 IEEE Int. Conf. on Robotics & Autom. (ICRA), Seoul, Korea, May 2001. (PDF)
  3. D. Reznik, E. Moshkovich, and J. Canny. Building a universal part manipulator. In Workshop in Distributed Manipulation, IEEE Int. Conf. on Rob. & Autom. (ICRA), Detroit, MI, May 1999. (PDF)
  4. D. Reznik, E. Moshkovich, and J. Canny. Building a universal part manipulator. In K. Bohringer and H. Choset, editors, Distributed Manipulation. Kluwer Academic Press, 1999.
  5. D. Reznik and J. Canny. A flat rigid plate is a universal planar manipulator.
    In IEEE Conference on Robotics and Automation, 1998. Leuven, Belgium, April  (Anton Phillips best student paper award nomination). (PDF)
  6. D. Reznik and J. Canny. The coulomb pump: A novel parts feeding method using a horizontally-vibrating surface. In IEEE Conference on Robotics and Automation, 1998. Leuven, Belgium, April. (PDF)
  7. D. Reznik and J. Canny. Universal part manipulation in the plane with a single horizontally-vibrating plate. In Int. Workshop on Algorithmic Foundations of Robotics (WAFR), 1998. Houston, TX. (PDF)
  8. D. Reznik, J. Canny, and K. Goldberg. Analysis of part motion on a longitudinally vibrating plate. In Int. Conf. on Intell. Robots and Systems (IROS), 1997. Grenoble, France. (PDF)
  9. D. Reznik and J. Canny. Dynamics of part motion on a longitudinally vibrating parts feeder. In IEEE Int. Symp. on Assembly and Task Planning (ISATP), 1997. Marina del Rey, CA, August.

Motion planning - general

  1. E. Rimon and J. Canny. Construction of c-space roadmaps from local sensory data: What should the sensors look for? In IEEE Conference on Robotics and Automation, pages 117-123, 1994. San Diego.
  2. J.F. Canny and M. Lin. An opportunistic global path planner. Algorithmica, 10:102-120, 1993. (PDF)
  3. J.F. Canny and M. Lin. An opportunistic global path planner. In IEEE Conference on  Robotics and Automation, pages 1554-1561, 1990. (PDF)
  4. G. Heinzinger, P. Jacobs, J. Canny, and B. Paden. Time-optimal trajectories for a robot manipulator:  A provably good approximation algorithm. In Automatic Control Conference, 1990.
  5. P. Jacobs, G. Heinzinger, J. Canny, and B. Paden. Time-optimal trajectories for a robot manipulator:  A provably good approximation algorithm. In IEEE Conference on Robotics and Automation, pages 150-156, 1990. (PDF)
  6. D. Parsons and J. Canny. Motion planning for multiple mobile robots. In IEEE Conference on  Robotics and Automation, pages 8-13, 1990. (PDF)
  7. J. Canny. On computability of fine motion plans. In IEEE Conference on Robotics and  Automation, pages 177-183, 1989. (PDF)
  8. J. Canny and J. Reif. New lower bound techniques for robot motion planning problems. In IEEE Conference  on Foundations of Computer Science, pages 39-48, 1987.
  9. J. Canny. A voronoi method for the piano movers' problem. In IEEE Conference on Robotics and  Automation, 1985.

Motion Planning - Non-holonomic

  1. Philippe Moutarlier, Brian Mirtich, and John Canny. Shortest paths for a car-like robot to manifolds in configuration space. International Journal of Robotics Research, 15(1):36-60, 1996.
  2. B. Donald, P. Xavier, J. Canny, and J. Reif. Kinodynamic motion planning. Journal of the ACM, 40(5):1048-1066, 1993. (PDF)
  3. B. Mirtich and J. Canny. Using skeletons for nonholonomic path planning among obstacles. In IEEE Conference on Robotics and Automation, pages 2533-2540, 1992. (PDF)
  4. J. Canny, A. Rege, and J. Reif. An exact algorithm for kinodynamic planning in the plane. Discrete and Computational Geometry, pages 461-484, 1991.
  5. A. Rege, J. Canny, and J. Reif. An exact algorithm for kinodynamic planning in the plane. In ACM Symposium on Computational Geometry, pages 271-280, 1990. (PDF)
  6. Z. Li and J. Canny. Motion of two rigid bodies with rolling constraint. IEEE Journal on Robotics and Automation, 6(1):62-72, 1990. (PDF)
  7. P. Jacobs and J. Canny. Robust motion planning for mobile robots. In IEEE Conference on  Robotics and Automation, pages 2-7, 1990. (PDF)
  8. Z. Li, J. Canny, and S. Sastry. On motion planning for dextrous manipulation, part I: The problem formulation.  In IEEE Conference on Robotics and Automation, pages 775-780, 1989. (PDF)
  9. Z. Li, J. Canny, and G. Heinzinger. Robot motion planning with nonholonomic constraints. In International  Symposium on Robotics Research, pages 343-350, 1989.
  10. P. Jacobs and J. Canny. Planning smooth paths for mobile robots. In IEEE Conference on  Robotics and Automation, pages 2-7, 1989. (PDF)
  11. J. Canny, B. Donald, J. Reif, and P. Xavier. On the complexity of kinodynamic planning. In IEEE Conference on  Foundations of Computer Science, pages 306-318, 1988. (PDF)

RISC Robotics - Mission statement

  1. John Canny and Ken Goldberg. A RISC approach to sensing and manipulation. Journal of Robotic Systems, 12(6):351-363, 1995. (PDF)
  2. John Canny and Ken Goldberg. A RISC approach to robotics. IEEE Robotics and Automation Magazine, 1(1):26-28, 1994. (PDF)
  3. John Canny and Ken Goldberg. RISC robotics: Recent results and open problems. In IEEE Conference on Robotics and Automation, pages 1951-1958, San Diego CA., 1994. (PDF)

RISC Sensing

  1. A.S. Wallack and J.F. Canny. Object recognition and localization from scanning beam sensors. International Journal of Robotics Research, 16(5):631-659, 1997.
  2. A.S. Wallack and J.F. Canny. Generalized polyhedral object recognition and localization using crossbeam sensing. International Journal of Robotics Research, 16(4):473-496, 1997.
  3. A. Wallack and J. Canny. Complete indexing strategies for sparse sensing techniques. In Proceedings, International Symposium on Assembly and Task Planning, 1996. (PDF)
  4. A. Wallack and J. Canny. Modular fixture design for generalized polyhedra.
    In IEEE Conference on Robotics and Automation, 1996. (PDF) (Nominated for Anton Phillips Best Student Paper Award).
  5. A. Wallack and J. Canny. Object recognition and localization from scanning beam sensors. In IEEE Conference on Robotics and Automation, 1995. Nagoya, Japan, (Nominated for Anton Phillips Best Student Paper Award). (PDF)
  6. Aaron Wallack and John Canny. Efficient indexing techniques for model based sensing. In International Conference on Computer Vision and Pattern Recognition (CVPR), pages 259-266. IEEE, june 1994. (PDF)
  7. A. Wallack, J. Canny, and D. Manocha. Object localization using crossbeam sensing. In IEEE Conference on Robotics and Automation, pages 692-699, 1993. (PDF)
  8. A. Wallack and J. Canny. A geometric matching algorithm for beam scanning. In SPIE Symposium on Vision Geometry II, pages 143-159, 1993. Boston, Massachusetts. (PDF)

RISC Grasping and Fixturing

  1. A.S. Wallack and J.F. Canny. Planning for modular and hybrid fixtures. Algorithmica, 19(1-2):40-60, 1997. (PDF)
  2. A. Wallack and J. Canny. Planning for modular and hybrid fixtures. In IEEE Conference on Robotics and Automation, pages 520-527, 1994. (PDF)
  3. B. Mirtich and J. Canny. Easily computable optimum grasps in 2-D and 3-D. In IEEE Conference on Robotics and Automation, pp 739-747, 1994. (PDF)
  4. Eric Paulos and John Canny. Accurate insertion strategies using simple optical sensors. In IEEE Conference on Robotics and Automation, pages 1656-1662, 1994. (PDF)
  5. Eric Paulos and John Canny. Informed peg-in-hole insertion using optical sensors. In SPIE Conference on Sensor Fusion VI, 1993. Boston Massachusetts.
  6. C. Ferrari and J. Canny. Planning Optimal Grasps. In IEEE Conference on Robotics and Automation, pages 2290-2295, 1992. (PDF)

RISC Actuators and feeders

  1. John Canny and Eric Paulos. Optimal Probing Strategies. International Journal of Robotics Research, 20(8): 694-704, Aug 2001. (PDF)
  2. K. Goldberg, B.V. Mirtich, Y. Zhuang, J. Craig, B.R. Carlisle, and J. Canny. Part pose statistics: estimators and experiments. IEEE Transactions on Robotics and Automation, 15(5):849–857, 1999.
  3. D. Reznik, S. Brown, and J. Canny. Dynamic simulation as a design tool for a microactuator array. In IEEE Conf. on Robotics and Automation (ICRA), 1997. Albuquerque, NM.
  4. Dina R. Berkowitz and John Canny. A comparison of real and simulated designs for vibratory parts feeding. In Proceedings of the IEEE Conference on Robotics and Automation, pages 2377-2382, 1997. (PDF)
  5. Eric Paulos and John Canny. Fast construction of near optimal probing strategies. Workshop on Algorithmic Foundation of Robotics, 1996. (PDF)
  6. Brian Mirtich, Yan Zhuang, Ken Goldberg, John Craig, Rob Zanutta, Brian Carlisle, & John Canny.  Estimating pose statistics for robotic part feeders. IEEE Conf. on Robotics  and Automation., May 1996. Minneapolis. (PDF)
  7. Dina Berkowitz and John Canny. Designing part feeders with dynamic simulation. In IEEE Conference on Robotics and Automation, pages 1127-1132. IEEE, 1996. (PDF)

 

 Back to main page


John Canny
Thursday, May 24, 2007