Sciweavers

725 search results - page 5 / 145
» Smoothed Analysis of Algorithms and Heuristics
Sort
View
3DIM
2003
IEEE
14 years 23 days ago
Reliable and Rapidly-Converging ICP Algorithm Using Multiresolution Smoothing
Autonomous range acquisition for 3D modeling requires reliable range registration, for both the precise localization of the sensor and combining the data from multiple scans for v...
Kok-Lim Low, Anselmo Lastra
SIAMJO
2002
115views more  SIAMJO 2002»
13 years 7 months ago
Superlinearly Convergent Algorithms for Solving Singular Equations and Smooth Reformulations of Complementarity Problems
We propose a new algorithm for solving smooth nonlinear equations in the case where their solutions can be singular. Compared to other techniques for computing singular solutions, ...
Alexey F. Izmailov, Mikhail V. Solodov
FM
2009
Springer
104views Formal Methods» more  FM 2009»
14 years 2 months ago
A Smooth Combination of Linear and Herbrand Equalities for Polynomial Time Must-Alias Analysis
Abstract. We present a new domain for analyzing must-equalities between address expressions. The domain is a smooth combination of Herbrand and affine equalities which enables us t...
Helmut Seidl, Vesal Vojdani, Varmo Vene
ISAAC
2009
Springer
175views Algorithms» more  ISAAC 2009»
14 years 2 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
STOC
2007
ACM
112views Algorithms» more  STOC 2007»
14 years 7 months ago
Smooth sensitivity and sampling in private data analysis
We introduce a new, generic framework for private data analysis. The goal of private data analysis is to release aggregate information about a data set while protecting the privac...
Kobbi Nissim, Sofya Raskhodnikova, Adam Smith