Sciweavers

1729 search results - page 298 / 346
» On Bounds for the k-Partitioning of Graphs
Sort
View
CCS
2011
ACM
13 years 10 months ago
Automatic error finding in access-control policies
Verifying that access-control systems maintain desired security properties is recognized as an important problem in security. Enterprise access-control systems have grown to prote...
Karthick Jayaraman, Vijay Ganesh, Mahesh V. Tripun...
INFOCOM
2012
IEEE
13 years 10 days ago
SybilDefender: Defend against sybil attacks in large social networks
—Distributed systems without trusted identities are particularly vulnerable to sybil attacks, where an adversary creates multiple bogus identities to compromise the running of th...
Wei Wei, Fengyuan Xu, Chiu Chiang Tan, Qun Li
DIALM
2003
ACM
139views Algorithms» more  DIALM 2003»
15 years 3 months ago
dBBlue: low diameter and self-routing bluetooth scatternet
This paper addresses the problem of scatternet formation for singlehop Bluetooth based ad hoc networks, with minimal communication overhead. We adopt the well-known structure de B...
Wen-Zhan Song, Xiang-Yang Li, Yu Wang 0003, Weizha...
ICDT
2009
ACM
150views Database» more  ICDT 2009»
15 years 10 months ago
Optimizing user views for workflows
A technique called user views has recently been proposed to focus user attention on relevant information in response to provenance queries over workflow executions [1, 2]: Given u...
Olivier Biton, Susan B. Davidson, Sanjeev Khanna, ...
STOC
2005
ACM
164views Algorithms» more  STOC 2005»
15 years 10 months ago
Cooperative asynchronous update of shared memory
The Write-All problem for an asynchronous shared-memory system has the objective for the processes to update the contents of a set of shared registers, while minimizing the mber o...
Bogdan S. Chlebus, Dariusz R. Kowalski