Sciweavers

321 search results - page 9 / 65
» Enabling local computation for partially ordered preferences
Sort
View
IDEAS
2003
IEEE
122views Database» more  IDEAS 2003»
14 years 23 days ago
Preferred Repairs for Inconsistent Databases
The objective of this paper is to investigate the problems related to the extensional integration of information sources. In particular, we propose an approach for managing incons...
Sergio Greco, Cristina Sirangelo, Irina Trubitsyna...
AI
2008
Springer
13 years 7 months ago
Label ranking by learning pairwise preferences
Preference learning is a challenging problem that involves the prediction of complex structures, such as weak or partial order relations, rather than single values. In the recent ...
Eyke Hüllermeier, Johannes Fürnkranz, We...
CSL
2006
Springer
13 years 11 months ago
Separation Logic for Higher-Order Store
Separation Logic is a sub-structural logic that supports local reasoning for imperative programs. It is designed to elegantly describe sharing and aliasing properties of heap struc...
Bernhard Reus, Jan Schwinghammer
BMCBI
2010
92views more  BMCBI 2010»
13 years 7 months ago
HORI: a web server to compute Higher Order Residue Interactions in protein structures
Background: Folding of a protein into its three dimensional structure is influenced by both local and global interactions within a protein. Higher order residue interactions, like...
Pandurangan Sundaramurthy, Khader Shameer, Raashi ...
SAC
2009
ACM
14 years 2 months ago
Building an efficient preference XML query processor
Today user-centered information acquisition over collections of complex XML documents is increasingly in demand. To this end, preferences have become an important paradigm enablin...
SungRan Cho, Wolf-Tilo Balke