Sciweavers

103 search results - page 4 / 21
» Adaptive Matching Based Kernels for Labelled Graphs
Sort
View
CVPR
2010
IEEE
14 years 3 months ago
Visual Event Recognition in Videos by Learning from Web Data
We propose a visual event recognition framework for consumer domain videos by leveraging a large amount of loosely labeled web videos (e.g., from YouTube). First, we propose a new...
Lixin Duan, Dong Xu, Wai-Hung Tsang, Jiebo Luo
PAMI
2007
176views more  PAMI 2007»
13 years 7 months ago
Approximate Labeling via Graph Cuts Based on Linear Programming
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
Nikos Komodakis, Georgios Tziritas
GRAPHICSINTERFACE
2009
13 years 5 months ago
Structural differences between two graphs through hierarchies
This paper presents a technique for visualizing the differences between two graphs. The technique assumes that a unique labeling of the nodes for each graph is available, where if...
Daniel Archambault
BMCBI
2008
228views more  BMCBI 2008»
13 years 7 months ago
Adaptive diffusion kernel learning from biological networks for protein function prediction
Background: Machine-learning tools have gained considerable attention during the last few years for analyzing biological networks for protein function prediction. Kernel methods a...
Liang Sun, Shuiwang Ji, Jieping Ye
DEXA
2006
Springer
138views Database» more  DEXA 2006»
13 years 11 months ago
A Vector Space Model for Semantic Similarity Calculation and OWL Ontology Alignment
Ontology alignment (or matching) is the operation that takes two ontologies and produces a set of semantic correspondences (usually semantic similarities) between some elements of ...
Rubén Tous, Jaime Delgado