Sciweavers

TALG
2010
48views more  TALG 2010»
13 years 9 months ago
Geodesic delaunay triangulations in bounded planar domains
Steve Oudot, Leonidas J. Guibas, Jie Gao, Yue Wang
TALG
2010
86views more  TALG 2010»
13 years 9 months ago
Approximating corridors and tours via restriction and relaxation techniques
Given a rectangular boundary partitioned into rectangles, the Minimum-Length Corridor (MLC-R) problem consists of finding a corridor of least total length. A corridor is a set of ...
Arturo Gonzalez-Gutierrez, Teofilo F. Gonzalez
TALG
2010
82views more  TALG 2010»
13 years 9 months ago
A near-optimal algorithm for estimating the entropy of a stream
Amit Chakrabarti, Graham Cormode, Andrew McGregor
TALG
2010
101views more  TALG 2010»
13 years 9 months ago
Reasoning about online algorithms with weighted automata
We describe an automata-theoretic approach for the competitive analysis of online algorithms. Our approach is based on weighted automata, which assign to each input word a cost in...
Benjamin Aminof, Orna Kupferman, Robby Lampert
TALG
2010
110views more  TALG 2010»
13 years 9 months ago
Approximating fractional hypertree width
Fractional hypertree width is a hypergraph measure similar to tree width and hypertree width. Its algorithmic importance comes from the fact that, as shown in previous work [14], ...
Dániel Marx
TALG
2010
73views more  TALG 2010»
13 years 9 months ago
Discounted deterministic Markov decision processes and discounted all-pairs shortest paths
We present two new algorithms for finding optimal strategies for discounted, infinite-horizon, Deterministic Markov Decision Processes (DMDP). The first one is an adaptation of...
Omid Madani, Mikkel Thorup, Uri Zwick