Sciweavers

713 search results - page 117 / 143
» Using information about functions in selecting test cases
Sort
View
ENTCS
2006
134views more  ENTCS 2006»
13 years 8 months ago
Anonymity in Probabilistic and Nondeterministic Systems
Anonymity means that the identity of the user performing a certain action is maintained secret. The protocols for ensuring anonymity often use random mechanisms which can be descr...
Catuscia Palamidessi
BIOINFORMATICS
2006
101views more  BIOINFORMATICS 2006»
13 years 8 months ago
A lock-and-key model for protein-protein interactions
Motivation: Protein-protein interaction networks are one of the major post-genomic data sources available to molecular biologists. They provide a comprehensive view of the global ...
Julie L. Morrison, Rainer Breitling, Desmond J. Hi...
EACL
2003
ACL Anthology
13 years 10 months ago
Topological Parsing
We present a new grammar formalism for parsing with freer word-order languages, motivated by recent linguistic research in German and the Slavic languages. Unlike CFGs, these gram...
Gerald Penn, Mohammad Haji-Abdolhosseini
PODS
2007
ACM
203views Database» more  PODS 2007»
14 years 9 months ago
Decision trees for entity identification: approximation algorithms and hardness results
We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities...
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Samb...
FORMATS
2006
Springer
14 years 13 days ago
Extended Directed Search for Probabilistic Timed Reachability
Current numerical model checkers for stochastic systems can efficiently analyse stochastic models. However, the fact that they are unable to provide debugging information constrain...
Husain Aljazzar, Stefan Leue