Sciweavers

2031 search results - page 29 / 407
» On Tree-Constrained Matchings and Generalizations
Sort
View

Publication
433views
15 years 6 months ago
Optimal Feature Selection for Subspace Image Matching
Image matching has been a central research topic in computer vision over the last decades. Typical approaches for correspondence involve matching features between images. In this p...
Gemma Roig, Xavier Boix, Fernando De la Torre
91
Voted
CIKM
2006
Springer
15 years 1 months ago
Matching directories and OWL ontologies with AROMA
This paper presents a simple and adaptable matching method dealing with web directories, catalogs and OWL ontologies. By using a well-known Knowledge Discovery in Databases model,...
Jérôme David, Fabrice Guillet, Henri ...
AAAI
2010
14 years 11 months ago
Fast Algorithms for Top-k Approximate String Matching
Top-k approximate querying on string collections is an important data analysis tool for many applications, and it has been exhaustively studied. However, the scale of the problem ...
Zhenglu Yang, Jianjun Yu, Masaru Kitsuregawa
CORR
2006
Springer
68views Education» more  CORR 2006»
14 years 9 months ago
A rigorous proof of the cavity method for counting matchings
In this paper we rigorously prove the validity of the cavity method for the problem of counting the number of matchings in graphs with large girth. Cavity method is an important he...
Mohsen Bayati, Chandra Nair
ML
2002
ACM
146views Machine Learning» more  ML 2002»
14 years 9 months ago
Kernel Matching Pursuit
Matching Pursuit algorithms learn a function that is a weighted sum of basis functions, by sequentially appending functions to an initially empty basis, to approximate a target fu...
Pascal Vincent, Yoshua Bengio