Sciweavers

3 search results - page 1 / 1
» Optimal bounds for sign-representing the intersection of two...
Sort
View
ML
2007
ACM
108views Machine Learning» more  ML 2007»
13 years 4 months ago
Unconditional lower bounds for learning intersections of halfspaces
We prove new lower bounds for learning intersections of halfspaces, one of the most important concept classes in computational learning theory. Our main result is that any statist...
Adam R. Klivans, Alexander A. Sherstov
COMPGEOM
2006
ACM
13 years 6 months ago
On the ICP algorithm
We present upper and lower bounds for the number of iterations performed by the Iterative Closest Point (ICP) algorithm. This algorithm has been proposed by Besl and McKay [4] as ...
Esther Ezra, Micha Sharir, Alon Efrat