236 search results - page 30 / 48 » From Weak to Strong Watermarking |
JSYML
1998
13 years 9 months ago
1998
Abstract. After small forcing, any <κ-closed forcing will destroy the supercompactness and even the strong compactness of κ. In a delightful argument, Laver [L78] proved that ...
FOCS
2009
IEEE
14 years 4 months ago
2009
IEEE
— We prove the following strong hardness result for learning: Given a distribution on labeled examples from the hypercube such that there exists a monomial (or conjunction) consi...
ECCV
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. A new approach, called Collective Shape Difference Classifier (CSDC), is proposed to improve the accuracy and computational efficiency of 3D face recognition. The CSDC le...
ICPR
2006
IEEE
14 years 11 months ago
2006
IEEE
In this paper, we propose a new data reduction algorithm that iteratively selects some samples and ignores others that can be absorbed, or represented, by those selected. This alg...
MICCAI
2007
Springer
14 years 10 months ago
2007
Springer
In this paper, we propose a unified framework for computing atlases from manually labeled data at various degrees of "sharpness" and the joint registration-segmentation o...