3146 search results - page 438 / 630 » Efficient Consequence Finding |
97
Voted
PODS
2005
ACM
16 years 3 months ago
2005
ACM
We present a divide-and-merge methodology for clustering a set of objects that combines a top-down "divide" phase with a bottom-up "merge" phase. In contrast, ...
128
Voted
PODS
2008
ACM
16 years 3 months ago
2008
ACM
In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practic...
147
Voted
EDBT
2004
ACM
16 years 3 months ago
2004
ACM
We study the problem of answering queries over sources with limited access patterns. The problem is to decide whether a given query Q is feasible, i.e., equivalent to an executable...
128
Voted
ICFP
2002
ACM
16 years 3 months ago
2002
ACM
This paper presents a monadic approach to incremental computation, suitable for purely functional languages such as Haskell. A program that uses incremental computation is able to...
128
Voted
ICDE
2010
IEEE
16 years 3 months ago
2010
IEEE
Sender anonymity in location-based services (LBS) attempts to hide the identity of a mobile device user who sends requests to the LBS provider for services in her proximity (e.g. &...