2957 search results - page 536 / 592 » The Complexity of Polynomial-Time Approximation |
EUROCRYPT
2012
Springer
11 years 10 months ago
2012
Springer
We describe a compression technique that reduces the public key size of van Dijk, Gentry, Halevi and Vaikuntanathan’s (DGHV) fully homomorphic scheme over the integers from ËœO(Î...
CVPR
2004
IEEE
14 years 9 months ago
2004
IEEE
Coalescence, meaning the tracker associates more than one trajectories to some targets while loses track for others, is a challenging problem for visual tracking of multiple targe...
ECCV
2006
Springer
14 years 9 months ago
2006
Springer
We propose a fast algorithm, EMD-L1, for computing the Earth Mover's Distance (EMD) between a pair of histograms. Compared to the original formulation, EMD-L1 has a largely si...
ICIP
2005
IEEE
14 years 9 months ago
2005
IEEE
Bezier curves (BC) are fundamental to a wide range of applications from computer-aided design through to object shape descriptions and surface mapping. Since BC only consider glob...
ISBI
2004
IEEE
14 years 8 months ago
2004
IEEE
The techniques described in this paper allow multiscale photon-limited image reconstruction methods to be implemented with significantly less computational complexity than previou...