Sciweavers

4908 search results - page 159 / 982
» On the Complexity of Optimal K-Anonymity
Sort
View
PLDI
2009
ACM
16 years 1 months ago
Proving optimizations correct using parameterized program equivalence
Translation validation is a technique for checking that, after an optimization has run, the input and output of the optimization are equivalent. Traditionally, translation validat...
Sudipta Kundu, Zachary Tatlock, Sorin Lerner
SIGMOD
1996
ACM
132views Database» more  SIGMOD 1996»
15 years 10 months ago
Cost-Based Optimization for Magic: Algebra and Implementation
Magic sets rewriting is a well-known optimization heuristic for complex decision-support queries. There can be many variants of this rewriting even for a single query, which diffe...
Praveen Seshadri, Joseph M. Hellerstein, Hamid Pir...
DSN
2007
IEEE
16 years 25 days ago
How to Choose a Timing Model?
When employing a consensus algorithm for state machine replication, should one optimize for the case that all communication links are usually timely, or for fewer timely links? Do...
Idit Keidar, Alexander Shraer
TEC
2010
173views more  TEC 2010»
15 years 1 months ago
Analysis of Computational Time of Simple Estimation of Distribution Algorithms
Estimation of distribution algorithms (EDAs) are widely used in stochastic optimization. Impressive experimental results have been reported in the literature. However, little work ...
Tianshi Chen, Ke Tang, Guoliang Chen, Xin Yao
TIP
2008
108views more  TIP 2008»
15 years 6 months ago
Design of Linear Equalizers Optimized for the Structural Similarity Index
Abstract--We propose an algorithm for designing linear equalizers that maximize the structural similarity (SSIM) index between the reference and restored signals. The SSIM index ha...
Sumohana S. Channappayya, Alan C. Bovik, Constanti...