Sciweavers

ISAAC
2009
Springer
245views Algorithms» more  ISAAC 2009»
15 years 7 months ago
Pattern Matching for 321-Avoiding Permutations
Sylvain Guillemot, Stéphane Vialette
108
Voted
ISAAC
2009
Springer
175views Algorithms» more  ISAAC 2009»
15 years 7 months ago
Worst-Case and Smoothed Analysis of k-Means Clustering with Bregman Divergences
The k-means algorithm is the method of choice for clustering large-scale data sets and it performs exceedingly well in practice. Most of the theoretical work is restricted to the c...
Bodo Manthey, Heiko Röglin
103
Voted
ISAAC
2009
Springer
169views Algorithms» more  ISAAC 2009»
15 years 7 months ago
The Complexity of Solving Stochastic Games on Graphs
We consider some well-known families of two-player zero-sum perfect-information stochastic games played on finite directed graphs. Generalizing and unifying results of Liggett and...
Daniel Andersson, Peter Bro Miltersen
ISAAC
2009
Springer
168views Algorithms» more  ISAAC 2009»
15 years 7 months ago
On the Camera Placement Problem
We introduce a new probing problem: what is the minimum number of cameras at fixed positions necessary and sufficient to reconstruct any strictly convex polygon contained in a dis...
Rudolf Fleischer, Yihui Wang
Algorithms
Top of PageReset Settings