Sciweavers

1690 search results - page 128 / 338
» Algorithmic Properties of Millstream Systems
Sort
View
SWAT
2004
Springer
129views Algorithms» more  SWAT 2004»
15 years 9 months ago
Collective Tree Spanners of Graphs
In this paper we introduce a new notion of collective tree spanners. We say that a graph G = (V, E) admits a system of µ collective additive tree r-spanners if there is a system T...
Feodor F. Dragan, Chenyu Yan, Irina Lomonosov
SACMAT
2010
ACM
15 years 2 months ago
Role mining based on weights
Role mining from the existing permissions has been widely applied to aid the process of migrating to an RBAC system. While all permissions are treated evenly in previous approache...
Xiaopu Ma, Ruixuan Li, Zhengding Lu
ASIAN
2006
Springer
133views Algorithms» more  ASIAN 2006»
15 years 8 months ago
Normal Proofs in Intruder Theories
Given an arbitrary intruder deduction capability, modeled as an inference system S and a protocol, we show how to compute an inference system bS such that the security problem for ...
Vincent Bernat, Hubert Comon-Lundh
PLDI
2012
ACM
13 years 7 months ago
Speculative linearizability
Linearizability is a key design methodology for reasoning about tations of concurrent abstract data types in both shared memory and message passing systems. It provides the illusi...
Rachid Guerraoui, Viktor Kuncak, Giuliano Losa
KDD
2009
ACM
185views Data Mining» more  KDD 2009»
16 years 5 months ago
On compressing social networks
Motivated by structural properties of the Web graph that support efficient data structures for in memory adjacency queries, we study the extent to which a large network can be com...
Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, ...