136 search results - page 25 / 28 » Boolean Formulas and Frequent Sets |
SIGIR
2012
ACM
12 years 1 months ago
2012
ACM
People are seldom aware that their search queries frequently mismatch a majority of the relevant documents. This may not be a big problem for topics with a large and diverse set o...
AIPS
1998
14 years 7 days ago
1998
Planning methods for deterministic planning problems traditionally exploit factored representations to encode the dynamics of problems in terms of a set of parameters, e.g., the l...
JCSS
2000
13 years 10 months ago
2000
It is a well-known result of Fagin that the complexity class NP coincides with the class of problems expressible in existential second-order logic ( 1 1), which allows sentences c...
SIGMOD
2005
ACM
14 years 4 months ago
2005
ACM
Decision makers of companies often face the dilemma of whether to release data for knowledge discovery, vis a vis the risk of disclosing proprietary or sensitive information. Whil...
ALT
2000
Springer
14 years 3 months ago
2000
Springer
A conjunctive query problem in relational database theory is a problem to determine whether or not a tuple belongs to the answer of a conjunctive query over a database. Here, a tup...