The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Paper info

O. J. Murphy, Stanley M. Selkow
The Efficiency of Using k-d Trees for Finding Nearest Neighbors in Discrete Space. [Citation Graph (1, 0)][DBLP]
Inf. Process. Lett., 1986, v:23, n:4, pp:215-218 [Journal]

Scores and Rank
SCEAS: 0.43893
SCEAS_PS: 0.00552
SCEAS_BPS: 0.00689
SCEAS_EPS: 0.01602
SCEAS_BEPS: 0.02024
SCEAS_B0: 3.13316
PAGE_RANK: 0.48968
HITS_H: 0
HITS_A: 0.09788
BHITS_H: 0
BHITS_A: 0.00068
SALSA_A: 0.16556
SALSA_H: 0
BSALSA_A: 0.04669
BSALSA_H: 0
P: 0
BCC: 0.02844
citations_to_me: 1
citations_from_me: 0



Graph produced by graphviz-1.8.5
Level:
Show on graph: DBLP citations: Citations Imported from Citeseer:
Level:
Show on graph: DBLP citations: Citations Imported from Citeseer:

NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002