3875 search results - page 380 / 775 » Approximation algorithms for the 0-extension problem |
154
click to vote
CRYPTO
2006
Springer
15 years 10 months ago
2006
Springer
Abstract Lattice reduction is a hard problem of interest to both publickey cryptography and cryptanalysis. Despite its importance, extremely few algorithms are known. The best algo...
184
click to vote
TCS
2008
15 years 6 months ago
2008
The medial axis is a classical representation of digital objects widely used in many applications. However, such a set of balls may not be optimal: subsets of the medial axis may ...
161
click to vote
ECCC
2008
15 years 6 months ago
2008
Given a set of observed economic choices, can one infer preferences and/or utility functions for the players that are consistent with the data? Questions of this type are called r...
188
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
Real life optimization problems often require finding optimal solution to complex high dimensional, multimodal problems involving computationally very expensive fitness function e...
200
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
In this paper we consider the k-set agreement problem in distributed round-based systems where processes communicate by message passing. We capture the synchrony and reliability o...