284 search results - page 48 / 57 » On Some Polyhedra Covering Problems |
SIGMOD
2006
ACM
14 years 9 months ago
2006
ACM
Testing of database applications is crucial for ensuring high software quality as undetected faults can result in unrecoverable data corruption. The problem of database applicatio...
KDD
2004
ACM
14 years 9 months ago
2004
ACM
Frequent itemset mining has been the subject of a lot of work in data mining research ever since association rules were introduced. In this paper we address a problem with frequen...
ICCAD
2001
IEEE
14 years 5 months ago
2001
IEEE
We present a two-level Boolean minimization tool (BOOM) based on a new implicant generation paradigm. In contrast to all previous minimization methods, where the implicants are ge...
WISE
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. Answering a query over a group of RDF data pages is a trivial process. However, in the Semantic Web, there is a need for ontology technology. Consequently, OWL, a family ...
COMPGEOM
1994
ACM
14 years 1 months ago
1994
ACM
Let F be a collection of n d-variate, possibly partially defined, functions, all algebraic of some constant maximum degree. We present a randomized algorithm that computes the vert...