Sciweavers

4128 search results - page 118 / 826
» Learning and using relational theories
Sort
View
HASKELL
2009
ACM
15 years 4 months ago
A compositional theory for STM Haskell
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
Johannes Borgström, Karthikeyan Bhargavan, An...
PKDD
2010
Springer
183views Data Mining» more  PKDD 2010»
14 years 8 months ago
Fast Active Exploration for Link-Based Preference Learning Using Gaussian Processes
Abstract. In preference learning, the algorithm observes pairwise relative judgments (preference) between items as training data for learning an ordering of all items. This is an i...
Zhao Xu, Kristian Kersting, Thorsten Joachims
BXML
2004
14 years 11 months ago
Subject Identification in Topic Maps in Theory and Practice
: If Topic Maps should be exchanged in distributed environments a common semantic problem occurs: Do two Topics refer to the same Subject? If they describe the same Subject the giv...
Lutz Maicher
ICDE
2008
IEEE
182views Database» more  ICDE 2008»
15 years 4 months ago
Two-phase schema matching in real world relational databases
— We propose a new approach to the problem of schema matching in relational databases that merges the hybrid and composite approach of combining multiple individual matching tech...
Nikolaos Bozovic, Vasilis Vassalos
KDD
2003
ACM
217views Data Mining» more  KDD 2003»
15 years 10 months ago
Algorithms for estimating relative importance in networks
Large and complex graphs representing relationships among sets of entities are an increasingly common focus of interest in data analysis--examples include social networks, Web gra...
Scott White, Padhraic Smyth