Sciweavers

70 search results - page 10 / 14
» Asynchronous aggregation and consistency in distributed cons...
Sort
View
VLDB
2000
ACM
129views Database» more  VLDB 2000»
13 years 10 months ago
Offering a Precision-Performance Tradeoff for Aggregation Queries over Replicated Data
Strict consistency of replicated data is infeasible or not required by many distributed applications, so current systems often permit stale replication, in which cached copies of ...
Chris Olston, Jennifer Widom
MMNS
2007
105views Multimedia» more  MMNS 2007»
13 years 8 months ago
Monitoring Flow Aggregates with Controllable Accuracy
In this paper, we show the feasibility of real-time flow monitoring with controllable accuracy in today’s IP networks. Our approach is based on Netflow and A-GAP. A-GAP is a prot...
Alberto Gonzalez Prieto, Rolf Stadler
COLCOM
2007
IEEE
13 years 8 months ago
Maintaining constraints expressed as formulas in collaborative systems
—Constraints allow users to declare relationships among objects and let the constraint systems maintain and satisfy these relationships. Formulas have been adopted to express con...
Kai Lin, David Chen, R. Geoff Dromey, Chengzheng S...
ICDT
2010
ACM
141views Database» more  ICDT 2010»
13 years 10 months ago
The Complexity of Rooted Phylogeny problems
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
Manuel Bodirsky, Jens K. Mueller
APPROX
2009
Springer
142views Algorithms» more  APPROX 2009»
14 years 1 months ago
Optimal Sherali-Adams Gaps from Pairwise Independence
Abstract. This work considers the problem of approximating fixed predicate constraint satisfaction problems (MAX k-CSP(P)). We show that if the set of assignments accepted by P co...
Konstantinos Georgiou, Avner Magen, Madhur Tulsian...