34 search results - page 3 / 7 » New Bounds for Motif Finding in Strong Instances |
SAC
2004
ACM
13 years 11 months ago
2004
ACM
In the paper a new data mining algorithm for finding the most interesting dependence rules is described. Dependence rules are derived from the itemsets with support significantly ...
ECCC
2007
13 years 6 months ago
2007
The OR-SAT problem asks, given Boolean formulae φ1, . . . , φm each of size at most n, whether at least one of the φi’s is satisfiable. We show that there is no reduction fr...
SDM
2011
SIAM
12 years 9 months ago
2011
SIAM
Identifying the extremal (minimal and maximal) sets from a collection of sets is an important subproblem in the areas of data-mining and satisfiability checking. For example, ext...
JAIR
2000
13 years 6 months ago
2000
The local search algorithm WSat is one of the most successful algorithms for solving the satisfiability (SAT) problem. It is notably effective at solving hard Random 3-SAT instanc...
BMCBI
2005
13 years 6 months ago
2005
Background: All eukaryotic organisms need to distinguish each of their chromosomes. A few protein complexes have been described that recognise entire, specific chromosomes, for in...