We show that a conjunctive normal form (CNF) formula F is unsatisfiable iff there is a set of points of the Boolean space that is stable with respect to F. So testing the satisfiab...
We consider the problem of efficiently sampling Web search engine query results. In turn, using a small random sample instead of the full set of results leads to efficient approxi...
Aris Anagnostopoulos, Andrei Z. Broder, David Carm...
Of special interest in formal verification are safety properties, which assert that the system always stays within some allowed region. A computation that violates a general linea...
The designs that have been stored in early days are often used as a reference when textile designs are created. To effectively use these resources, a wellequipped design database ...
Many Web sites support keyword search on their spatial data, such as business listings and photos. In these systems, inconsistencies and errors can exist in both queries and the d...