1871 search results - page 11 / 375 » The Ephemeral Pairing Problem |
ICIP
2007
IEEE
14 years 9 months ago
2007
IEEE
In this work, we solve the pose estimation problem for robot motion by placing multiple cameras on the robot. In particular, we use four cameras arranged as two back-to-back stere...
CADE
2007
Springer
14 years 7 months ago
2007
Springer
This paper combines predictive labeling with dependency pairs and reports on its implementation. Our starting point is the method of proving termination of rewrite systems using se...
ISAAC
2004
Springer
14 years 23 days ago
2004
Springer
In the Paired Pointset Traversal problem we ask whether, given two sets A = {a1, . . . , an} and B = {b1, . . . , bn} in the plane, there is an ordering π of the points such that ...
STOC
2003
ACM
14 years 7 months ago
2003
ACM
We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynam...
DATE
2006
IEEE
14 years 1 months ago
2006
IEEE
Recently, the interest about the Tate pairing over binary fields has decreased due to the existence of efficient attacks to the discrete logarithm problem in the subgroups of su...