301 search results - page 43 / 61 » Efficient Sketches for the Set Query Problem |
222
Voted
SIGMOD
2009
ACM
16 years 3 months ago
2009
ACM
This paper addresses the problem of monitoring the k nearest neighbors to a dynamically changing path in road networks. Given a destination where a user is going to, this new quer...
145
Voted
SIGMOD
2010
ACM
14 years 10 months ago
2010
ACM
We propose and study a new ranking problem in versioned databases. Consider a database of versioned objects which have different valid instances along a history (e.g., documents i...
113
Voted
BDA
2006
15 years 5 months ago
2006
We consider a publish/subscribe system for digital libraries which continuously evaluates queries over a large repository containing document descriptions. The subscriptions, the ...
111
Voted
UAI
2004
15 years 5 months ago
2004
Within the task of collaborative filtering two challenges for computing conditional probabilities exist. First, the amount of training data available is typically sparse with resp...
92
Voted
JAIR
2008
15 years 3 months ago
2008
Levesque proposed a generalization of a database called a proper knowledge base (KB), which is equivalent to a possibly infinite consistent set of ground literals. In contrast to ...