4908 search results - page 188 / 982 » On the Complexity of Optimal K-Anonymity |
181
click to vote
ICML
2005
IEEE
16 years 7 months ago
2005
IEEE
Mappings to structured output spaces (strings, trees, partitions, etc.) are typically learned using extensions of classification algorithms to simple graphical structures (eg., li...
178
click to vote
DCC
2008
IEEE
16 years 6 months ago
2008
IEEE
Rate distortion optimization with Lagrangian formulation is widely used in video encoder control and has proved effective in achieving a good trade-off between coding efficiency a...
258
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
—The paper deals with efficient distribution of timely information to flows of mobile devices. We consider the case where a set of Information Dissemination Devices (IDDs) broa...
178
click to vote
AINA
2008
IEEE
16 years 1 months ago
2008
IEEE
With quick evolution of grid technologies and increasing complexity of e-Science applications, reasoning temporal properties of grid workflows to ensure reliability and trustworth...
174
click to vote
CSMR
2008
IEEE
16 years 1 months ago
2008
IEEE
We present Build Analyzer, a tool that helps developers optimize the build performance of huge systems written in C. Due to complex C header dependencies, even small code changes ...