1066 search results - page 26 / 214 » Computing Private Set Operations with Linear Complexities |
ADCM
2007
14 years 9 months ago
2007
Motivated by the method for the reconstruction of 3D objects from a set of parallel cross sections, based on the binary operation between 2D sets termed “metric average”, we de...
CISS
2008
IEEE
15 years 4 months ago
2008
IEEE
Abstract— The objective of this paper is the linear reconstruction of a vector, up to a unimodular constant, when all phase information is lost, meaning only the magnitudes of fr...
IPPS
2008
IEEE
15 years 4 months ago
2008
IEEE
—The performance bottleneck for many scientific applications is the cost of memory access inside linear algebra kernels. Tuning such kernels for memory efficiency is a complex ...
90
Voted
ESA
2001
Springer
15 years 2 months ago
2001
Springer
Computing the Delaunay triangulation of n points requires usually a minimum of (n log n) operations, but in some special cases where some additional knowledge is provided, faster a...
NDSS
2008
IEEE
15 years 4 months ago
2008
IEEE
Traditionally, techniques for computing on encrypted data have been proposed with privacy preserving applications in mind. Several current cryptosystems support a homomorphic oper...