Sciweavers

1930 search results - page 353 / 386
» Learning to Solve QBF
Sort
View
ASIACRYPT
2011
Springer
12 years 7 months ago
The Leakage-Resilience Limit of a Computational Problem Is Equal to Its Unpredictability Entropy
A cryptographic assumption is the (unproven) mathematical statement that a certain computational problem (e.g. factoring integers) is computationally hard. The leakage-resilience l...
Divesh Aggarwal, Ueli Maurer
CIKM
2011
Springer
12 years 7 months ago
Towards feature selection in network
Traditional feature selection methods assume that the data are independent and identically distributed (i.i.d.). In real world, tremendous amounts of data are distributed in a net...
Quanquan Gu, Jiawei Han
CVPR
2009
IEEE
15 years 2 months ago
Coupled Spectral Regression for Matching Heterogeneous Faces
Face recognition algorithms need to deal with variable lighting conditions. Near infrared (NIR) image based face recognition technology has been proposed to effectively overcome...
Stan Z. Li, Zhen Lei
ICCV
2009
IEEE
15 years 21 days ago
Efficient subset selection based on the Renyi entropy
Many machine learning algorithms require the summation of Gaussian kernel functions, an expensive operation if implemented straightforwardly. Several methods have been proposed t...
Vlad I. Morariu1, Balaji V. Srinivasan, Vikas C. R...
CVPR
2004
IEEE
14 years 9 months ago
High-Zoom Video Hallucination by Exploiting Spatio-Temporal Regularities
In this paper, we consider the problem of super-resolving a human face video by a very high (?16) zoom factor. Inspired by recent literature on hallucination and examplebased lear...
Göksel Dedeoglu, Jonas August, Takeo Kanade