Sciweavers

2695 search results - page 99 / 539
» Learning Graph Matching
Sort
View
ISAAC
1998
Springer
66views Algorithms» more  ISAAC 1998»
15 years 6 months ago
A Parallel Algorithm for Sampling Matchings from an Almost Uniform Distribution
In this paper we present a randomized parallel algorithm to sample matchings from an almost uniform distribution on the set of matchings of all sizes in a graph. First we prove th...
Josep Díaz, Jordi Petit, Panagiotis Psychar...
ICMCS
2007
IEEE
180views Multimedia» more  ICMCS 2007»
15 years 8 months ago
Discrete Regularization for Perceptual Image Segmentation via Semi-Supervised Learning and Optimal Control
In this paper, we present a regularization approach on discrete graph spaces for perceptual image segmentation via semisupervised learning. In this approach, first, a spectral cl...
Hongwei Zheng, Olaf Hellwich
KCAP
2003
ACM
15 years 7 months ago
Using transformations to improve semantic matching
Many AI tasks require determining whether two knowledge representations encode the same knowledge. Solving this matching problem is hard because representations may encode the sam...
Peter Z. Yeh, Bruce W. Porter, Ken Barker
FASE
2010
Springer
15 years 5 months ago
Incremental Service Composition Based on Partial Matching of Visual Contracts
Services provide access to software components that can be discovered dynamically via the Internet. The increasing number of services a requesters may be able to use demand support...
Muhammad Naeem, Reiko Heckel, Fernando Orejas, Fra...
106
Voted
ICRA
2009
IEEE
148views Robotics» more  ICRA 2009»
15 years 9 months ago
Graph-based robust shape matching for robotic application
— Shape is one of the useful information for object detection. The human visual system can often recognize objects based on the 2-D outline shape alone. In this paper, we address...
Hanbyul Joo, Yekeun Jeong, Olivier Duchenne, Seong...