Abstract. Let C be a polygonal cycle on n vertices in the plane. A randomized algorithm is presented which computes in O(n log3 n) expected time, the edge of C whose removal result...
Hee-Kap Ahn, Mohammad Farshi, Christian Knauer, Mi...
In this paper we present an infeasible path-following interiorpoint algorithm for solving linear programs using a relaxed notion of the central path, called quasicentral path, as ...
Image-based rendering (IBR) has been used to synthesize images corresponding to a new view point from stored images. Rendering methods based on a three-dimensional plenoptic functi...
Previous work shows request tracing systems help understand and debug the performance problems of multi-tier services. However, for large-scale data centers, more than hundreds of...
This paper reports on a promising approach for solving problems found when Multi Protocol Label Switching (MPLS), soon to be a dominant protocol, is used in core network systems. D...