Sciweavers

2017 search results - page 322 / 404
» Distributional Semantics in Technicolor
Sort
View
DEDS
2007
104views more  DEDS 2007»
15 years 6 months ago
Trellis Processes : A Compact Representation for Runs of Concurrent Systems
The unfolding of a concurrent system represents in a compact manner all possible runs of this system. Unfoldings are used in many applications, ranging from model-checking (offlin...
Eric Fabre
ENTCS
2007
140views more  ENTCS 2007»
15 years 6 months ago
Secured Information Flow for Asynchronous Sequential Processes
We present in this article a precise security model for data confidentiality in the framework of ASP (Asynchronous Sequential Processes). ASP is based on active objects, asynchro...
Isabelle Attali, Denis Caromel, Ludovic Henrio, Fe...
WWW
2003
ACM
16 years 6 months ago
Super-peer-based routing and clustering strategies for RDF-based peer-to-peer networks
RDF-based P2P networks have a number of advantages compared with simpler P2P networks such as Napster, Gnutella or with approaches based on distributed indices such as CAN and CHO...
Alexander Löser, Christoph Schmitz, Ingo Brun...
CONCUR
2009
Springer
16 years 18 days ago
Probabilistic Weighted Automata
Nondeterministic weighted automata are finite automata with numerical weights on transitions. They define quantitative languages L that assign to each word w a real number L(w). ...
Krishnendu Chatterjee, Laurent Doyen, Thomas A. He...
CDC
2008
IEEE
128views Control Systems» more  CDC 2008»
16 years 15 days ago
Time-robust discrete control over networked Loosely Time-Triggered Architectures
In this paper we consider Loosely Time-Triggered Architectures (LTTA) as a networked infrastructure for deploying discrete control. LTTA are distributed architectures in which 1/ ...
Paul Caspi, Albert Benveniste