Sciweavers

10608 search results - page 1992 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
PODC
2011
ACM
13 years 28 days 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»
13 years 28 days 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»
13 years 28 days 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...
SIGMOD
2011
ACM
276views Database» more  SIGMOD 2011»
13 years 27 days ago
Schedule optimization for data processing flows on the cloud
Scheduling data processing workflows (dataflows) on the cloud is a very complex and challenging task. It is essentially an optimization problem, very similar to query optimizati...
Herald Kllapi, Eva Sitaridi, Manolis M. Tsangaris,...
SIGMOD
2011
ACM
241views Database» more  SIGMOD 2011»
13 years 27 days ago
Neighborhood based fast graph search in large networks
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
Arijit Khan, Nan Li, Xifeng Yan, Ziyu Guan, Supriy...
« Prev « First page 1992 / 2122 Last » Next »