Sciweavers

2917 search results - page 430 / 584
» Satisfying Interaction Constraints
Sort
View
QEST
2010
IEEE
15 years 2 months ago
Information Hiding in Probabilistic Concurrent Systems
Information hiding is a general concept which refers to the goal of preventing an adversary to infer secret information from the observables. Anonymity and Information Flow are exa...
Miguel E. Andrés, Catuscia Palamidessi, Pet...
TACAS
2010
Springer
212views Algorithms» more  TACAS 2010»
15 years 2 months ago
Assume-Guarantee Verification for Probabilistic Systems
Abstract. We present a compositional verification technique for systems that exhibit both probabilistic and nondeterministic behaviour. We adopt an assume-guarantee approach to ver...
Marta Z. Kwiatkowska, Gethin Norman, David Parker,...
CORR
2011
Springer
188views Education» more  CORR 2011»
14 years 11 months ago
Information-Theoretic Viewpoints on Optimal Causal Coding-Decoding Problems
—In this paper we consider an interacting two-agent sequential decision-making problem consisting of a Markov source process, a causal encoder with feedback, and a causal decoder...
Siva K. Gorantla, Todd P. Coleman
JCIT
2010
181views more  JCIT 2010»
14 years 11 months ago
Geospatial Web Services Semantic Discovery Approach Using Quality
The use of geographic data through Web services shows the geospatial Web Services (GWS). A growing number of GWS designed to interoperate spatial information over the network have...
Rezeg Khaled, Laskri Mohamed Tayeb, Sylvie Servign...
TIT
2010
129views Education» more  TIT 2010»
14 years 11 months ago
Random access in wireless networks with overlapping cells
We study cellular-like wireless networks in which the cells may overlap substantially, and a common channel is used for all cells. Thus, transmissions intended for one destination ...
Gam D. Nguyen, Jeffrey E. Wieselthier, Anthony Eph...