Sciweavers

4047 search results - page 450 / 810
» Some Properties and Some Problems on Set Functors
Sort
View
PAMI
2010
185views more  PAMI 2010»
15 years 5 months ago
Evaluating Stability and Comparing Output of Feature Selectors that Optimize Feature Subset Cardinality
—Stability (robustness) of feature selection methods is a topic of recent interest, yet often neglected importance, with direct impact on the reliability of machine learning syst...
Petr Somol, Jana Novovicová
CSE
2009
IEEE
15 years 4 months ago
Verifying the Interplay of Authorization Policies and Workflow in Service-Oriented Architectures
Abstract--A widespread design approach in distributed applications based on the service-oriented paradigm, such as web-services, consists of clearly separating the enforcement of a...
Michele Barletta, Silvio Ranise, Luca Viganò...
IFIP
2009
Springer
15 years 4 months ago
Attack, Solution and Verification for Shared Authorisation Data in TCG TPM
The Trusted Platform Module (TPM) is a hardware chip designed to enable computers achieve greater security. Proof of possession of authorisation values known as authdata is require...
Liqun Chen, Mark Ryan
NFM
2011
242views Formal Methods» more  NFM 2011»
15 years 1 months ago
Model Checking Using SMT and Theory of Lists
A main idea underlying bounded model checking is to limit the length of the potential counter-examples, and then prove properties for the bounded version of the problem. In softwar...
Aleksandar Milicevic, Hillel Kugler
JSC
2010
100views more  JSC 2010»
15 years 1 months ago
An invariant-based approach to the verification of asynchronous parameterized networks
A uniform verification problem for parameterized systems is to determine whether a temporal property is satisfied for every instance of the system which is composed of an arbitrar...
Igor V. Konnov, Vladimir A. Zakharov