Sciweavers

9520 search results - page 1832 / 1904
» is 2011
Sort
View
PODC
2011
ACM
14 years 7 months ago
Locally checkable proofs
This work studies decision problems from the perspective of nondeterministic distributed algorithms. For a yes-instance there must exist a proof that can be verified with a distri...
Mika Göös, Jukka Suomela
155
Voted
PODC
2011
ACM
14 years 7 months ago
Robust network supercomputing without centralized control
Internet supercomputing is becoming an increasingly popular means for harnessing the power of a vast number of interconnected computers. This comes at a cost substantially lower t...
Seda Davtyan, Kishori M. Konwar, Alexander A. Shva...
PODC
2011
ACM
14 years 7 months ago
Coordinated consensus in dynamic networks
We study several variants of coordinated consensus in dynamic networks. We assume a synchronous model, where the communication graph for each round is chosen by a worst-case adver...
Fabian Kuhn, Rotem Oshman, Yoram Moses
PODS
2011
ACM
163views Database» more  PODS 2011»
14 years 7 months ago
Provenance views for module privacy
Scientific workflow systems increasingly store provenance information about the module executions used to produce a data item, as well as the parameter settings and intermediate...
Susan B. Davidson, Sanjeev Khanna, Tova Milo, Debm...
PODS
2011
ACM
201views Database» more  PODS 2011»
14 years 7 months ago
Data exchange beyond complete data
In the traditional data exchange setting, source instances are restricted to be complete in the sense that every fact is either true or false in these instances. Although natural ...
Marcelo Arenas, Jorge Pérez, Juan L. Reutte...
« Prev « First page 1832 / 1904 Last » Next »