In an uncertain data set S = (S, p, f) where S is the ground set consisting of n elements, p : S → [0, 1] a probability function, and f : S → R a score function, each element i...
Abstract. Ontology matching consists of finding correspondences between ontology entities. OAEI campaigns aim at comparing ontology matching systems on precisely defined test set...
Software applications typically have many features that vary in their similarity. We define a measurement of similarity between pairs of features based on their underlying implem...
Jay Kothari, Trip Denton, Spiros Mancoridis, Ali S...
Our proposed methods employ learning and search techniques to estimate outcome features of interest as a function of mechanism parameter settings. We illustrate our approach with ...
Yevgeniy Vorobeychik, Christopher Kiekintveld, Mic...
In this paper, we propose a novel technique for modelbased recognition of complex object motion trajectories using Hidden Markov Models (HMM). We build our models on Principal Com...
Faisal I. Bashir, Wei Qu, Ashfaq A. Khokhar, Dan S...