Sciweavers

26071 search results - page 5188 / 5215
» Making the
Sort
View
PODC
2012
ACM
11 years 11 months ago
Iterative approximate byzantine consensus in arbitrary directed graphs
This paper proves a necessary and sufficient condition for the existence of iterative algorithms that achieve approximate Byzantine consensus in arbitrary directed graphs, where e...
Nitin H. Vaidya, Lewis Tseng, Guanfeng Liang
ACL
2012
11 years 11 months ago
You Had Me at Hello: How Phrasing Affects Memorability
Understanding the ways in which information achieves widespread public awareness is a research question of significant interest. We consider whether, and how, the way in which th...
Cristian Danescu-Niculescu-Mizil, Justin Cheng, Jo...
ICDT
2012
ACM
242views Database» more  ICDT 2012»
11 years 11 months ago
Win-move is coordination-free (sometimes)
In a recent paper by Hellerstein [15], a tight relationship was conjectured between the number of strata of a Datalog¬ program and the number of “coordination stages” require...
Daniel Zinn, Todd J. Green, Bertram Ludäscher
ICDT
2012
ACM
251views Database» more  ICDT 2012»
11 years 11 months ago
Computing universal models under guarded TGDs
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
André Hernich
ICDCS
2012
IEEE
11 years 11 months ago
eTransform: Transforming Enterprise Data Centers by Automated Consolidation
Abstract—Modern day enterprises have a large IT infrastructure comprising thousands of applications running on servers housed in tens of data centers geographically spread out. T...
Rahul Singh, Prashant J. Shenoy, K. K. Ramakrishna...
« Prev « First page 5188 / 5215 Last » Next »