1207 search results - page 157 / 242 » Towards optimal k-anonymization |
ATAL
2011
Springer
12 years 9 months ago
2011
Springer
The fastest known algorithm for solving General Bayesian Stackelberg games with a finite set of follower (adversary) types have seen direct practical use at the LAX airport for o...
ICC
2011
IEEE
12 years 9 months ago
2011
IEEE
Abstract—Grids can efficiently deal with challenging computational and data processing tasks which cutting edge science is generating today. So-called e-Science grids cope with ...
ICDAR
2011
IEEE
12 years 9 months ago
2011
IEEE
—We propose a novel scenario called “writer retrieval” consisting in the retrieval from a set of documents all those produced by the same writer. The retrieval is based on a ...
PADL
2012
Springer
12 years 5 months ago
2012
Springer
Declarative networking is a programming methodology that enables developers to concisely specify network protocols and services, and directly compile these specifications into a d...
SIGIR
2012
ACM
12 years 2 days ago
2012
ACM
Enterprise search is challenging for several reasons, notably the dynamic terminology and jargon that are specific to the enterprise domain. This challenge is partly addressed by...