Sciweavers

256 search results - page 20 / 52
» Uncertainty Reasoning for Linked Data
Sort
View
TACAS
2007
Springer
103views Algorithms» more  TACAS 2007»
14 years 2 months ago
A Reachability Predicate for Analyzing Low-Level Software
Reasoning about heap-allocated data structures such as linked lists and arrays is challenging. The reachability predicate has proved to be useful for reasoning about the heap in ty...
Shaunak Chatterjee, Shuvendu K. Lahiri, Shaz Qadee...
JIB
2007
88views more  JIB 2007»
13 years 7 months ago
Achieving k-anonymity in DataMarts used for gene expressions exploitation
Gene expression profiling is a sophisticated method to discover differences in activation patterns of genes between different patient collectives. By reasonably defining patient...
Konrad Stark, Johann Eder, Kurt Zatloukal
RSFDGRC
2005
Springer
134views Data Mining» more  RSFDGRC 2005»
14 years 1 months ago
The Computational Complexity of Inference Using Rough Set Flow Graphs
Pawlak recently introduced rough set flow graphs (RSFGs) as a graphical framework for reasoning from data. Each rule is associated with three coefficients, which have been shown t...
Cory J. Butz, Wen Yan, Boting Yang
ACIVS
2006
Springer
13 years 11 months ago
Interactive Learning of Scene Context Extractor Using Combination of Bayesian Network and Logic Network
The vision-based scene understanding technique that infers scene-interpreting contexts from real-world vision data has to not only deal with various uncertain environments but also...
Keum-Sung Hwang, Sung-Bae Cho
BMCBI
2005
121views more  BMCBI 2005»
13 years 7 months ago
Evaluation of gene importance in microarray data based upon probability of selection
Background: Microarray devices permit a genome-scale evaluation of gene function. This technology has catalyzed biomedical research and development in recent years. As many import...
Li M. Fu, Casey S. Fu-Liu