Sciweavers

8094 search results - page 18 / 1619
» Improvements in Formula Generalization
Sort
View
CINQ
2004
Springer
118views Database» more  CINQ 2004»
14 years 1 months ago
Boolean Formulas and Frequent Sets
We consider the problem of how one can estimate the support of Boolean queries given a collection of frequent itemsets. We describe an algorithm that truncates the inclusion-exclus...
Jouni K. Seppänen, Heikki Mannila
CSB
2005
IEEE
137views Bioinformatics» more  CSB 2005»
14 years 1 months ago
Improving Operon Prediction in E. coli
In bacterium, genes working in the same pathway or interacting with each other are often organized into operons. Currently, the prediction accuracy for operon/boundary gene pairs ...
PhuongAn Dam, Victor Olman, Ying Xu
SAT
2007
Springer
118views Hardware» more  SAT 2007»
14 years 1 months ago
Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities
Abstract. We continue a study initiated by Kraj´ıˇcek of a Resolutionlike proof system working with clauses of linear inequalities, R(CP). For all proof systems of this kind Kra...
Arist Kojevnikov
EMSOFT
2007
Springer
14 years 1 months ago
Uniformity improving page allocation for flash memory file systems
Flash memory is a storage medium that is becoming more and more popular. Though not yet fully embraced in traditional computing systems, Flash memory is prevalent in embedded syst...
Seungjae Baek, Seongjun Ahn, Jongmoo Choi, Donghee...
FCT
2003
Springer
14 years 26 days ago
Compositionality of Hennessy-Milner Logic through Structural Operational Semantics
This paper presents a method for the decomposition of HML formulae. It can be used to decide whether a process algebra term satisfies a HML formula, by checking whether subterms s...
Wan Fokkink, Rob J. van Glabbeek, Paulien de Wind