Sciweavers

398 search results - page 25 / 80
» Ant Algorithm for the Graph Matching Problem
Sort
View
CORR
2010
Springer
141views Education» more  CORR 2010»
13 years 6 months ago
Popularity at Minimum Cost
We consider an extension of the popular matching problem in this paper. The input to the popular matching problem is a bipartite graph G = (A ∪ B, E), where A is a set of people,...
Telikepalli Kavitha, Meghana Nasre, Prajakta Nimbh...
PAMI
2006
156views more  PAMI 2006»
13 years 7 months ago
Robust Point Matching for Nonrigid Shapes by Preserving Local Neighborhood Structures
In previous work on point matching, a set of points is often treated as an instance of a joint distribution to exploit global relationships in the point set. For nonrigid shapes, h...
Yefeng Zheng, David S. Doermann
PR
2007
134views more  PR 2007»
13 years 7 months ago
An elastic partial shape matching technique
We consider the problem of partial shape matching. We propose to transform shapes into sequences and utilize an algorithm that determines a subsequence of a target sequence that b...
Longin Jan Latecki, Vasileios Megalooikonomou, Qia...
GLOBECOM
2010
IEEE
13 years 5 months ago
Graph-Based Optimization for Relay-Assisted Bidirectional Cellular Networks
This paper considers a relay-assisted bidirectional cellular network where the base station (BS) communicates with each mobile station (MS) using orthogonal frequency-division mult...
Yuan Liu, Meixia Tao
ACIVS
2009
Springer
14 years 2 months ago
Attributed Graph Matching Using Local Descriptions
Abstract. In the pattern recognition context, objects can be represented as graphs with attributed nodes and edges involving their relations. Consequently, matching attributed grap...
Salim Jouili, Ines Mili, Salvatore Tabbone