6045 search results - page 1073 / 1209 » Computable Linearizations of Well-partial-orderings |
PODS
2012
ACM
11 years 11 months ago
2012
ACM
We study the mergeability of data summaries. Informally speaking, mergeability requires that, given two summaries on two data sets, there is a way to merge the two summaries into ...
TKDE
2012
11 years 11 months ago
2012
— We study the problem of assigning subscribers to brokers in a wide-area content-based publish/subscribe system. A good assignment should consider both subscriber interests in t...
SIGGRAPH
1993
ACM
14 years 1 months ago
1993
ACM
Radiosity methods have been shown to be an effective means to solve the global illumination problem in Lambertian diffuse environments. These methods approximate the radiosity int...
PODC
2010
ACM
14 years 1 months ago
2010
ACM
Linearizability is the strongest known consistency property of shared objects. In asynchronous message passing systems, Linearizability can be achieved with 3S and a majority of c...
FOCS
2004
IEEE
14 years 29 days ago
2004
IEEE
We prove the existence of tolls to induce multicommodity, heterogeneous network users that independently choose routes minimizing their own linear function of tolls versus latency...