Sciweavers

ALENEX
2007
98views Algorithms» more  ALENEX 2007»
13 years 11 months ago
Computing Visibility on Terrains in External Memory
Herman J. Haverkort, Laura Toma, Yi Zhuang
ALENEX
2007
102views Algorithms» more  ALENEX 2007»
13 years 11 months ago
Linearization: Locally Self-Stabilizing Sorting in Graphs
We consider the problem of designing a distributed algorithm that, given an arbitrary connected graph G of nodes with unique labels, converts G into a sorted list of nodes. This a...
Melih Onus, Andréa W. Richa, Christian Sche...
ALENEX
2007
130views Algorithms» more  ALENEX 2007»
13 years 11 months ago
Locating Guards for Visibility Coverage of Polygons
We propose heuristics for visibility coverage of a polygon with the fewest point guards. This optimal coverage problem, often called the “art gallery problem”, is known to be ...
Yoav Amit, Joseph S. B. Mitchell, Eli Packer
ALENEX
2007
104views Algorithms» more  ALENEX 2007»
13 years 11 months ago
Practical Entropy-Compressed Rank/Select Dictionary
Daisuke Okanohara, Kunihiko Sadakane
ALENEX
2007
105views Algorithms» more  ALENEX 2007»
13 years 11 months ago
ScrewBox: a Randomized Certifying Graph-Non-Isomorphism Algorithm
We present a novel randomized approach to the graph isomorphism problem. Our algorithm aims at solving difficult instances by producing randomized certificates for non-isomorphis...
Martin Kutz, Pascal Schweitzer
ALENEX
2010
117views Algorithms» more  ALENEX 2010»
13 years 11 months ago
Untangling the Braid: Finding Outliers in a Set of Streams
Monitoring the performance of large shared computing systems such as the cloud computing infrastructure raises many challenging algorithmic problems. One common problem is to trac...
Chiranjeeb Buragohain, Luca Foschini, Subhash Suri
ALENEX
2010
161views Algorithms» more  ALENEX 2010»
13 years 11 months ago
Route Planning with Flexible Objective Functions
We present the first fast route planning algorithm that answers shortest paths queries for a customizable linear combination of two different metrics, e. g. travel time and energy...
Robert Geisberger, Moritz Kobitzsch, Peter Sanders
ALENEX
2010
163views Algorithms» more  ALENEX 2010»
13 years 11 months ago
Conjunctive Filter: Breaking the Entropy Barrier
Daisuke Okanohara, Yuichi Yoshida
ALENEX
2010
163views Algorithms» more  ALENEX 2010»
13 years 11 months ago
Succinct Trees in Practice
We implement and compare the major current techniques for representing general trees in succinct form. This is important because a general tree of n nodes is usually represented i...
Diego Arroyuelo, Rodrigo Cánovas, Gonzalo N...