Sciweavers

3384 search results - page 162 / 677
» More Testable Properties
Sort
View
DBSEC
2008
103views Database» more  DBSEC 2008»
13 years 10 months ago
Exclusive Strategy for Generalization Algorithms in Micro-data Disclosure
Abstract. When generalization algorithms are known to the public, an adversary can obtain a more precise estimation of the secret table than what can be deduced from the disclosed ...
Lei Zhang 0004, Lingyu Wang, Sushil Jajodia, Alexa...
ENTCS
2010
99views more  ENTCS 2010»
13 years 9 months ago
Describing Secure Interfaces with Interface Automata
Interface automata are a model that allows for the representation of stateful interfaces. In this paper we introduce a variant of interface automata, which we call interface struc...
Matias Lee, Pedro R. D'Argenio
ENTCS
2007
111views more  ENTCS 2007»
13 years 9 months ago
Multi Labelled Transition Systems: A Semantic Framework for Nominal Calculi
Action Labelled transition systems (LTS) have proved to be a fundamental model for describing and proving properties of concurrent systems. In this paper,Multiple Labelled Transit...
Rocco De Nicola, Michele Loreti
IJON
2007
77views more  IJON 2007»
13 years 9 months ago
Reliability and stochastic synchronization in type I vs. type II neural oscillators
Neural reliability and stochastic synchronization are remarkable features of real neurons with important consequences for neural computation. Both phenomena are general properties...
Roberto Fdez. Galán, Bard Ermentrout, Natha...
TALG
2008
69views more  TALG 2008»
13 years 9 months ago
Testing Euclidean minimum spanning trees in the plane
Given a Euclidean graph G over a set P of n points in the plane, we are interested in verifying whether G is a Euclidean minimum spanning tree (EMST) of P or G differs from it in ...
Artur Czumaj, Christian Sohler