4908 search results - page 380 / 982 » On the Complexity of Optimal K-Anonymity |
270
click to vote
VLDB
2002
ACM
16 years 7 months ago
2002
ACM
The view selection problem is to choose a set of views to materialize over a database schema, such that the cost of evaluating a set of workload queries is minimized and such that ...
191
click to vote
DCC
2008
IEEE
16 years 6 months ago
2008
IEEE
This paper investigates the design and application of the optimal filter banks for a predictioncompensated multiple description coding (PC-MDC) scheme, where the coefficients in e...
170
click to vote
ICCAD
2003
IEEE
16 years 3 months ago
2003
IEEE
In this paper, we study the problem of retiming of sequential circuits with both interconnect and gate delay. Most retiming algorithms have assumed ideal conditions for the non-lo...
210
Voted
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
—The emerging wireless relay networks (WRNs) are expected to provide significant improvement on throughput and extension of coverage area for next-generation wireless systems. W...
197
click to vote
SMC
2007
IEEE
16 years 1 months ago
2007
IEEE
—Reinforcement learning is a framework in which an agent can learn behavior without knowledge on a task or an environment by exploration and exploitation. Striking a balance betw...