1207 search results - page 18 / 242 » Towards optimal k-anonymization |
IPPS
2008
IEEE
14 years 5 months ago
2008
IEEE
We introduce a generic framework for the distributed execution of combinatorial optimization tasks. Instead of relying on custom hardware (like dedicated parallel machines or clus...
CORR
2012
Springer
12 years 6 months ago
2012
Springer
We address the online linear optimization problem with bandit feedback. Our contribution is twofold. First, we provide an algorithm (based on exponential weights) with a regret of...
CORR
2008
Springer
13 years 11 months ago
2008
Springer
1 Recently, great attention was intended toward overcomplete dictionaries and the sparse representations they can provide. In a wide variety of signal processing problems, sparsity...
CCGRID
2005
IEEE
14 years 4 months ago
2005
IEEE
The emerging service grids bring together various distributed services to a ‘market’ for clients to request and enable the integration of services across distributed, heteroge...
COCO
1995
Springer
14 years 2 months ago
1995
Springer
For the worst-case complexity measure, if P = NP, then P = OptP, i.e., all NP optimization problems are polynomial-time solvable. On the other hand, it is not clear whether a simi...