Sciweavers

175 search results - page 4 / 35
» Functional Dependency for Verification Reduction
Sort
View
SPEECH
2008
71views more  SPEECH 2008»
13 years 5 months ago
Unsupervised intra-speaker variability compensation based on Gestalt and model adaptation in speaker verification with telephone
In this paper an unsupervised compensation method based on Gestalt, ISVC, is proposed to address the problem of limited enrolling data and noise robustness in text-dependent speak...
Néstor Becerra Yoma, Claudio Garretó...
SIGSOFT
2010
ACM
13 years 3 months ago
Separation of concerns for dependable software design
For `mixed-criticality' systems that have both critical and non-critical functions, the greatest leverage on dependability may be at the design level. By designing so that ea...
Daniel Jackson, Eunsuk Kang
ASE
2004
167views more  ASE 2004»
13 years 5 months ago
Cluster-Based Partial-Order Reduction
The verification of concurrent systems through an exhaustive traversal of the state space suffers from the infamous state-space-explosion problem, caused by the many interleavings ...
Twan Basten, Dragan Bosnacki, Marc Geilen
FAC
2008
100views more  FAC 2008»
13 years 5 months ago
Slicing communicating automata specifications: polynomial algorithms for model reduction
Abstract. Slicing is a program analysis technique that was originally introduced to improve program debugging and understanding. The purpose of a slicing algorithm is to remove the...
Sébastien Labbé, Jean-Pierre Gallois
TCC
2009
Springer
153views Cryptology» more  TCC 2009»
14 years 6 months ago
On the (Im)Possibility of Key Dependent Encryption
We study the possibility of constructing encryption schemes secure under messages that are chosen depending on the key k of the encryption scheme itself. We give the following sep...
Iftach Haitner, Thomas Holenstein