Different methods of constructing KD-tree for nearest neighbor search by Ashok Suthar; supervised by N Rukma Rekha and Y.V. Subba Rao

Ashok Suthar
Call Number
PR001.6 A36D
Author
Ashok Suthar
Title
Different methods of constructing KD-tree for nearest neighbor search by Ashok Suthar; supervised by N Rukma Rekha and Y.V. Subba Rao
Publication
Hyderabad: University of Hyderabad, 2019.
Physical Description
32p.
Notes
Project Report (M.Tech) - School Of Computer and Information Sciences - University of Hyderabad - 500046.
Added Author
Rukma Rekha, N. supervisor
Subba Rao, Y.V. co-supervisor
Subject
COMPUTER SCIENCE - PROJECT REPORTS
Total Ratings: 0
Location Call Number Barcode Item Class Units Copy Number Status  
IGM Library PR001.6 A36D PR12055 Project Reports 1 Non-Circulating
 
 
 
00842nam a2200217 a 4500
001
 
 
vtls001586182
003
 
 
VRT
005
 
 
20201229113900.0
008
 
 
201229                  m    000 0 eng d
039
9
$y 202012291139 $z sure
082
$a PR001.6 $b A36D
100
1
$a Ashok Suthar
245
1
$a Different methods of constructing KD-tree for nearest neighbor search $c by Ashok Suthar; supervised by N Rukma Rekha and Y.V. Subba Rao
260
$a Hyderabad: $b University of Hyderabad, $c 2019.
300
$a 32p.
500
$a Project Report (M.Tech) - School Of Computer and Information Sciences - University of Hyderabad - 500046.
650
0
$a COMPUTER SCIENCE - PROJECT REPORTS
700
1
$a Rukma Rekha, N. $e supervisor
700
1
$a Subba Rao, Y.V. $e co-supervisor
999
$a VIRTUA
999
$a VTLSSORT0080*0820*1000*2450*2600*3000*5000*6500*7000*7001*9992
No Reviews to Display
Notes
Project Report (M.Tech) - School Of Computer and Information Sciences - University of Hyderabad - 500046.
Subject
COMPUTER SCIENCE - PROJECT REPORTS