Sciweavers

242 search results - page 43 / 49
» A SAT-Based Algorithm for Context Matching
Sort
View
ISCI
2007
170views more  ISCI 2007»
13 years 7 months ago
Automatic learning of cost functions for graph edit distance
Graph matching and graph edit distance have become important tools in structural pattern recognition. The graph edit distance concept allows us to measure the structural similarit...
Michel Neuhaus, Horst Bunke
PAMI
1998
170views more  PAMI 1998»
13 years 7 months ago
Ordinal Measures for Image Correspondence
—We present ordinal measures of association for image correspondence in the context of stereo. Linear correspondence measures like correlation and the sum of squared difference b...
Dinkar N. Bhat, Shree K. Nayar
ICRA
2010
IEEE
108views Robotics» more  ICRA 2010»
13 years 6 months ago
Robust place recognition for 3D range data based on point features
Abstract— The problem of place recognition appears in different mobile robot navigation problems including localization, SLAM, or change detection in dynamic environments. Wherea...
Bastian Steder, Giorgio Grisetti, Wolfram Burgard
CDC
2010
IEEE
133views Control Systems» more  CDC 2010»
13 years 2 months ago
Decentralized task assignment in camera networks
The problem of task assignment naturally arises in multiagent multitask systems, where an optimal matching of agents and tasks is sought. This problem is a combinatorial optimizati...
Angelo Cenedese, Federico Cerruti, Mirko Fabbro, C...
BMCBI
2005
158views more  BMCBI 2005»
13 years 7 months ago
Automated generation of heuristics for biological sequence comparison
Background: Exhaustive methods of sequence alignment are accurate but slow, whereas heuristic approaches run quickly, but their complexity makes them more difficult to implement. ...
Guy St. C. Slater, Ewan Birney