1403 search results - page 140 / 281 » About Approximations of Exponentials |
126
click to vote
CRYPTO
2009
Springer
15 years 11 months ago
2009
Springer
We prove the equivalence, up to a small polynomial approximation factor n/ log n, of the lattice problems uSVP (unique Shortest Vector Problem), BDD (Bounded Distance Decoding) and...
166
click to vote
WINE
2007
Springer
15 years 10 months ago
2007
Springer
A context in sponsored search is additional information about a query, such as the user’s age, gender or location, that can change an advertisement’s relevance or an advertise...
132
click to vote
ISAAC
2004
Springer
15 years 10 months ago
2004
Springer
Assuming 3-SAT formulas are hard to refute with high probability, Feige showed approximation hardness results, among others for the max bipartite clique. We extend this result in t...
152
click to vote
HAIS
2009
Springer
15 years 9 months ago
2009
Springer
In engineering design the use of approximation models (= surrogate models) has become standard practice for design space exploration, sensitivity analysis, visualization and optimi...
157
click to vote
ESA
2008
Springer
15 years 6 months ago
2008
Springer
We study the mechanism design problem of scheduling unrelated machines and we completely characterize the decisive truthful mechanisms for two players when the domain contains bot...