1464 search results - page 291 / 293 » On optimal anonymization for l -diversity |
ANCS
2010
ACM
13 years 5 months ago
2010
ACM
: Ensemble Routing For Datacenter Networks Mike Schlansker, Yoshio Turner, Jean Tourrilhes, Alan Karp HP Laboratories HPL-2010-120 Networks, Ethernet, Multipath, Switching, Fault ...
EGH
2010
Springer
13 years 5 months ago
2010
Springer
The k-D tree is a well-studied acceleration data structure for ray tracing. It is used to organize primitives in a scene to allow efficient execution of intersection operations be...
EUROPAR
2009
Springer
13 years 5 months ago
2009
Springer
Abstract. Point matching is crucial for many computer vision applications. Establishing the correspondence between a large number of data points is a computationally intensive proc...
FAST
2009
13 years 5 months ago
2009
The scale of today's storage systems has made it increasingly difficult to find and manage files. To address this, we have developed Spyglass, a file metadata search system t...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. CAT(0) metric spaces constitute a far-reaching common generalization of Euclidean and hyperbolic spaces and simple polygons: any two points x and y of a CAT(0) metric spa...