Predicting Cause-Effect Relationships from Incomplete Discrete Observations
SIAM Journal on Discrete Mathematics
Complexity of identification and dualization of positive Boolean functions
Information and Computation
Mining quantitative association rules in large relational tables
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Interior and exterior functions of Boolean functions
Discrete Applied Mathematics
On the complexity of dualization of monotone disjunctive normal forms
Journal of Algorithms
Fast discovery of association rules
Advances in knowledge discovery and data mining
Data mining, hypergraph transversals, and machine learning (extended abstract)
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions
Discrete Applied Mathematics - Special issue on the satisfiability problem and Boolean functions
Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph
SIAM Journal on Computing
Mining for Empty Rectangles in Large Data Sets
ICDT '01 Proceedings of the 8th International Conference on Database Theory
Mining Generalized Association Rules
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
On Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
On Dualization in Products of Forests
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
An inequality for polymatroid functions and its applications
An inequality for polymatroid functions and its applications
Computational aspects of monotone dualization: A brief survey
Discrete Applied Mathematics
Finding all minimal infrequent multi-dimensional intervals
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
| Hi-index | 0.00 |
Let L = L1 脳 ... 脳 Ln be the product of n lattices, each of which has a bounded width. Given a subset A 驴 L, we show that the problem of extending a given partial list of maximal independent elements of A in L can be solved in quasi-polynomial time. This result implies, in particular, that the problem of generating all minimal infrequent elements for a database with semi-lattice attributes, and the problem of generating all maximal boxes that contain at most a specified number of points from a given n-dimensional point set, can both be solved in incremental quasi-polynomial time.