Sciweavers

2322 search results - page 323 / 465
» On a game in directed graphs
Sort
View
ACCV
2009
Springer
16 years 1 months ago
A Probabilistic Model for Correspondence Problems Using Random Walks with Restart
Abstract. In this paper, we propose an efficient method for finding consistent correspondences between two sets of features. Our matching algorithm augments the discriminative pow...
Tae Hoon Kim, Kyoung Mu Lee, Sang Uk Lee
WADS
2009
Springer
243views Algorithms» more  WADS 2009»
16 years 1 months ago
Resolving Loads with Positive Interior Stresses
We consider the pair (pi, fi) as a force with two-dimensional direction vector fi applied at the point pi in the plane. For a given set of forces we ask for a non-crossing geometri...
Günter Rote, André Schulz
IROS
2007
IEEE
206views Robotics» more  IROS 2007»
16 years 21 days ago
Dexterous manipulation planning using probabilistic roadmaps in continuous grasp subspaces
— In this paper, we propose a new method for the motion planning problem of rigid object dexterous manipulation with a robotic multi-fingered hand, under quasi-static movement a...
Jean-Philippe Saut, Anis Sahbani, Sahar El-Khoury,...
COCOA
2007
Springer
16 years 17 days ago
On Threshold BDDs and the Optimal Variable Ordering Problem
Abstract. Many combinatorial optimization problems can be formulated as 0/1 integer programs (0/1 IPs). The investigation of the structure of these problems raises the following ta...
Markus Behle
PET
2007
Springer
16 years 15 days ago
Anonymity in the Wild: Mixes on Unstructured Networks
Abstract. As decentralized computing scenarios get ever more popular, unstructured topologies are natural candidates to consider running mix networks upon. We consider mix network ...
Shishir Nagaraja