162 search results - page 26 / 33 » Study of Lower Bound Functions for MAX-2-SAT |
COLT
2008
Springer
14 years 11 months ago
2008
Springer
This paper describes an efficient reduction of the learning problem of ranking to binary classification. The reduction guarantees an average pairwise misranking regret of at most t...
EUROCRYPT
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. We consider the question of adaptive security for two related cryptographic primitives: all-or-nothing transforms and exposureresilient functions. Both are concerned with...
HPDC
2010
IEEE
14 years 9 months ago
2010
IEEE
Parallel computing on volatile distributed resources requires schedulers that consider job and resource characteristics. We study unconventional computing environments containing ...
JSS
2011
14 years 4 months ago
2011
Due to the complex nature of scientific workflow environments, temporal violations often take place and may severely reduce the timeliness of the execution’s results. To handle ...
MOR
2010
14 years 8 months ago
2010
We study the convergence properties of an alternating proximal minimization algorithm for nonconvex structured functions of the type: L(x, y) = f(x)+Q(x, y)+g(y), where f : Rn → ...