{"title":"Experimental evaluation of disk-based data structures for nearest neighbor searching","authors":"Norio Katayama, S. Satoh","doi":"10.1090/dimacs/059/05","DOIUrl":"https://doi.org/10.1090/dimacs/059/05","url":null,"abstract":"","PeriodicalId":370446,"journal":{"name":"Data Structures, Near Neighbor Searches, and Methodology","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122999340","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Nearest neighbor search for data compression","authors":"K. Zatloukal, M. H. Johnson, R. Ladner","doi":"10.1090/dimacs/059/04","DOIUrl":"https://doi.org/10.1090/dimacs/059/04","url":null,"abstract":"","PeriodicalId":370446,"journal":{"name":"Data Structures, Near Neighbor Searches, and Methodology","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114280048","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Partially persistent dynamic sets for history-sensitive heuristics","authors":"R. Battiti","doi":"10.1090/dimacs/059/01","DOIUrl":"https://doi.org/10.1090/dimacs/059/01","url":null,"abstract":"EEectiveheuristic algorithmsfor combinatorialproblemsare based on integrating local neighborhood search with history-sensitive schemes, where the information collected during the previous search phase is used to direct the future eeort. In particular, some algorithms (like Strict Tabu Search and Reactive Tabu Search) need to detect whether a connguration has already been encountered during the previous phase of the search, either to prohibit repetitions or to determine a prohibition parameter in an adaptive way. This paper analyzes the use of persistent dynamic sets for storing and retrieving states and discusses the advantages of this option with respect to popular but less eecient realizations. If the search space is given by L-bit binary strings, the method complexity is O(L) average-case time per search iteration when hashing is used, while the total space for a sequence of t iterations is O(t). A concrete realization of the abstract data type through a C++ class is presented. The obtained memory occupation and timing results are analyzed for selected dictionary\" benchmark tasks and for the use of the structure to support history{sensitive heuristic algorithms, in particular for the Maximum Clique problem in graphs.","PeriodicalId":370446,"journal":{"name":"Data Structures, Near Neighbor Searches, and Methodology","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130802756","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Computational evaluation of hot queues","authors":"A. Goldberg, Craig Silverstein","doi":"10.1090/dimacs/059/03","DOIUrl":"https://doi.org/10.1090/dimacs/059/03","url":null,"abstract":"The heap-on-top (hot) priority queue data structure 6] improves on the best known times for Dijkstra's shortest path algorithm. It also has very good practical performance and is robust over a wide range of graph types. The heart of Dijkstra's algorithm is a monotone priority queue, that is, a priority queue where no element on the queue ever becomes smaller than the most recently extracted element. In this paper, we show that the hot queue implementation of monotone priority queues is competitive in a more general context.","PeriodicalId":370446,"journal":{"name":"Data Structures, Near Neighbor Searches, and Methodology","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115592997","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The role of experiment in the theory of algorithms","authors":"Richard J. Anderson","doi":"10.1090/dimacs/059/09","DOIUrl":"https://doi.org/10.1090/dimacs/059/09","url":null,"abstract":"","PeriodicalId":370446,"journal":{"name":"Data Structures, Near Neighbor Searches, and Methodology","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115472658","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Approximate nearest neighbor search using the extended general space-filling curves heuristic","authors":"J. Pérez-Cortes, E. Vidal","doi":"10.1090/dimacs/059/07","DOIUrl":"https://doi.org/10.1090/dimacs/059/07","url":null,"abstract":"","PeriodicalId":370446,"journal":{"name":"Data Structures, Near Neighbor Searches, and Methodology","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130984240","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A bibliography of algorithm experimentation","authors":"Catherine C. McGeoch","doi":"10.1090/dimacs/059/12","DOIUrl":"https://doi.org/10.1090/dimacs/059/12","url":null,"abstract":"Preliminary Draft. This annotated bibliography lists sources that address methodology, tools and techniques, and standards for experimental research on algorithms. I've tried, in the annotation, to summarize the content and the target audience. No attempt has been made to catalog the huge number of published examples of experimental and computational research on algorithms, although some general publication venues are listed. We begin with a shortlist of resources for the beginning experimentor. These sources, taken together, provide good overall coverage of the main issues of experimental research, at about the level of a rst-year graduate student in computer science. The larger reference list that follows contains works on more specialized, advanced, and technical topics. Bentley Ben91] shows how to build a Unix environment that supports eecient testing and data collection. Ahuja, Magnanti, and Orlin AMO93] discuss algorithmic performance measures that closely predict running times and that (to some extent) can be extrapolated across machine environments. Cohen Coh95] presents basic statistical concepts with many examples from experimental research on algorithms. For a good introduction to techniques of graphical data analysis, see Chambers et al. CCKT83]. Crowder, Dembo, Mulvey CDM78], and the follow-up article by Jackson et al. JBNP91] give criteria and standards for presentation of experimental research in published work. The rst 1","PeriodicalId":370446,"journal":{"name":"Data Structures, Near Neighbor Searches, and Methodology","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125952285","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A theoretician's guide to the experimental analysis of algorithms","authors":"David S. Johnson","doi":"10.1090/dimacs/059/11","DOIUrl":"https://doi.org/10.1090/dimacs/059/11","url":null,"abstract":"This paper presents an informal discussion of issues that arise when one attempts to analyze algorithms experimentally. It is based on lessons learned by the author over the course of more than a decade of experimentation, survey paper writing, refereeing, and lively discussions with other experimentalists. Although written from the perspective of a theoretical computer scientist, it is intended to be of use to researchers from all fields who want to study algorithms experimentally. It has two goals: first, to provide a useful guide to new experimentalists about how such work can best be performed and written up, and second, to challenge current researchers to think about whether their own work might be improved from a scientific point of view. With the latter purpose in mind, the author hopes that at least a few of his recommendations will be considered controversial.","PeriodicalId":370446,"journal":{"name":"Data Structures, Near Neighbor Searches, and Methodology","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127767994","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A practical perfect hashing algorithm","authors":"Craig Silverstein","doi":"10.1090/dimacs/059/02","DOIUrl":"https://doi.org/10.1090/dimacs/059/02","url":null,"abstract":"Hashing is a fundamental technique in Computer Science, and perfect hashing, which guarantees constant-time lookup, has particular theoretical and practical importance. The algorithm of Fredman, Komll os, and Szemer edi 8], augmented by Dietzfelbinger, et al. 7], is a simple perfect hashing scheme that has not seen extensive use due to poor practical performance. In this paper, we develop modiications to the previous techniques that result in a fast, space-eecient algorithm. We show the resulting algorithm is comparable to hash algorithms used in several popular dictionary libraries but is more exible and has better theoretical performance.","PeriodicalId":370446,"journal":{"name":"Data Structures, Near Neighbor Searches, and Methodology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129737107","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}