4908 search results - page 734 / 982 » On the Complexity of Optimal K-Anonymity |
137
click to vote
PPOPP
2010
ACM
16 years 3 months ago
2010
ACM
We study the performance of three parallel algorithms and their hybrid variants for solving tridiagonal linear systems on a GPU: cyclic reduction (CR), parallel cyclic reduction (...
181
click to vote
Publication
Nearest neighbor (NN) classification assumes locally constant class conditional probabilities, and suffers from bias in high dimensions with a small sample set. In this paper, we p...
182
click to vote
SDM
2009
SIAM
16 years 3 months ago
2009
SIAM
Maximum margin clustering (MMC) has recently attracted considerable interests in both the data mining and machine learning communities. It first projects data samples to a kernel...
152
click to vote
SDM
2009
SIAM
16 years 3 months ago
2009
SIAM
Mean-Shift (MS) is a powerful non-parametric clustering method. Although good accuracy can be achieved, its computational cost is particularly expensive even on moderate data sets...
177
click to vote
EUROSYS
2007
ACM
16 years 3 months ago
2007
ACM
Software transactional memory (STM) is a promising technique for controlling concurrency in modern multi-processor architectures. STM aims to be more scalable than explicit coarse...