Sciweavers

152 search results - page 7 / 31
» Similarity Matrices for Pairs of Graphs
Sort
View
EOR
2006
110views more  EOR 2006»
13 years 7 months ago
A constructive algorithm for realizing a distance matrix
The natural metric of a weighted graph is the length of the shortest paths between all pairs of vertices. The investigated problem consists in a representation of a given metric b...
Sacha C. Varone
GECCO
2006
Springer
154views Optimization» more  GECCO 2006»
13 years 11 months ago
Spectral techniques for graph bisection in genetic algorithms
Various applications of spectral techniques for enhancing graph bisection in genetic algorithms are investigated. Several enhancements to a genetic algorithm for graph bisection a...
Jacob G. Martin
DSS
2006
116views more  DSS 2006»
13 years 7 months ago
Matching knowledge elements in concept maps using a similarity flooding algorithm
Concept mapping systems used in education and knowledge management emphasize flexibility of representation to enhance learning and facilitate knowledge capture. Collections of con...
Byron Marshall, Hsinchun Chen, Therani Madhusudan
ICML
2004
IEEE
14 years 8 months ago
Online and batch learning of pseudo-metrics
We describe and analyze an online algorithm for supervised learning of pseudo-metrics. The algorithm receives pairs of instances and predicts their similarity according to a pseud...
Shai Shalev-Shwartz, Yoram Singer, Andrew Y. Ng
EMMCVPR
2005
Springer
14 years 1 months ago
Probabilistic Subgraph Matching Based on Convex Relaxation
We present a novel approach to the matching of subgraphs for object recognition in computer vision. Feature similarities between object model and scene graph are complemented with ...
Christian Schellewald, Christoph Schnörr