Sciweavers

2796 search results - page 121 / 560
» The coolest path problem
Sort
View
ISAAC
2007
Springer
93views Algorithms» more  ISAAC 2007»
16 years 17 days ago
Dilation-Optimal Edge Deletion in Polygonal Cycles
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...
TAPIA
2003
ACM
15 years 11 months ago
A new infeasible interior-point algorithm for linear programming
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 ...
Miguel Argáez, Leticia Velázquez
PSIVT
2009
Springer
143views Multimedia» more  PSIVT 2009»
15 years 11 months ago
Image-Based Rendering by Virtual 1D Cameras
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...
Naoyuki Ichimura
CORR
2010
Springer
77views Education» more  CORR 2010»
15 years 6 months ago
Decreasing log data of multi-tier services for effective request tracing
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...
Bo Sang, Jianfeng Zhan, Guanhua Tian
ICC
2007
IEEE
162views Communications» more  ICC 2007»
15 years 10 months ago
LSP and Back Up Path Setup in MPLS Networks Based on Path Criticality Index
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...
Ali Tizghadam, Alberto Leon-Garcia