1464 search results - page 13 / 293 » On optimal anonymization for l -diversity |
CASES
2010
ACM
14 years 9 months ago
2010
ACM
We present a fine-grain dynamic instruction placement algorithm for small L0 scratch-pad memories (spms), whose unit of transfer can be an individual instruction. Our algorithm ca...
102
click to vote
CVPR
2010
IEEE
14 years 9 months ago
2010
IEEE
The calculation of a low-rank approximation of a matrix is a fundamental operation in many computer vision applications. The workhorse of this class of problems has long been the ...
104
click to vote
SC
2005
ACM
15 years 5 months ago
2005
ACM
Many emerging large-scale data science applications require searching large graphs distributed across multiple memories and processors. This paper presents a distributed breadth...
COMPSAC
2011
IEEE
13 years 11 months ago
2011
IEEE
—Secure Computation (SC) enables secure distributed computation of arbitrary functions of private inputs. It has many useful applications, e.g. benchmarking or auctions. Several ...
IPPS
2007
IEEE
15 years 6 months ago
2007
IEEE
We discuss real-world case studies involving the implementation of a web services middleware tier for the IBM Blue Gene/L supercomputer to support financial business applications...