The logic engine and the realization problem for nearest neighbor graphs

Author： Eades P.   Whitesides S.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.169, Iss.1, 1996-11, pp. : 23-37

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

An Experimental Comparison of the Nearest-Neighbor and Nearest-Hyperrectangle Algorithms

By Wettschereck D.  

Machine Learning, Vol. 19, Iss. 1, 1995-04 ,pp. : 5-27

Springer Publishing Company

Access to resources Recommend Favorite

Technical Note: First Nearest Neighbor Classification on Frey and Slate's Letter Recognition Problem

By Fogarty T.C.  

Machine Learning, Vol. 09, Iss. 4, 1992-10 ,pp. : 387-388

Springer Publishing Company

Access to resources Recommend Favorite

Selective Sampling for Nearest Neighbor Classifiers

By Lindenbaum Michael  

Machine Learning, Vol. 54, Iss. 2, 2004-02 ,pp. : 125-152

Springer Publishing Company

Access to resources Recommend Favorite

Time-Optimal Nearest-Neighbor Computations on Enhanced Meshes

By Olariu S.   Stojmenovic I.  

Journal of Parallel and Distributed Computing, Vol. 36, Iss. 2, 1996-08 ,pp. : 144-155

Academic Press

Access to resources Recommend Favorite

A Weighted Nearest Neighbor Algorithm for Learning with Symbolic Features

By Cost S.  

Machine Learning, Vol. 10, Iss. 1, 1993-01 ,pp. : 57-78

Springer Publishing Company

Access to resources Recommend Favorite