Sciweavers

192 search results - page 23 / 39
» Personalizing queries based on networks of composite prefere...
Sort
View
PODS
2008
ACM
165views Database» more  PODS 2008»
14 years 7 months ago
Data exchange and schema mappings in open and closed worlds
In the study of data exchange one usually assumes an openworld semantics, making it possible to extend instances of target schemas. An alternative closed-world semantics only move...
Leonid Libkin, Cristina Sirangelo
SIGMOD
2010
ACM
202views Database» more  SIGMOD 2010»
14 years 14 days ago
PAROS: pareto optimal route selection
Modern maps provide a variety of information about roads and their surrounding landscape allowing navigation systems to go beyond simple shortest path computation. In this demo, w...
Franz Graf, Hans-Peter Kriegel, Matthias Renz, Mat...
SIGMOD
2011
ACM
241views Database» more  SIGMOD 2011»
12 years 10 months ago
Neighborhood based fast graph search in large networks
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
Arijit Khan, Nan Li, Xifeng Yan, Ziyu Guan, Supriy...
AAAI
2006
13 years 9 months ago
Extracting Knowledge about Users' Activities from Raw Workstation Contents
A long-standing goal of AI is the development of intelligent workstation-based personal agents to assist users in their daily lives. A key impediment to this goal is the unrealist...
Tom M. Mitchell, Sophie H. Wang, Yifen Huang, Adam...
EDBT
2011
ACM
209views Database» more  EDBT 2011»
12 years 11 months ago
An optimal strategy for monitoring top-k queries in streaming windows
Continuous top-k queries, which report a certain number (k) of top preferred objects from data streams, are important for a broad class of real-time applications, ranging from fi...
Di Yang, Avani Shastri, Elke A. Rundensteiner, Mat...