: Schema matching is the task of finding semantic correspondences between elements of two schemas, which plays a key role in many database applications. In this paper, we cast the ...
Zhi Zhang, Pengfei Shi, Haoyang Che, Yong Sun, Jun...
— In this paper, we present a complete analytical study of dynamic membership (aka churn) in structured peer-to-peer networks. We use a master-equation-based approach, which is u...
Supriya Krishnamurthy, Sameh El-Ansary, Erik Aurel...
Efficient and expressive comparison of sequences is an essential procedure for learning with sequential data. In this article we propose a generic framework for computation of sim...
We consider an optimization problem in probabilistic inference: Given n hypotheses Hj, m possible observations Ok, their conditional probabilities pk j, and a particular Ok, selec...
We consider the symmetric Darlington synthesis of a p × p rational symmetric Schur function S with the constraint that the extension is of size 2p×2p. Under the assumption that S...
Laurent Baratchart, P. Enqvist, A. Gombani, M. Oli...