Sciweavers

1464 search results - page 185 / 293
» On optimal anonymization for l -diversity
Sort
View
SDM
2009
SIAM
219views Data Mining» more  SDM 2009»
16 years 3 months ago
A Hybrid Data Mining Metaheuristic for the p-Median Problem.
Metaheuristics represent an important class of techniques to solve, approximately, hard combinatorial optimization problems for which the use of exact methods is impractical. In t...
Alexandre Plastino, Erick R. Fonseca, Richard Fuch...
IEEEPACT
2005
IEEE
16 years 4 hour ago
Instruction Based Memory Distance Analysis and its Application
Feedback-directed Optimization has become an increasingly important tool in designing and building optimizing compilers as itprovides a means to analyze complexprogram behavior th...
Changpeng Fang, Steve Carr, Soner Önder, Zhen...
SIGMETRICS
2004
ACM
15 years 11 months ago
Multicast protocols for scalable on-demand download
Previous scalable protocols for downloading large, popular files from a single server include batching and cyclic multicast. With batching, clients wait to begin receiving a reque...
Niklas Carlsson, Derek L. Eager, Mary K. Vernon
LCTRTS
2004
Springer
15 years 11 months ago
Finding effective compilation sequences
Most modern compilers operate by applying a fixed, program-independent sequence of optimizations to all programs. Compiler writers choose a single “compilation sequence”, or ...
L. Almagor, Keith D. Cooper, Alexander Grosul, Tim...
DATE
2004
IEEE
175views Hardware» more  DATE 2004»
15 years 10 months ago
Breaking Instance-Independent Symmetries in Exact Graph Coloring
Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems, such as graph coloring used in register allocation. Graph coloring is...
Arathi Ramani, Fadi A. Aloul, Igor L. Markov, Kare...