45 search results - page 5 / 9 » approx 2010 |
APPROX
2010
Springer
14 years 13 days ago
2010
Springer
We initiate the study of on-line metric embeddings. In such an embedding we are given a sequence of n points X = x1, . . . , xn one by one, from a metric space M = (X, D). Our goal...
APPROX
2010
Springer
14 years 13 days ago
2010
Springer
: Let (C1, C1), (C2, C2), . . . , (Cm, Cm) be a sequence of ordered pairs of 2CNF clauses chosen uniformly at random (with repetition) from the set of all 4 n 2 clauses on n variab...
APPROX
2010
Springer
14 years 13 days ago
2010
Springer
In this paper, we investigate whether a constant round Lasserre Semi-definite Programming (SDP) relaxation might give a good approximation to the UNIQUE GAMES problem. We show tha...
APPROX
2010
Springer
14 years 13 days ago
2010
Springer
We present a simple factor 6 algorithm for approximating the optimal multiplicative distortion of embedding (unweighted) graph metrics into tree metrics (thus improving and simplif...
INTERSPEECH
2010
13 years 5 months ago
2010
The paper presents an in-depth analysis of a less known interaction between Kneser-Ney smoothing and entropy pruning that leads to severe degradation in language model performance...