Sciweavers

736 search results - page 116 / 148
» Distinguishing geometric graphs
Sort
View
PODC
2004
ACM
15 years 5 months ago
On the expected payment of mechanisms for task allocation
We study a representative task allocation problem called shortest paths: Let G be a graph in which the edges are owned by self interested agents. The cost of each edge is privatel...
Artur Czumaj, Amir Ronen
DEXA
2004
Springer
136views Database» more  DEXA 2004»
15 years 5 months ago
PC-Filter: A Robust Filtering Technique for Duplicate Record Detection in Large Databases
: In this paper, we will propose PC-Filter (PC stands for Partition Comparison), a robust data filter for approximately duplicate record detection in large databases. PC-Filter dis...
Ji Zhang, Tok Wang Ling, Robert M. Bruckner, Han L...
ICDCS
2002
IEEE
15 years 4 months ago
dRBAC: Distributed Role-based Access Control for Dynamic Coalition Environments
Distributed Role-Based Access Control (dRBAC) is a scalable, decentralized trust-management and accesscontrol mechanism for systems that span multiple administrative domains. dRBA...
Eric Freudenthal, Tracy Pesin, Lawrence Port, Edwa...
ER
1999
Springer
108views Database» more  ER 1999»
15 years 4 months ago
Modeling Cyclic Change
Database support of time-varying phenomena typically assumes that entities change in a linear fashion. Many phenomena, however, change cyclically over time. Examples include monsoo...
Kathleen Hornsby, Max J. Egenhofer, Patrick J. Hay...
SP
1998
IEEE
116views Security Privacy» more  SP 1998»
15 years 4 months ago
Strand Spaces: Why is a Security Protocol Correct?
A strand is a sequence of events; it represents either the execution of legitimate party in a security protocol or else a sequence of actions by a penetrator. A strand space is a ...
F. Javier Thayer, Jonathan C. Herzog, Joshua D. Gu...