Sciweavers

218 search results - page 30 / 44
» Strong Bounds Consistencies and Their Application to Linear ...
Sort
View
VLDB
2000
ACM
129views Database» more  VLDB 2000»
14 years 5 days 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
CSDA
2007
127views more  CSDA 2007»
13 years 8 months ago
Computing the least quartile difference estimator in the plane
A common problem in linear regression is that largely aberrant values can strongly influence the results. The least quartile difference (LQD) regression estimator is highly robus...
Thorsten Bernholt, Robin Nunkesser, Karen Schettli...
ISPD
2004
ACM
189views Hardware» more  ISPD 2004»
14 years 2 months ago
Almost optimum placement legalization by minimum cost flow and dynamic programming
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...
Ulrich Brenner, Anna Pauli, Jens Vygen
DISOPT
2007
155views more  DISOPT 2007»
13 years 8 months ago
Linear-programming design and analysis of fast algorithms for Max 2-CSP
The class Max (r, 2)-CSP (or simply Max 2-CSP) consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m bin...
Alexander D. Scott, Gregory B. Sorkin
LATA
2009
Springer
14 years 3 months ago
Monadic Second-Order Logic for Graphs: Algorithmic and Language Theoretical Applications
This tutorial will present an overview of the use of Monadic Second-Order Logic to describe sets of finite graphs and graph transformations, in relation with the notions of tree-w...
Bruno Courcelle