Sciweavers

ALENEX
2004
121views Algorithms» more  ALENEX 2004»
14 years 26 days ago
Experimental Comparison of Shortest Path Approaches for Timetable Information
We consider two approaches that model timetable information in public transportation systems as shortestpath problems in weighted graphs. In the time-expanded approach every event...
Evangelia Pyrga, Frank Schulz, Dorothea Wagner, Ch...
ALENEX
2004
120views Algorithms» more  ALENEX 2004»
14 years 26 days ago
Compositions and Patricia Tries: No Fluctuations in the Variance!
We prove that the variance of the number of different letters in random words of length n, with letters i and probabilities 2-i attached to them, is 1 + o(1). Likewise, the varian...
Helmut Prodinger
ALENEX
2004
92views Algorithms» more  ALENEX 2004»
14 years 26 days ago
Gap-Free Samples of Geometric Random Variables
We study the asymptotic probability that a random composition of an integer n is gap-free, that is, that the sizes of parts in the composition form an interval. We show that this ...
Pawel Hitczenko, Arnold Knopfmacher
ALENEX
2004
116views Algorithms» more  ALENEX 2004»
14 years 26 days ago
A Computational Framework for Handling Motion
We present a framework for implementing geometric algorithms involving motion. It is written in C++ and modeled after and makes extensive use of CGAL (Computational Geometry Algor...
Leonidas J. Guibas, Menelaos I. Karavelas, Daniel ...
ALENEX
2004
107views Algorithms» more  ALENEX 2004»
14 years 26 days ago
An Experimental Analysis of a Compact Graph Representation
In previous work we described a method for compactly representing graphs with small separators, which makes use of small separators, and presented preliminary experimental results...
Daniel K. Blandford, Guy E. Blelloch, Ian A. Kash
ALENEX
2004
107views Algorithms» more  ALENEX 2004»
14 years 26 days ago
Approximating the Visible Region of a Point on a Terrain
Given a terrain T and a point p on or above it, we wish to compute the region Rp that is visible from p. We present a generic radar-like algorithm for computing an approximation o...
Boaz Ben-Moshe, Paz Carmi, Matthew J. Katz
ALENEX
2004
110views Algorithms» more  ALENEX 2004»
14 years 26 days ago
Computation of a Class of COntinued Fraction Constants
There are numerous instances where mathematical constants do not admit a closed form. It is then of great interest to compute them, possibly in an efficient way. So the question i...
Loïck Lhote
ALENEX
2004
99views Algorithms» more  ALENEX 2004»
14 years 26 days ago
Kernelization Algorithms for the Vertex Cover Problem: Theory and Experiments
d Abstract) Faisal N. Abu-Khzam , Rebecca L. Collins , Michael R. Fellows , Michael A. Langston , W. Henry Suters and Chris T. Symons
Faisal N. Abu-Khzam, Rebecca L. Collins, Michael R...