Sciweavers

4908 search results - page 204 / 982
» On the Complexity of Optimal K-Anonymity
Sort
View
DCC
2002
IEEE
16 years 6 months ago
Rate-Based versus Distortion-Based Optimal Joint Source-Channel Coding
- We consider a joint source-channel coding system that protects an embedded wavelet bitstream against noise using a finite family of channel codes with error detection and error c...
Raouf Hamzaoui, Vladimir Stankovic
DCC
2004
IEEE
16 years 6 months ago
Efficient Bit Allocation for Dependent Video Coding
A steepest descent based bit allocation method with polynomial iteration complexity for minimizing the sum of frame distortions under a total bit rate constraint is presented for ...
Yegnaswamy Sermadevi, Sheila S. Hemami
ICDE
2010
IEEE
189views Database» more  ICDE 2010»
15 years 6 months ago
Caching all plans with just one optimizer call
Abstract— Modern database management systems (DBMS) answer a multitude of complex queries on increasingly larger datasets. Given the complexities of the queries and the numerous ...
Debabrata Dash, Ioannis Alagiannis, Cristina Maier...
HPCA
2003
IEEE
16 years 7 months ago
Dynamic Optimization of Micro-Operations
Inherent within complex instruction set architectures such as x86 are inefficiencies that do not exist in a simpler ISAs. Modern x86 implementations decode instructions into one o...
Brian Slechta, David Crowe, Brian Fahs, Michael Fe...
SIGMOD
2003
ACM
146views Database» more  SIGMOD 2003»
16 years 6 months ago
Estimating Compilation Time of a Query Optimizer
A query optimizer compares alternative plans in its search space to find the best plan for a given query. Depending on the search space and the enumeration algorithm, optimizers v...
Ihab F. Ilyas, Jun Rao, Guy M. Lohman, Dengfeng Ga...