1464 search results - page 277 / 293 » On optimal anonymization for l -diversity |
ICS
2004
Tsinghua U.
14 years 27 days ago
2004
Tsinghua U.
Given the scale of massively parallel systems, occurrence of faults is no longer an exception but a regular event. Periodic checkpointing is becoming increasingly important in the...
SPAA
2003
ACM
14 years 24 days ago
2003
ACM
Quantum computation has become an intriguing technology with which to attack difficult problems and to enhance system security. Quantum algorithms, however, have been analyzed un...
ASIACRYPT
2003
Springer
14 years 23 days ago
2003
Springer
We present two new parallel algorithms for extending the domain of a UOWHF. The first algorithm is complete binary tree based construction and has less key length expansion than S...
GECCO
2003
Springer
14 years 23 days ago
2003
Springer
Abstract. A brachistochrone is the path along which a weighted particle falls most quickly from one point to another, and a catenary is the smooth curve connecting two points whose...
GECCO
2003
Springer
14 years 23 days ago
2003
Springer
A bit climber using a Gray encoding is guaranteed to converge to a global optimum in fewer than ¢¤£¦¥¨§© evaluations on unimodal 1-D functions and on multi-dimensional sph...