Sciweavers

334 search results - page 66 / 67
» Can a Model Checker Generate Tests for Non-Deterministic Sys...
Sort
View
FASE
2006
Springer
13 years 9 months ago
Regular Inference for State Machines with Parameters
Techniques for inferring a regular language, in the form of a finite automaton, from a sufficiently large sample of accepted and nonaccepted input words, have been employed to cons...
Therese Berg, Bengt Jonsson, Harald Raffelt
ESANN
2008
13 years 7 months ago
A method for robust variable selection with significance assessment
Our goal is proposing an unbiased framework for gene expression analysis based on variable selection combined with a significance assessment step. We start by discussing the need ...
Annalisa Barla, Sofia Mosci, Lorenzo Rosasco, Ales...
BMCBI
2006
130views more  BMCBI 2006»
13 years 5 months ago
Docking protein domains in contact space
Background: Many biological processes involve the physical interaction between protein domains. Understanding these functional associations requires knowledge of the molecular str...
Stefano Lise, Alice Walker-Taylor, David T. Jones
HPDC
2010
IEEE
13 years 6 months ago
MOON: MapReduce On Opportunistic eNvironments
MapReduce offers a flexible programming model for processing and generating large data sets on dedicated resources, where only a small fraction of such resources are every unavaila...
Heshan Lin, Xiaosong Ma, Jeremy S. Archuleta, Wu-c...
JAR
2000
145views more  JAR 2000»
13 years 5 months ago
Logical Cryptanalysis as a SAT Problem
Cryptographic algorithms play a key role in computer security and the formal analysis of their robustness is of utmost importance. Yet, logic and automated reasoning tools are seld...
Fabio Massacci, Laura Marraro