Sciweavers

492 search results - page 39 / 99
» Querying with Intrinsic Preferences
Sort
View

Publication
240views
12 years 8 months ago
Bayesian multitask inverse reinforcement learning
We generalise the problem of inverse reinforcement learning to multiple tasks, from multiple demonstrations. Each one may represent one expert trying to solve a different task, or ...
Christos Dimitrakakis, Constantin A. Rothkopf
PVLDB
2010
158views more  PVLDB 2010»
13 years 8 months ago
Building Ranked Mashups of Unstructured Sources with Uncertain Information
Mashups are situational applications that join multiple sources to better meet the information needs of Web users. Web sources can be huge databases behind query interfaces, which...
Mohamed A. Soliman, Ihab F. Ilyas, Mina Saleeb
SIGMOD
2011
ACM
234views Database» more  SIGMOD 2011»
13 years 21 days ago
Ranking with uncertain scoring functions: semantics and sensitivity measures
Ranking queries report the top-K results according to a user-defined scoring function. A widely used scoring function is the weighted summation of multiple scores. Often times, u...
Mohamed A. Soliman, Ihab F. Ilyas, Davide Martinen...
WEBI
2009
Springer
14 years 4 months ago
Deriving Customized Integrated Web Query Interfaces
— Given a set of query interfaces from providers in the same domain (e.g., car rental), the goal is to build automatically an integrated interface that makes the access to indivi...
Eduard Constantin Dragut, Fang Fang, Clement T. Yu...
IS
2007
13 years 9 months ago
Branch-and-bound processing of ranked queries
Despite the importance of ranked queries in numerous applications involving multi-criteria decision making, they are not efficiently supported by traditional database systems. In ...
Yufei Tao, Vagelis Hristidis, Dimitris Papadias, Y...