4908 search results - page 402 / 982 » On the Complexity of Optimal K-Anonymity |
213
click to vote
PAMI
2010
15 years 1 months ago
2010
We introduce Coherent Point Drift (CPD), a novel probabilistic method for nonrigid registration of point sets. The registration is treated as a Maximum Likelihood (ML) estimation ...
198
click to vote
PPL
2010
15 years 1 months ago
2010
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
177
click to vote
SIAMJO
2010
15 years 1 months ago
2010
Owing to their high accuracy and ease of formulation, there has been great interest in applying convex optimization techniques, particularly that of semidefinite programming (SDP)...
190
click to vote
SIAMNUM
2010
15 years 1 months ago
2010
In the numerical simulation of many practical problems in physics and engineering, finite volume methods are an important and popular class of discretization methods due to the loc...
213
click to vote
TDSC
2010
15 years 1 months ago
2010
This paper introduces dual-quorum replication, a novel data replication algorithm designed to support Internet edge services. Edge services allow clients to access Internet service...