Sciweavers

4302 search results - page 204 / 861
» Index Pairs Algorithms
Sort
View
OPODIS
2007
15 years 5 months ago
Distributed Approximation Algorithms for Finding 2-Edge-Connected Subgraphs
Abstract. We consider the distributed construction of a minimum weight 2edge-connected spanning subgraph (2-ECSS) of a given weighted or unweighted graph. A 2-ECSS of a graph is a ...
Sven Oliver Krumke, Peter Merz, Tim Nonner, Kathar...
CCCG
2006
15 years 5 months ago
An O(n log n) Algorithm for the All-Farthest-Segments Problem for a Planar Set of Points
In this paper, we propose an algorithm for computing the farthest-segment Voronoi diagram for the edges of a convex polygon and apply this to obtain an O(n log n) algorithm for th...
Asish Mukhopadhyay, Robert L. Scot Drysdale
IMAGING
2004
15 years 5 months ago
Testing HDR Image Rendering Algorithms
Eight high-dynamic-range image rendering algorithms were tested using ten high-dynamic-range pictorial images. A large-scale paired comparison psychophysical experiment was develo...
Jiangtao Kuang, Hiroshi Yamaguchi, Garrett M. John...
CORR
2007
Springer
94views Education» more  CORR 2007»
15 years 3 months ago
Paging and Registration in Cellular Networks: Jointly Optimal Policies and an Iterative Algorithm
— This paper explores optimization of paging and registration policies in cellular networks. Motion is modeled as a discrete-time Markov process, and minimization of the discount...
Bruce Hajek, Kevin Mitzel, Sichao Yang
IOR
2006
173views more  IOR 2006»
15 years 3 months ago
A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
In the dial-a-ride problem, users formulate requests for transportation from a specific origin to a specific destination. Transportation is carried out by vehicles providing a sha...
Jean-François Cordeau