7006 search results - page 428 / 1402 » Approximation Algorithms |
152
click to vote
CORR
2011
Springer
14 years 8 months ago
2011
Springer
We address the problem of minimizing a convex function over the space of large matrices with low rank. While this optimization problem is hard in general, we propose an efficient...
119
click to vote
FOCS
2009
IEEE
15 years 11 months ago
2009
IEEE
In many settings the power of truthful mechanisms is severely bounded. In this paper we use randomization to overcome this problem. In particular, we construct an FPTAS for multi-...
147
click to vote
CD
2005
Springer
15 years 10 months ago
2005
Springer
In distributed and mobile environments, the connections among the hosts on which a software system is running are often unstable. As a result of connectivity losses, the overall a...
138
Voted
FOCM
2002
15 years 4 months ago
2002
Given an ordinary differential equation on a homogeneous manifold, one can construct a "geometric integrator" by determining a compatible ordinary differential equation ...
169
click to vote
FOIKS
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. We give a general framework for approximate query processing in semistructured databases. We focus on regular path queries, which are the integral part of most of the que...