4940 search results - page 641 / 988 » On the Complexity of Universal Programs |
169
Voted
WWW
2008
ACM
16 years 7 months ago
2008
ACM
In this poster, we present the P2P XML data localization layer of XLive, an XQuery mediation system developed at University of Versailles [2]. A major challenge in the evaluation ...
266
click to vote
PODS
2009
ACM
16 years 7 months ago
2009
ACM
A distributed XML document is an XML document that spans several machines or Web repositories. We assume that a distribution design of the document tree is given, providing an XML...
183
click to vote
CHI
2006
ACM
16 years 7 months ago
2006
ACM
icians or philosophers use abstract symbols to derive formulas or form proofs. Indeed, these sketches are structural geometric proofs, consistent with Plato's supposition that...
197
click to vote
STOC
2004
ACM
16 years 7 months ago
2004
ACM
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
180
click to vote
STOC
2003
ACM
16 years 7 months ago
2003
ACM
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...