DANIEL JAMES, ANDREW W. HILL, ROBERT GURALNICK,' FARHAT HABIB,' ERIC WALTARI, AND WARD C. WHEELER J Department ofBiomedical Informatics, The Ohio State University, 3190 Graves Hall, 333 W. 10th Ave. Columbus, Ohio, 43210-1239, USA; E-mail: [email protected] Department of Ecology and Evolutionary Biology, University of Colorado, Boulder, Colorado, 80309-0334, USA; E-mail: Robert.Guralnick@...

A new solution method to the Nearest Neighbour Problem is presented. The method is based upon the triangle inequality and works well for small point sets, where traditional solutions are particularly ineffective. Its performance is characterized experimentally and compared with k-d tree and Elias approaches. A hybrid approach is proposed wherein the triangle inequality method is applied to the ...

A new solution method to the Nearest Neighbour Problem is presented. The method is based upon the triangle inequality and works well for small point sets, where traditional solutions are particularly ineffective. Its performance is characterized experimentally and compared with k-d tree and Elias approaches. A hybrid approach is proposed wherein the triangle inequality method is applied to the ...

Problem Set 1 is due next Wednesday. 2 Overview Today we will do the following. • Prove the Elias-Bassalygo-Johnson Bound introduced in the previous lecture. Recall that the proof consists of the two lemmas described roughly below – List decodable codes have poor rate. – Good error correcting codes are nicely decodable. • Introduce some algebraic codes along with some helpful idea from algebra....