136 search results - page 15 / 28 » A Spectral Technique for Correspondence Problems Using Pairw... |
PR
2006
13 years 8 months ago
2006
Many computer vision and pattern recognition algorithms are very sensitive to the choice of an appropriate distance metric. Some recent research sought to address a variant of the...
ICRA
2009
IEEE
14 years 3 months ago
2009
IEEE
Abstract— We present the Constrained Bi-directional RapidlyExploring Random Tree (CBiRRT) algorithm for planning paths in configuration spaces with multiple constraints. This al...
PKDD
2009
Springer
14 years 3 months ago
2009
Springer
We consider causally sufficient acyclic causal models in which the relationship among the variables is nonlinear while disturbances have linear effects, and show that three princi...
NIPS
2004
13 years 10 months ago
2004
We propose a new method for clustering based on finding maximum margin hyperplanes through data. By reformulating the problem in terms of the implied equivalence relation matrix, ...
AAAI
2004
13 years 10 months ago
2004
We present an efficient approach to adding soft constraints, in the form of preferences, to Disjunctive Temporal Problems (DTPs) and their subclass Temporal Constraint Satisfactio...