First Page | Meta Content | |
---|---|---|
![]() | Document Date: 2009-09-18 18:19:01Open Document File Size: 429,17 KBShare Result on FacebookCityBern / Tallahassee / /CompanyGPU / Sun / AMD / Intel / /CurrencyAMD / / /FacilityFlorida State University / /IndustryTermperformance computing / theoretical algorithms / parallel algorithms / mainstream computing / actual solution / parallel kd-tree construction algorithm / multi-core processors / construction algorithm / recursive algorithm / cache-efficient algorithm / efficient k-nearest neighbor construction algorithm / approximate nearest neighbor solution / binary search / partial solution / partial nearest neighbor solution / nearest neighbor solution / approximate solution / knng algorithm / visualization applications / parallel algorithm / kd-tree algorithm / geographic information systems / cache-coherent shared memory multi-processors / nearest neighbor algorithms / /OperatingSystemIsis / Linux / SUSE Linux / Microsoft Windows / /OrganizationNational Science Foundation / Department of Computer Science / Florida State University / /PersonPiyush Kumar / Morton Ordering / Michael Connor / Samidh Chatterjee / /PositionPrime Minister / /ProductPentax K-x Digital Camera / Taylor / Zvalues / /ProgrammingLanguageFL / /ProvinceOrStateManitoba / Florida / /Technology2009 3 Algorithm / knng algorithm / cache-efficient algorithm / efficient k-nearest neighbor construction algorithm / Linux / parallel kd-tree construction algorithm / parallel algorithm / operating system / 1 Floating Point Morton Order Algorithm / operating systems / recursive algorithm / cache-coherent shared memory multi-processors / k-NNG algorithm / kd-tree algorithm / nearest neighbor algorithms / T2 OpenSparc processor / 2 KNN Graph Construction Algorithm / 2009 Algorithm / k-NNG construction algorithm / 2.3 The k-Nearest Neighbor Graph Construction Algorithm Algorithm / done using a recursive algorithm / /URLhttp /SocialTag |