#### Filter Results:

- Full text PDF available (191)

#### Publication Year

1983

2017

- This year (5)
- Last 5 years (37)
- Last 10 years (83)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

#### Key Phrases

Learn More

- John F. Canny
- IEEE Transactions on Pattern Analysis and Machineā¦
- 1986

This paper describes a computational approach to edge detection. The success of the approach depends on the definition of a comprehensive set of goals for the computation of edge points. These goals must be precise enough to delimit the desired behavior of the detector while making minimal assumptions about the form of the solution. We define detection andā¦ (More)

- Carlo Ferrari, John F. Canny
- ICRA
- 1992

In this paper we will address the problem of planning optimal grasps. Two general optimality criteria, that consider the total finger force and the maximum finger force will be introduced and discussed. Moreover their formalization, using various metrics on a space of generalized forces, will be detailed. The geometric interpretation of the two criteriaā¦ (More)

- John F. Canny
- STOC
- 1988

We give a PSPACE algorithm for determining the signs of multivariate polynomials at the common zeros of a system of polynomial equations. One of the consequences of this result is that the “Generalized Movers' Problem” in robotics drops from EXPTIME into PSPACE, and is therefore PSPACE-complete by a previous hardness result [Rei]. We also showā¦ (More)

- John F. Canny, John H. Reif
- 28th Annual Symposium on Foundations of Computerā¦
- 1987

We present new techniques for establishing lower bounds in robot motion planning problems. Our scheme is based on path encoding and uses homotopy equivalence classes of paths to encode state. We first apply the method to the shortest path problem in 3 dimensions. The problem is to find the shortest path under an Lp metric (e.g. a euclidean metric) betweenā¦ (More)

- John F. Canny
- SIGIR
- 2002

Collaborative filtering (CF) is valuable in e-commerce, and for direct recommendations for music, movies, news etc. But today's systems have several disadvantages, including privacy risks. As we move toward ubiquitous computing, there is a great potential for individuals to share all kinds of information about places and things to do, see and buy, but theā¦ (More)

- John F. Canny
- IEEE Symposium on Security and Privacy
- 2002

Server-based collaborative filtering systems have been very successful in e-commerce and in direct recommendation applications. In future, they have many potential applications in ubiquitous computing settings. But today's schemes have problems such as loss of privacy, favoring retail monopolies, and with hampering diffusion of innovations. We propose anā¦ (More)

- Paul E. Jacobs, John F. Canny
- ICRA
- 1989

- Brian Mirtich, John F. Canny
- ICRA
- 1994

We consider the problem of nding optimum force closure g r asps of two and three-dimensional objects. Our focus is on grasps which are useful in practice, namely grasps with a small number of ngers, with friction at the contacts. Assuming frictional contact and rounded nger tips|very mild assumptions in practice|we give new upper and lower bounds on theā¦ (More)

- John F. Canny, Kenneth Y. Goldberg
- ICRA
- 1994

At the intersection of robotics, computational geometry, and manufacturing engineering, we have identified a collection of research problems with near-term industrial applications. The common thread is robot systems with Reduced Intricacy in Sensing and Control (RISC), such as light beam sensors and parallel-jaw grippers. We conjecture that such systems,ā¦ (More)

- Bruce Randall Donald, Patrick G. Xavier, John F. Canny, John H. Reif
- J. ACM
- 1993

Kinodynamic planning attempts to solve a robot motion problem subject to simultaneous kinematic and dynamics constraints. In the general problem, given a robot system, we m ust nd a minimal-time trajectory that goes from a start position and velocity t o a goal position and velocity while avoiding obstacles by a safety margin and respecting constraints onā¦ (More)