2526 search results - page 16 / 506 » A New Algorithm for Answer Set Computation |
SIGMOD
2007
ACM
14 years 9 months ago
2007
ACM
An emerging challenge in modern distributed querying is to efficiently process multiple continuous aggregation queries simultaneously. Processing each query independently may be i...
PODS
2003
ACM
14 years 9 months ago
2003
ACM
In this paper we study the following problem. Given a database and a set of queries, we want to find, in advance, a set of views that can compute the answers to the queries, such ...
RAM
2008
IEEE
14 years 3 months ago
2008
IEEE
This paper presents an algorithm for computing the distance between a point and a convex cone in n-dimensional space. The convex cone is specified by the set of all nonnegative com...
ECSQARU
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. The problem of merging multiple sources information is central in several domains of computer science. In knowledge representation for artificial intelligence, several a...
STOC
2007
ACM
14 years 9 months ago
2007
ACM
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...