1697 search results - page 96 / 340 » On Bayesian Case Matching |
97
Voted
EKAW
2006
Springer
15 years 4 months ago
2006
Springer
Existing ontology matching algorithms use a combination of lexical and structural correspondance between source and target ontologies. We present a realistic case-study where both ...
120
Voted
JFP
2006
15 years 22 days ago
2006
Pattern matching is an important operation in functional programs. So far, pattern matching has been investigated in the context of structured terms. This article presents an appr...
182
click to vote
GIS
2009
ACM
16 years 1 months ago
2009
ACM
A common problem in moving object databases (MOD) is the reconstruction of a trajectory from a trajectory sample (i.e., a finite sequence of time-space points). A typical solution...
160
Voted
SIGMOD
2006
ACM
16 years 28 days ago
2006
ACM
We define a match join of R and S with predicate to be a subset of the -join of R and S such that each tuple of R and S contributes to at most one result tuple. Match joins and t...
127
Voted
CVPR
2010
IEEE
15 years 8 months ago
2010
IEEE
In this paper, we propose a high-order graph matching formulation to address non-rigid surface matching. The singleton terms capture the geometric and appearance similarities (e.g...