49 search results - page 1 / 10 » Succinct Minimal Generators: Theoretical Foundations and App... |
IJFCS
2008
13 years 4 months ago
2008
In data mining applications, highly sized contexts are handled what usually results in a considerably large set of frequent itemsets, even for high values of the minimum support t...
IJCINI
2007
13 years 4 months ago
2007
Autonomic computing (AC) is an intelligent computing approach that autonomously carries out robotic and interactive applications based on goal- and inference-driven mechanisms. Th...
ICEIS
2003
IEEE
13 years 10 months ago
2003
IEEE
d graphically, interest in code generators which create applications based on abstract system descriptions, is high. An indicator for this are the many commercial products. This pa...
SAT
2005
Springer
13 years 10 months ago
2005
Springer
We tackle the problem of finding a smallest-cardinality MUS (SMUS) of a given formula. The SMUS provides a succinct explanation of infeasibility and is valuable for applications th...
ACMSE
2006
ACM
13 years 10 months ago
2006
ACM
Classic results in the theory of regular languages show that the problem of converting an NFA (nondeterministic finite automaton) into a minimal equivalent NFA is NP-hard, even f...