4403 search results - page 561 / 881 » Galois Theory of Algorithms |
203
click to vote
STOC
2003
ACM
16 years 7 months ago
2003
ACM
We construct binary codes for fingerprinting. Our codes for n users that are -secure against c pirates have length O(c2 log(n/ )). This improves the codes proposed by Boneh and Sh...
178
click to vote
STOC
2001
ACM
16 years 7 months ago
2001
ACM
Recently Rothemund and Winfree 6] have considered the program size complexity of constructing squares by selfassembly. Here, we consider the time complexity of such constructions ...
296
click to vote
VLDB
2001
ACM
16 years 7 months ago
2001
ACM
In this paper, we present an approach to global transactionmanagementinworkflowenvironments.Thetransaction mechanism is based on the well-known notion of compensation, but extended...
269
click to vote
SIGMOD
2008
ACM
16 years 7 months ago
2008
ACM
We identify proximity breach as a privacy threat specific to numerical sensitive attributes in anonymized data publication. Such breach occurs when an adversary concludes with hig...
291
click to vote
SIGMOD
2007
ACM
16 years 7 months ago
2007
ACM
The previous literature of privacy preserving data publication has focused on performing "one-time" releases. Specifically, none of the existing solutions supports re-pu...