Sciweavers

6045 search results - page 127 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
ENDM
2010
115views more  ENDM 2010»
13 years 5 months ago
On the knapsack closure of 0-1 Integer Linear Programs
Many inequalities for Mixed-Integer Linear Programs (MILPs) or pure Integer Linear Programs (ILPs) are derived from the Gomory corner relaxation, where all the nonbinding constrai...
Matteo Fischetti, Andrea Lodi
JMLR
2010
367views more  JMLR 2010»
13 years 2 months ago
Locally Linear Denoising on Image Manifolds
We study the problem of image denoising where images are assumed to be samples from low dimensional (sub)manifolds. We propose the algorithm of locally linear denoising. The algor...
Dian Gong, Fei Sha, Gérard G. Medioni
FOCS
2009
IEEE
14 years 2 months ago
2-Source Extractors under Computational Assumptions and Cryptography with Defective Randomness
Abstract— We show how to efficiently extract truly random bits from two independent sources of linear min-entropy, under a computational assumption. The assumption we rely on is...
Yael Tauman Kalai, Xin Li, Anup Rao
CRYPTO
2000
Springer
157views Cryptology» more  CRYPTO 2000»
14 years 11 days ago
Reducing the Servers Computation in Private Information Retrieval: PIR with Preprocessing
Private information retrieval (PIR) enables a user to retrieve a data item from a database, replicated among one or more servers, while hiding the identity of the retrieved item. ...
Amos Beimel, Yuval Ishai, Tal Malkin
ICIP
2005
IEEE
14 years 9 months ago
Camera calibration with spheres: linear approaches
This paper addresses the problem of camera calibration from spheres. By studying the relationship between the dual images of spheres and that of the absolute conic, a linear solut...
Hui Zhang, Guoqiang Zhang, Kwan-Yee Kenneth Wong