184 search results - page 36 / 37 » Horn-Representation of a Concept Lattice |
CORR
2007
Springer
13 years 6 months ago
2007
Springer
Abstract. We proposed a new search heuristic using the scuba diving metaphor. This approach is based on the concept of evolvability and tends to exploit neutrality which exists in ...
TACAS
2010
Springer
14 years 1 months ago
2010
Springer
Abstract. Synthesis is the automated construction of a system from its specification. The system has to satisfy its specification in all possible environments. Modern systems oft...
FOCS
2009
IEEE
14 years 1 months ago
2009
IEEE
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
KDD
2008
ACM
14 years 6 months ago
2008
ACM
Closed patterns are powerful representatives of frequent patterns, since they eliminate redundant information. We propose a new approach for mining closed unlabeled rooted trees a...
KDD
2007
ACM
14 years 15 days ago
2007
ACM
The support-confidence framework is the most common measure used in itemset mining algorithms, for its antimonotonicity that effectively simplifies the search lattice. This com...