132
click to vote
ISAAC
15 years 10 months ago
2009 Springer 
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...
142
click to vote
ISAAC
15 years 10 months ago
2009 Springer
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...
169
click to vote
ISAAC
15 years 10 months ago
2009 Springer
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...
98
Voted
ISAAC
15 years 8 months ago
2009 Springer  |
Algorithms