Sciweavers

103 search results - page 6 / 21
» Adaptive Matching Based Kernels for Labelled Graphs
Sort
View
FLAIRS
2006
13 years 8 months ago
Inexact Graph Matching: A Case of Study
Inexact graph matching has become an important research area because it is used to find similarities among objects in several real domains such as chemical and biological compound...
Ivan Olmos, Jesus A. Gonzalez, Mauricio Osorio
ICPR
2008
IEEE
14 years 1 months ago
Semi-supervised learning by locally linear embedding in kernel space
Graph based semi-supervised learning methods (SSL) implicitly assume that the intrinsic geometry of the data points can be fully specified by an Euclidean distance based local ne...
Rujie Liu, Yuehong Wang, Takayuki Baba, Daiki Masu...
IBIS
2006
109views more  IBIS 2006»
13 years 7 months ago
Formulation Schema Matching Problem for Combinatorial Optimization Problem
: Schema matching is the task of finding semantic correspondences between elements of two schemas, which plays a key role in many database applications. In this paper, we cast the ...
Zhi Zhang, Pengfei Shi, Haoyang Che, Yong Sun, Jun...
CVPR
2009
IEEE
14 years 2 months ago
Trajectory parsing by cluster sampling in spatio-temporal graph
The objective of this paper is to parse object trajectories in surveillance video against occlusion, interruption, and background clutter. We present a spatio-temporal graph (ST-G...
Xiaobai Liu, Liang Lin, Song Chun Zhu, Hai Jin
ECCV
2006
Springer
14 years 9 months ago
Tracking and Labelling of Interacting Multiple Targets
Abstract. Successful multi-target tracking requires solving two problems - localize the targets and label their identity. An isolated target's identity can be unambiguously pr...
Josephine Sullivan, Stefan Carlsson