Art
J-GLOBAL ID:200902183341255170   Reference number:99A0618476

An optimal algorithm for approximate nearest neighbor searching in fixed dimensions.

固定次元における近似最近点探索に対する最適アルゴリズム
Author (5):
Material:
Volume: 45  Issue:Page: 891-923  Publication year: Nov. 1998 
JST Material Number: C0267A  ISSN: 0004-5411  Document type: Article
Article type: 原著論文  Country of issue: United States (USA)  Language: ENGLISH (EN)
Thesaurus term:
Thesaurus term/Semi thesaurus term
Keywords indexed to the article.
All keywords is available on JDreamIII(charged).
On J-GLOBAL, this item will be available after more than half a year after the record posted. In addtion, medical articles require to login to MyJ-GLOBAL.
,...
Semi thesaurus term:
Thesaurus term/Semi thesaurus term
Keywords indexed to the article.
All keywords is available on JDreamIII(charged).
On J-GLOBAL, this item will be available after more than half a year after the record posted. In addtion, medical articles require to login to MyJ-GLOBAL.
,...
   To see more with JDream III (charged).   {{ this.onShowAbsJLink("http://jdream3.com/lp/jglobal/index.html?docNo=99A0618476&from=J-GLOBAL&jstjournalNo=C0267A") }}
JST classification (2):
JST classification
Category name(code) classified by JST.
Theory of computation  ,  Graphic and image processing in general 
Terms in the title (4):
Terms in the title
Keywords automatically extracted from the title.

Return to Previous Page