Computing on which side a training point lies
		• First compute all the pairwise distances between training points. • Then, just look up the distance from a training point to each of the two “poles” of the hyper-plane. – This is very efficient for high- dimensional spaces. • The computational efficiency and the low complexity both come from the fact that we define 0(N^2) hyper-planes using only N points.
						pole 2
				pole 1