Sciweavers

915 search results - page 160 / 183
» Proof labeling schemes
Sort
View
ICCV
2011
IEEE
12 years 8 months ago
Maximizing All Margins: Pushing Face Recognition with Kernel Plurality
We present two theses in this paper: First, performance of most existing face recognition algorithms improves if instead of the whole image, smaller patches are individually class...
Ritwik Kumar, Arunava Banerjee, CISE, Univ, Baba V...
ICCV
2003
IEEE
14 years 10 months ago
"Perspective Shape from Shading" and Viscosity Solutions
This article proposes a solution of the Lambertian shape from shading (SFS) problem in the case of a pinhole camera model (performing a perspective projection). Our approach is ba...
Emmanuel Prados, Olivier D. Faugeras
STOC
2009
ACM
91views Algorithms» more  STOC 2009»
14 years 8 months ago
Inaccessible entropy
We put forth a new computational notion of entropy, which measures the (in)feasibility of sampling high entropy strings that are consistent with a given protocol. Specifically, we...
Iftach Haitner, Omer Reingold, Salil P. Vadhan, Ho...
KDD
2008
ACM
120views Data Mining» more  KDD 2008»
14 years 8 months ago
Multi-class cost-sensitive boosting with p-norm loss functions
We propose a family of novel cost-sensitive boosting methods for multi-class classification by applying the theory of gradient boosting to p-norm based cost functionals. We establ...
Aurelie C. Lozano, Naoki Abe
DCC
2008
IEEE
14 years 7 months ago
Semantic security for the McEliece cryptosystem without random oracles
In this paper, we formally prove that padding the plaintext with a random bit-string provides the semantic security against chosen plaintext attack (IND-CPA) for the McEliece (and ...
Ryo Nojima, Hideki Imai, Kazukuni Kobara, Kirill M...