Sciweavers

Share
IJKDB
2010
141views more  IJKDB 2010»
9 years 9 months ago
Mining Frequent Boolean Expressions: Application to Gene Expression and Regulatory Modeling
Regulatory network analysis and other bioinformatics tasks require the ability to induce and represent arbitrary boolean expressions from data sources. We introduce a novel framew...
Mohammed Javeed Zaki, Naren Ramakrishnan, Lizhuang...
TCS
2008
9 years 11 months ago
Itemset frequency satisfiability: Complexity and axiomatization
Computing frequent itemsets is one of the most prominent problems in data mining. We study the following related problem, called FREQSAT, in depth: given some itemset-interval pai...
Toon Calders
DEBS
2007
ACM
10 years 3 months ago
The arbitrary Boolean publish/subscribe model: making the case
In this paper, we present BoP, a content-based publish/subscribe system for arbitrary Boolean subscriptions and advertisements. BoP targets at the time and space-efficient matchin...
Sven Bittner, Annika Hinze
DATE
2009
IEEE
85views Hardware» more  DATE 2009»
10 years 6 months ago
Faster SAT solving with better CNF generation
Boolean satis´Čüability (SAT) solving has become an enabling technology with wide-ranging applications in numerous disciplines. These applications tend to be most naturally encode...
Benjamin Chambers, Panagiotis Manolios, Daron Vroo...
books