Sciweavers

4908 search results - page 113 / 982
» On the Complexity of Optimal K-Anonymity
Sort
View
ICMCS
2009
IEEE
132views Multimedia» more  ICMCS 2009»
15 years 4 months ago
Video face recognition with graph-based semi-supervised learning
We consider the problem of classification of multiple observations of the same object, possibly under different transformations. We view this problem as a special case of semi-sup...
Effrosini Kokiopoulou, Pascal Frossard
TWC
2010
15 years 1 months ago
Fast algorithms for joint power control and scheduling in wireless networks
This paper studies the problem of finding a minimum-length schedule of a power-controlled wireless network subject to traffic demands and SINR (signal-to-interferenceplus-noise rat...
Liqun Fu, Soung Chang Liew, Jianwei Huang
EUROCRYPT
2011
Springer
14 years 10 months ago
Implementing Gentry's Fully-Homomorphic Encryption Scheme
We describe a working implementation of a variant of Gentry’s fully homomorphic encryption scheme (STOC 2009), similar to the variant used in an earlier implementation effort b...
Craig Gentry, Shai Halevi
COMPLEXITY
2004
108views more  COMPLEXITY 2004»
15 years 6 months ago
On the convergence of a factorized distribution algorithm with truncation selection
nical Abstract Optimization is to find the "best" solution to a problem where the quality of a solution can be measured by a given criterion. Estimation of Distribution A...
Qingfu Zhang
CCE
2008
15 years 6 months ago
Chance constrained programming approach to process optimization under uncertainty
Deterministic optimization approaches have been well developed and widely used in the process industry to accomplish off-line and on-line process optimization. The challenging tas...
Pu Li, Harvey Arellano-Garcia, Günter Wozny