7519 search results - page 45 / 1504 » Optimizing Generic Functions |
CVPR
2010
IEEE
14 years 5 months ago
2010
IEEE
Multiplexing is a common technique for encoding highdimensional image data into a single, two-dimensional image. Examples of spatial multiplexing include Bayer patterns to capture...
PROVSEC
2007
Springer
14 years 3 months ago
2007
Springer
As such, public-key encryption with keyword search (a.k.a PEKS or searchable encryption) does not allow the recipient to decrypt keywords i.e. encryption is not invertible. This pa...
JAT
2010
13 years 8 months ago
2010
Sampling and reconstruction of generic multivariate functions is more efficient on non-Cartesian root lattices, such as the BCC (Body-Centered Cubic) lattice, than on the Cartesia...
CCO
2001
Springer
14 years 2 months ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
ICCV
2011
IEEE
12 years 9 months ago
2011
IEEE
Learning good image priors is of utmost importance for the study of vision, computer vision and image processing applications. Learning priors and optimizing over whole images can...