Entry Nandy:2000:ENN from lncs2000.bib
Last update: Thu May 16 02:07:42 MDT 2019
Top |
Symbols |
Numbers |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@Article{Nandy:2000:ENN,
author = "Subhas C. Nandy",
title = "An Efficient $k$ Nearest Neighbor Searching Algorithm
for a Query Line",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1858",
pages = "281--??",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Fri Feb 1 09:16:48 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1858.htm;
http://www.math.utah.edu/pub/tex/bib/lncs2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1858/18580281.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1858/18580281.pdf",
acknowledgement = ack-nhfb,
}
Related entries
- $k$,
1731(0)98,
1731(0)217,
1767(0)187,
1770(0)581,
1770(0)605,
1825(0)63,
1851(0)111,
1851(0)286,
1853(0)236,
1853(0)636,
1853(0)768,
1928(0)302,
1940(0)205,
1940(0)218
- Efficient,
1759(0)83,
1759(0)197,
1767(0)150,
1767(0)226,
1777(0)350,
1799(0)79,
1800(0)435,
1800(0)1291,
1807(0)392,
1807(0)418,
1807(0)431,
1807(0)539,
1818(0)108,
1825(0)103,
1851(0)353,
1851(0)407,
1853(0)235,
1853(0)317,
1858(0)126,
1858(0)262,
1858(0)299,
1861(0)269,
1861(0)553,
1861(0)1078,
1877(0)66,
1880(0)413,
1880(0)533,
1902(0)103,
1910(0)96,
1910(0)243,
1910(0)685,
1915(0)57,
1928(0)107,
1928(0)172,
1932(0)534,
1934(0)158,
1937(0)288,
1940(0)252,
1941(0)288,
1955(0)25,
1955(0)189,
1955(0)417,
1975(0)237,
1976(0)143,
1976(0)317,
1976(0)415,
1977(0)117,
1977(0)191,
1977(0)213,
1983(0)17
- line,
1731(0)59,
1858(0)44,
1928(0)11,
1941(0)335
- Nandy, Subhas C.,
1767(0)187
- Nearest,
2125(0)276
- neighbor,
2125(0)276
- Query,
1770(0)133,
1773(0)45,
1777(0)167,
1777(0)254,
1777(0)525,
1832(0)209,
1851(0)57,
1853(0)914,
1861(0)1063,
1864(0)328,
1866(0)60,
1866(0)78,
1909(0)331,
1910(0)75,
1912(0)22,
1923(0)324,
1923(0)372,
1932(0)256,
1932(0)377,
1932(0)435,
1941(0)256,
1949(0)31,
1949(0)61,
1949(0)99,
1949(0)208,
1955(0)326,
1974(0)11,
1974(0)336,
2125(0)287
- Searching,
1767(0)211,
1851(0)150,
1866(0)243,
1923(0)364,
1931(0)195,
1974(0)252,
2125(0)276