Sciweavers

79 search results - page 9 / 16
» isaac 2009
Sort
View
ISAAC
2009
Springer
175views Algorithms» more  ISAAC 2009»
14 years 4 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
ISAAC
2009
Springer
101views Algorithms» more  ISAAC 2009»
14 years 4 months ago
Maintaining Nets and Net Trees under Incremental Motion
The problem of maintaining geometric structures for points in motion has been well studied over the years. Much theoretical work to date has been based on the assumption that point...
Minkyoung Cho, David M. Mount, Eunhui Park
ISAAC
2009
Springer
114views Algorithms» more  ISAAC 2009»
14 years 4 months ago
Good Programming in Transactional Memory
Abstract. In a multicore transactional memory (TM) system, concurrent execution threads interact and interfere with each other through shared memory. The less interference a progra...
Raphael Eidenbenz, Roger Wattenhofer
ISAAC
2009
Springer
127views Algorithms» more  ISAAC 2009»
14 years 4 months ago
Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms
Abstract. Given two comparative maps, that is two sequences of markers each representing a genome, the Maximal Strip Recovery problem (MSR) asks to extract a largest sequence of ma...
Laurent Bulteau, Guillaume Fertin, Irena Rusu
ISAAC
2009
Springer
98views Algorithms» more  ISAAC 2009»
14 years 4 months ago
New Bounds on the Average Distance from the Fermat-Weber Center of a Planar Convex Body
The Fermat-Weber center of a planar body Q is a point in the plane from which the average distance to the points in Q is minimal. We first show that for any convex body Q in the ...
Adrian Dumitrescu, Csaba D. Tóth