Sciweavers

2414 search results - page 391 / 483
» Computing Normal Subgroups
Sort
View
ACSD
2007
IEEE
93views Hardware» more  ACSD 2007»
13 years 11 months ago
SAT-based Unbounded Model Checking of Timed Automata
We present an improvement of the SAT-based Unbounded Model Checking (UMC) algorithm. UMC, a symbolic approach introduced in [7], uses propositional formulas in conjunctive normal ...
Wojciech Penczek, Maciej Szreter
CPAIOR
2008
Springer
13 years 11 months ago
Leveraging Belief Propagation, Backtrack Search, and Statistics for Model Counting
We consider the problem of estimating the model count (number of solutions) of Boolean formulas, and present two techniques that compute estimates of these counts, as well as eith...
Lukas Kroc, Ashish Sabharwal, Bart Selman
IDA
2010
Springer
13 years 11 months ago
Oracle Coached Decision Trees and Lists
This paper introduces a novel method for obtaining increased predictive performance from transparent models in situations where production input vectors are available when building...
Ulf Johansson, Cecilia Sönströd, Tuve L&...
BIOCOMP
2008
13 years 11 months ago
Identifying Protein Flexibility by NMA
- Here proposed apriori method for identification of protein flexibility relies on one end-state conformation of the protein. This method has comparative advantage over many others...
Kresimir Sikic, Branko Jeren, Sanja Tomic
DBSEC
2008
196views Database» more  DBSEC 2008»
13 years 11 months ago
Shared and Searchable Encrypted Data for Untrusted Servers
Current security mechanisms are not suitable for organisations that outsource their data management to untrusted servers. Encrypting and decrypting sensitive data at the client si...
Changyu Dong, Giovanni Russello, Naranker Dulay