AMS eContent Search Results 




[1] Sariel HarPeled.
Geometric Approximation Algorithms.
Math. Surveys Monogr.
173
(2011)
MR 2760023.
Book volume table of contents [2] Steve Smale and DingXuan Zhou. Shannon sampling and function reconstruction from point values. Bull. Amer. Math. Soc. 41 (2004) 279305. MR 2058288. Abstract, references, and article information View Article: PDF [3] Bernard Moret. Towards a discipline of experimental algorithmics. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 59 (2002) 197213. Book volume table of contents View Article: PDF [4] Catherine McGeoch. A bibliography of algorithm experimentation. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 59 (2002) 251256. Book volume table of contents View Article: PDF [5] JuanCarlos PerezCortes and Enrique Vidal. Approximate nearest neighbor search using the extended general spacefilling curves heuristic. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 59 (2002) 125175. Book volume table of contents View Article: PDF [6] David Johnson. A theoretician's guide to the experimental analysis of algorithms. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 59 (2002) 215250. Book volume table of contents View Article: PDF [7] Andrew Goldberg and Craig Silverstein. Computational evaluation of hot queues. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 59 (2002) 4967. Book volume table of contents View Article: PDF [8] R. Battiti. Partially persistent dynamic sets for historysensitive heuristics. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 59 (2002) 121. Book volume table of contents View Article: PDF [9] Craig Silverstein. A practical perfect hashing algorithm. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 59 (2002) 2347. Book volume table of contents View Article: PDF [10] Michael H. Goldwasser, David S. Johnson and Catherine C. McGeoch (Editors). Data Structures, Near Neighbor Searches, and Methodology: Fifth and Sixth DIMACS Implementation Challenges. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 59 (2002) MR MR1967938. Book volume table of contents [11] Norio Katayama and Shin’ichi Satoh. Experimental evaluation of diskbased data structures for nearest neighbor searching. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 59 (2002) 87104. Book volume table of contents View Article: PDF [12] Richard Anderson. The role of experiment in the theory of algorithms. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 59 (2002) 191195. Book volume table of contents View Article: PDF [13] Kevin Zatloukal, Mary Johnson and Richard Ladner. Nearest neighbor search for data compression. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 59 (2002) 6986. Book volume table of contents View Article: PDF [14] Songrit Maneewongvatana and David Mount. Analysis of approximate nearest neighbor searching with clustered point sets. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 59 (2002) 105123. Book volume table of contents View Article: PDF [15] Peter Yianilos. Locally lifting the curse of dimensionality for nearest neighbor search. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 59 (2002) 177190. Book volume table of contents View Article: PDF [16] Bernard Moret. Towards a discipline of experimental algorithmics. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 59 (2002) 197213. Book volume table of contents View Article: PDF [17] Catherine McGeoch. A bibliography of algorithm experimentation. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 59 (2002) 251256. Book volume table of contents View Article: PDF [18] JuanCarlos PerezCortes and Enrique Vidal. Approximate nearest neighbor search using the extended general spacefilling curves heuristic. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 59 (2002) 125175. Book volume table of contents View Article: PDF [19] David Johnson. A theoretician's guide to the experimental analysis of algorithms. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 59 (2002) 215250. Book volume table of contents View Article: PDF [20] Andrew Goldberg and Craig Silverstein. Computational evaluation of hot queues. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 59 (2002) 4967. Book volume table of contents View Article: PDF [21] R. Battiti. Partially persistent dynamic sets for historysensitive heuristics. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 59 (2002) 121. Book volume table of contents View Article: PDF [22] Craig Silverstein. A practical perfect hashing algorithm. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 59 (2002) 2347. Book volume table of contents View Article: PDF [23] Michael H. Goldwasser, David S. Johnson and Catherine C. McGeoch (Editors). Data Structures, Near Neighbor Searches, and Methodology: Fifth and Sixth DIMACS Implementation Challenges. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 59 (2002) MR MR1967938. Book volume table of contents [24] Norio Katayama and Shin’ichi Satoh. Experimental evaluation of diskbased data structures for nearest neighbor searching. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 59 (2002) 87104. Book volume table of contents View Article: PDF [25] Richard Anderson. The role of experiment in the theory of algorithms. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 59 (2002) 191195. Book volume table of contents View Article: PDF [26] Kevin Zatloukal, Mary Johnson and Richard Ladner. Nearest neighbor search for data compression. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 59 (2002) 6986. Book volume table of contents View Article: PDF [27] Songrit Maneewongvatana and David Mount. Analysis of approximate nearest neighbor searching with clustered point sets. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 59 (2002) 105123. Book volume table of contents View Article: PDF [28] Peter Yianilos. Locally lifting the curse of dimensionality for nearest neighbor search. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 59 (2002) 177190. Book volume table of contents View Article: PDF [29] Sajal Das and M. Pinotti. Efficient schemes for distributing data on parallel memory systems. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 50 (1999) 233245. Book volume table of contents View Article: PDF [30] KiemPhong Vo. Concrete software libraries. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 50 (1999) 181205. Book volume table of contents View Article: PDF 
Results: 1 to 30 of 62 found Go to page: 1 2 3 