Sciweavers

32 search results - page 1 / 7
» Evaluating Matching Algorithms: the Monotonicity Principle
Sort
View
IJCAI
2003
13 years 6 months ago
Evaluating Matching Algorithms: the Monotonicity Principle
In this paper we present the monotonicity principle, a sufficient condition to ensure that exact mapping, a mapping as would be performed by a human observer, is ranked close to ...
Ateret Anaby-Tavor, Avigdor Gal, Alberto Trombetta
CIKM
2005
Springer
13 years 10 months ago
Incremental evaluation of a monotone XPath fragment
This paper shows a scheme for incremental evaluation of XPath queries. Here, we focus on a monotone fragment of XPath, i.e., when a data is deleted from (or inserted to) the datab...
Hidetaka Matsumura, Keishi Tajima
APPROX
2010
Springer
168views Algorithms» more  APPROX 2010»
13 years 6 months ago
Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners
Abstract. Given a directed graph G = (V, E) and an integer k 1, a ktransitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V, EH ) that has (1) the same transitive...
Arnab Bhattacharyya, Elena Grigorescu, Madhav Jha,...
ICPR
2010
IEEE
13 years 10 months ago
Constrained Energy Minimization for Matching-Based Image Recognition
We propose to use energy minimization in MRFs for matching-based image recognition tasks. To this end, the Tree-Reweighted Message Passing algorithm is modified by geometric cons...
Tobias Gass, Philippe Dreuw, Hermann Ney
PVLDB
2008
134views more  PVLDB 2008»
13 years 4 months ago
Reasoning and identifying relevant matches for XML keyword search
Keyword search is a user-friendly mechanism for retrieving XML data in web and scientific applications. An intuitively compelling but vaguely defined goal is to identify matches t...
Ziyang Liu, Yi Chen