2542 search results - page 428 / 509 » Computing Cartograms with Optimal Complexity |
144
click to vote
STOC
2009
ACM
16 years 3 months ago
2009
ACM
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
116
Voted
STOC
2009
ACM
16 years 3 months ago
2009
ACM
We consider and analyze a new algorithm for balancing indivisible loads on a distributed network with n processors. The aim is minimizing the discrepancy between the maximum and m...
91
Voted
VLSID
2003
IEEE
16 years 2 months ago
2003
IEEE
This paper quantifies the performance of typical functional unit interface designs in single-chip systems. We introduce a specific equation to guide the design of optimal module i...
126
Voted
STOC
2004
ACM
16 years 2 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...
252
Voted
STOC
2003
ACM
16 years 2 months ago
2003
ACM
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...