2342 search results - page 12 / 469 » Sublinear geometric algorithms |
STOC
2004
ACM
14 years 7 months ago
2004
ACM
INFOCOM
2008
IEEE
14 years 2 months ago
2008
IEEE
—It is important in communication networks to use routes that are as short as possible (i.e have low stretch) while keeping routing tables small. Recent advances in compact routi...
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
Dynamic connectivity is a well-studied problem, but so far the most compelling progress has been confined to the edge-update model: maintain an understanding of connectivity in a...
STOC
2004
ACM
14 years 7 months ago
2004
ACM
In this paper we present a sublinear time (1+ )-approximation randomized algorithm to estimate the weight of the minimum spanning tree of an n-point metric space. The running time...
IM
2006
13 years 7 months ago
2006
We consider the problem of computing information theoretic functions such as entropy on a data stream, using sublinear space. Our first result deals with a measure we call the &quo...