530 search results - page 57 / 106 » An Algorithm for Approximating the Satisfiability Problem of... |
ICTIR
2009
Springer
15 years 9 months ago
2009
Springer
We review the history of modeling score distributions, focusing on the mixture of normal-exponential by investigating the theoretical as well as the empirical evidence supporting i...
146
click to vote
IR
2011
14 years 6 months ago
2011
We review the history of modeling score distributions, focusing on the mixture of normal-exponential by investigating the theoretical as well as the empirical evidence supporting i...
142
click to vote
IANDC
2008
15 years 3 months ago
2008
In the area of Description Logic (DL), both tableau-based and automata-based algorithms are frequently used to show decidability and complexity results for basic inference problem...
148
click to vote
ACM
1995
15 years 6 months ago
1995
We study properties of rough sets, that is, approximations to sets of records in a database or, more formally, to subsets of the universe of an information system. A rough set is a...
105
click to vote
ICDT
2010
ACM
15 years 7 months ago
2010
ACM
Given a database instance and a corresponding view instance, we address the view definitions problem (VDP): Find the most succinct and accurate view definition, when the view quer...