Sciweavers

582 search results - page 48 / 117
» Distance Measures for Well-Distributed Sets
Sort
View
CIA
1999
Springer
14 years 29 days ago
A Similarity Evaluation Technique for Cooperative Problem Solving with a Group of Agents
Abstract. Evaluations of distances or similarity measurements are very important in cooperative problem solving with multiple agents. Distance between problems is used by agents to...
Seppo Puuronen, Vagan Y. Terziyan
IROS
2007
IEEE
140views Robotics» more  IROS 2007»
14 years 2 months ago
Test-environment based on a team of miniature walking robots for evaluation of collaborative control methods
— For the collaborative control of a team of robots, a set of well-suited high-level control algorithms, especially for path planning and measurement scheduling, is essential. Th...
Florian Weissel, Marco F. Huber, Uwe D. Hanebeck
CVPR
2006
IEEE
14 years 2 months ago
Learning Non-Metric Partial Similarity Based on Maximal Margin Criterion
The performance of many computer vision and machine learning algorithms critically depends on the quality of the similarity measure defined over the feature space. Previous works...
Xiaoyang Tan, Songcan Chen, Jun Li, Zhi-Hua Zhou
SSPR
1998
Springer
14 years 26 days ago
Object Recognition from Large Structural Libraries
This paper presents a probabilistic similarity measure for object recognition from large libraries of line-patterns. We commence from a structural pattern representation which use...
Benoit Huet, Edwin R. Hancock
CVPR
2003
IEEE
14 years 10 months ago
Many-to-Many Graph Matching via Metric Embedding
Graph matching is an important component in many object recognition algorithms. Although most graph matching algorithms seek a one-to-one correspondence between nodes, it is often...
Yakov Keselman, Ali Shokoufandeh, M. Fatih Demirci...