Sciweavers

2314 search results - page 227 / 463
» Monoids over domains
Sort
View
IS
2006
15 years 6 months ago
A composite approach to automating direct and indirect schema mappings
Automating schema mapping is challenging. Previous approaches to automating schema mapping focus mainly on computing direct matches between two schemas. Schemas, however, rarely m...
Li Xu, David W. Embley
133
Voted
CSDA
2007
94views more  CSDA 2007»
15 years 6 months ago
Some extensions of score matching
Many probabilistic models are only defined up to a normalization constant. This makes maximum likelihood estimation of the model parameters very difficult. Typically, one then h...
Aapo Hyvärinen
KAIS
2008
99views more  KAIS 2008»
15 years 6 months ago
Privacy-preserving SVM classification
Classical data mining algorithms implicitly assume complete access to all data, either in centralized or federated form. However, privacy and security concerns often prevent sharin...
Jaideep Vaidya, Hwanjo Yu, Xiaoqian Jiang
180
Voted
PERCOM
2008
ACM
15 years 6 months ago
Peer-to-Peer Context Reasoning in Pervasive Computing Environments
In this paper, we propose a peer-to-peer approach to derive and obtain additional context data from lowlevel context data that may be spread over multiple domains in pervasive com...
Tao Gu, Hung Keng Pung, Daqing Zhang
IANDC
2007
132views more  IANDC 2007»
15 years 6 months ago
An automata-theoretic approach to constraint LTL
We consider an extension of linear-time temporal logic (LTL) with constraints interpreted over a concrete domain. We use a new automata-theoretic technique to show pspace decidabi...
Stéphane Demri, Deepak D'Souza