1464 search results - page 99 / 293 » On optimal anonymization for l -diversity |
179
click to vote
UAI
2003
15 years 7 months ago
2003
Many practitioners who use EM and related algorithms complain that they are sometimes slow. When does this happen, and what can be done about it? In this paper, we study the gener...
190
click to vote
POS
1994
Springer
15 years 10 months ago
1994
Springer
We consider some issues in optimizing persistent programming languages. In particular, we show how to express optimizations of object residency checks in strongly typed persistent...
177
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
Recent work has shown that one can learn the structure of Gaussian Graphical Models by imposing an L1 penalty on the precision matrix, and then using efficient convex optimization...
160
click to vote
IEEEPACT
2009
IEEE
16 years 1 months ago
2009
IEEE
—With increasing numbers of cores, future CMPs (Chip Multi-Processors) are likely to have a tiled architecture with a portion of shared L2 cache on each tile and a bankinterleave...
186
click to vote
PCI
2005
Springer
15 years 12 months ago
2005
Springer
Cache misses form a major bottleneck for memory-intensive applications, due to the significant latency of main memory accesses. Loop tiling, in conjunction with other program tran...