Sciweavers

5387 search results - page 474 / 1078
» Generating generic functions
Sort
View
IBIS
2006
109views more  IBIS 2006»
15 years 7 months ago
Formulation Schema Matching Problem for Combinatorial Optimization Problem
: 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...
CORR
2007
Springer
134views Education» more  CORR 2007»
15 years 6 months ago
An Analytical Study of a Structured Overlay in the presence of Dynamic Membership
— 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...
JMLR
2008
148views more  JMLR 2008»
15 years 6 months ago
Linear-Time Computation of Similarity Measures for Sequential Data
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...
Konrad Rieck, Pavel Laskov
JMLR
2006
92views more  JMLR 2006»
15 years 6 months ago
Linear Programs for Hypotheses Selection in Probabilistic Inference Models
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...
Anders Bergkvist, Peter Damaschke, Marcel Lüt...
MCSS
2007
Springer
15 years 6 months ago
Minimal symmetric Darlington synthesis
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...