Sciweavers

3378 search results - page 602 / 676
» A universe of binding and computation
Sort
View
STOC
2006
ACM
149views Algorithms» more  STOC 2006»
15 years 10 months ago
Bounded-error quantum state identification and exponential separations in communication complexity
We consider the problem of bounded-error quantum state identification: given either state 0 or state 1, we are required to output `0', `1' or `?' ("don't ...
Dmitry Gavinsky, Julia Kempe, Oded Regev, Ronald d...
STOC
2005
ACM
164views Algorithms» more  STOC 2005»
15 years 10 months ago
Cooperative asynchronous update of shared memory
The Write-All problem for an asynchronous shared-memory system has the objective for the processes to update the contents of a set of shared registers, while minimizing the mber o...
Bogdan S. Chlebus, Dariusz R. Kowalski
SIGMOD
2003
ACM
124views Database» more  SIGMOD 2003»
15 years 10 months ago
Dynamic XML documents with distribution and replication
The advent of XML as a universal exchange format, and of Web services as a basis for distributed computing, has fostered the apparition of a new class of documents: dynamic XML do...
Serge Abiteboul, Angela Bonifati, Gregory Cobena, ...
SIGMOD
2003
ACM
175views Database» more  SIGMOD 2003»
15 years 10 months ago
WinMagic : Subquery Elimination Using Window Aggregation
Database queries often take the form of correlated SQL queries. Correlation refers to the use of values from the outer query block to compute the inner subquery. This is a conveni...
Calisto Zuzarte, Hamid Pirahesh, Wenbin Ma, Qi Che...
PODS
2008
ACM
178views Database» more  PODS 2008»
15 years 10 months ago
The chase revisited
We revisit the classical chase procedure, studying its properties as well as its applicability to standard database problems. We settle (in the negative) the open problem of decid...
Alin Deutsch, Alan Nash, Jeffrey B. Remmel