4372 search results - page 562 / 875 » Algorithmic Theories of Everything |
162
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 ...
278
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...
251
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...
272
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...
203
click to vote
PODS
2008
ACM
16 years 6 months ago
2008
ACM
We study complexity and approximation of queries in an expressive query language for probabilistic databases. The language studied supports the compositional use of confidence com...