Intersection algorithm: Difference between revisions

Revision as of 22:34, 22 December 2004

Revision as of 00:46, 22 January 2005

Line 6:

==Method==

Given M intervals c +/- r, (which is [c-r,c+r],) the algorithm seeks to find an interval with M-f sources. The value f is referred to as the number of falsetickers, those sources which are in error (the actual value is outside the confidence band). The best estimate is that which assumes the least number of falsetickers, f. The results will be considered valid if f<m/2, otherwise the algorithm will return failure instead of an interval.

The intersection algorithm begins by creating a table of tuples <offset,type>. For each interval there are three entries, the lower endpoint, the midpoint and the upper endpoint, labelled with types -1, 0 1 respectively. Thus interval c +/- r results in entries <c-r,-1> <c,0> <c+r,+1>. These are then sorted by offset.