68 search results - page 2 / 14 » Obtaining Quick Results for Approximate Answers |
LPNMR
2009
Springer
14 years 7 days ago
2009
Springer
We consider random logic programs with two-literal rules and study their properties. In particular, we obtain results on the probability that random “sparse” and “dense” pr...
ICDT
1995
ACM
13 years 9 months ago
1995
ACM
Partial information in databases can arise when information from several databases is combined. Even if each database is complete for some \world", the combined databases wil...
SIGMOD
1999
ACM
13 years 10 months ago
1999
ACM
Computing multidimensional aggregates in high dimensions is a performance bottleneck for many OLAP applications. Obtaining the exact answer to an aggregation query can be prohibit...
NIPS
2008
13 years 7 months ago
2008
Many interesting problems, including Bayesian network structure-search, can be cast in terms of finding the optimum value of a function over the space of graphs. However, this fun...
ASC
2006
13 years 7 months ago
2006
In [7] Maria I. Sessa extended the SLD resolution principle with the ability of performing approximate reasoning and flexible query answering. The operational mechanism of similar...