8780 search results - page 1369 / 1756 » On the Feasibility of Consistent Computations |
110
click to vote
WWW
2009
ACM
16 years 7 months ago
2009
ACM
For the last few years we have studied the diffusion of private information about users as they visit various Web sites triggering data gathering aggregation by third parties. Thi...
173
click to vote
WWW
2007
ACM
16 years 7 months ago
2007
ACM
With the growing use of dynamic web content generated from relational databases, traditional caching solutions for throughput and latency improvements are ineffective. We describe...
187
click to vote
WWW
2005
ACM
16 years 7 months ago
2005
ACM
The Semantic Web consists of many RDF graphs nameable by URIs. This paper extends the syntax and semantics of RDF to cover such Named Graphs. This enables RDF statements that desc...
292
click to vote
PLDI
2009
ACM
16 years 7 months ago
2009
ACM
Languages such as Java and C#, as well as scripting languages like Python, and Ruby, make extensive use of Collection classes. A collection implementation represents a fixed choic...
196
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
We put forth a new computational notion of entropy, which measures the (in)feasibility of sampling high entropy strings that are consistent with a given protocol. Specifically, we...