3875 search results - page 230 / 775 » Approximation algorithms for the 0-extension problem |
170
click to vote
PPAM
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorit...
138
click to vote
CRYPTO
2004
Springer
15 years 11 months ago
2004
Springer
In this paper we study the long standing problem of information extraction from multiple linear approximations. We develop a formal statistical framework for block cipher attacks b...
162
click to vote
FOCS
2006
IEEE
16 years 6 days ago
2006
IEEE
We advance significantly beyond the recent progress on the algorithmic complexity of Nash equilibria by solving two major open problems in the approximation of Nash equilibria an...
177
click to vote
ISPEC
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. In this paper we address the problem of inefficiency of exact attack tree computations. We propose several implementation-level optimizations and introduce a genetic algo...
191
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
This paper introduces a novel algorithm for the nonnegative matrix factorization and completion problem, which aims to find nonnegative matrices X and Y from a subset of entries o...