13 search results - page 2 / 3 » BLOSOM: a framework for mining arbitrary boolean expressions |
CORR
2006
Springer
13 years 5 months ago
2006
Springer
Boolean satisfiability problems are an important benchmark for questions about complexity, algorithms, heuristics and threshold phenomena. Recent work on heuristics, and the satis...
QEST
2006
IEEE
13 years 11 months ago
2006
IEEE
Abstract. We present a compositional theory of system verification, where specifications assign real-numbered costs to systems. These costs can express a wide variety of quantita...
KDD
2004
ACM
14 years 5 months ago
2004
ACM
The goal of this paper is to show that generalizing the notion of support can be useful in extending association analysis to non-traditional types of patterns and non-binary data....
SIGECOM
2003
ACM
13 years 10 months ago
2003
ACM
We develop a framework for trading in compound securities: financial instruments that pay off contingent on the outcomes of arbitrary statements in propositional logic. Buying o...
INCDM
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. Character design is a key ingredient to the success of any comicbook, graphic novel, or animated feature. Artists typically use shape, size and proportion as the first de...