Sciweavers

961 search results - page 184 / 193
» An Algorithm for Computing Semi-stable Semantics
Sort
View
BMCBI
2008
141views more  BMCBI 2008»
13 years 7 months ago
Ontology-guided data preparation for discovering genotype-phenotype relationships
Complexity of post-genomic data and multiplicity of mining strategies are two limits to Knowledge Discovery in Databases (KDD) in life sciences. Because they provide a semantic fr...
Adrien Coulet, Malika Smaïl-Tabbone, Pascale ...
SAS
1999
Springer
13 years 11 months ago
Eliminating Dead Code on Recursive Data
This paper describes a powerful method for dead code analysis and elimination in the presence of recursive data constructions. We describe partially dead recursive data using live...
Yanhong A. Liu, Scott D. Stoller
CSFW
2010
IEEE
13 years 11 months ago
Required Information Release
Abstract—Many computer systems have a functional requirement to release information. Such requirements are an important part of a system’s information security requirements. Cu...
Stephen Chong
KDD
2010
ACM
223views Data Mining» more  KDD 2010»
13 years 11 months ago
Frequent regular itemset mining
Concise representations of frequent itemsets sacrifice readability and direct interpretability by a data analyst of the concise patterns extracted. In this paper, we introduce an...
Salvatore Ruggieri
ISSTA
2010
ACM
13 years 9 months ago
Exploiting program dependencies for scalable multiple-path symbolic execution
This paper presents a new technique, called Symbolic Program Decomposition (or SPD), for symbolic execution of multiple paths that is more scalable than existing techniques, which...
Raúl A. Santelices, Mary Jean Harrold