Sciweavers

3381 search results - page 545 / 677
» Extending Dependencies with Conditions
Sort
View
TCS
2008
15 years 6 months ago
Cryptographically-masked flows
Abstract. Cryptographic operations are essential for many security-critical systems. Reasoning about information flow in such systems is challenging because typical (noninterferenc...
Aslan Askarov, Daniel Hedin, Andrei Sabelfeld
TIT
2008
103views more  TIT 2008»
15 years 6 months ago
Fast Distributed Algorithms for Computing Separable Functions
The problem of computing functions of values at the nodes in a network in a fully distributed manner, where nodes do not have unique identities and make decisions based only on loc...
Damon Mosk-Aoyama, Devavrat Shah
JCM
2007
76views more  JCM 2007»
15 years 6 months ago
On the Tradeoff Between Blocking and Dropping Probabilities in Multi-cell CDMA Networks
— This paper is a sequel of previous work, in which we proposed a model and computational technique to calculate the Erlang capacity of a single CDMA cell that supports elastic s...
Gábor Fodor, Miklós Telek
JLP
2007
99views more  JLP 2007»
15 years 6 months ago
Resources in process algebra
The algebra of communicating shared resources (ACSR) is a timed process algebra which extends classical process algebras with the notion of a resource. It takes the view that the ...
Insup Lee, Anna Philippou, Oleg Sokolsky
188
Voted
AIL
2004
103views more  AIL 2004»
15 years 6 months ago
Legal Ontologies in Knowledge Engineering and Information Management
In this article we describe two core ontologies of law that specify knowledge that is common to all domains of law. The first one, FOLaw describes and explains dependencies between...
Joost Breuker, André Valente, Radboud Winke...