Sciweavers

1077 search results - page 135 / 216
» Approximate reduction of dynamic systems
Sort
View
ICTCS
2005
Springer
15 years 6 months ago
Checking Risky Events Is Enough for Local Policies
Abstract. An extension of the λ-calculus is proposed to study historybased access control. It allows for parametrized security policies with a possibly nested, local scope. To gov...
Massimo Bartoletti, Pierpaolo Degano, Gian Luigi F...
97
Voted
SPIN
2000
Springer
15 years 4 months ago
Communication Topology Analysis for Concurrent Programs
Abstract. In this article, we address the problem of statically determining an approximation of the communication topology of concurrent programs. These programs may contain dynami...
Matthieu Martel, Marc Gengler
85
Voted
NIPS
2003
15 years 2 months ago
Sample Propagation
Rao–Blackwellization is an approximation technique for probabilistic inference that flexibly combines exact inference with sampling. It is useful in models where conditioning o...
Mark A. Paskin
91
Voted
TIT
2002
75views more  TIT 2002»
15 years 12 days ago
Iterative multiuser joint decoding: Unified framework and asymptotic analysis
We present a framework for iterative multiuser joint decoding of code-division multiple-access (CDMA) signals, based on the factor-graph representation and on the sum-product algor...
Joseph Boutros, Giuseppe Caire
92
Voted
ATAL
2005
Springer
15 years 6 months ago
From team plan to individual plans: a petri net-based approach
This paper focuses on a framework for representing a team plan and its projections on individual agents. The team plan is represented with a coloured Petri net. Using the implicit...
Olivier Bonnet-Torrés, Catherine Tessier